qokeedy qokeedy qokedy qokedy qokeedy

[ReneZ]

qokedy dy sheety qokedy qokeedy qokechdy lol qokeedy qokeedy qokedy qokedy qokeedy ldy yshedy qokeedy qokeedy olkeedy otey koldy

I have been 'playing' with a verbose cipher, where this parses into individual characters as follows:

(q)(oke)(d)(y) (d)(y) (shee)(t)(y) (q)(oke)(d)(y) (q)(okee)(d)(y) (q)(oke)(ch)(d)(y) (l)(ol) (q)(okee)(d)(y) (q)(okee)(d)(y) (q)(oke)(d)(y) (q)(oke)(d)(y) (q)(okee)(d)(y) (l)(d)(y) (y)(she)(d)(y) (q)(okee)(d)(y) (q)(okee)(d)(y) (ol)(kee)(d)(y) (ote)(y) (k)(ol)(d)(y)

This already looks far less repetitive, because now most of the repetition is at the character level.
Here, one can even imagine that some of the repetition is the result of mistakes during 'encoding'.

If one takes a second step and considers some characters as nulls, this further reduces to:

(q)(ke)(d) (d) (shee)(t) (q)(ke)(d) (q)(kee)(d) (q)(ke)(ch)(d) (l)(l) (q)(kee)(d) (q)(kee)(d) (q)(ke)(d) (q)(ke)(d) (q)(kee)(d) (l)(d) (y)(she)(d) (q)(kee)(d) (q)(kee)(d) (l)(kee)(d) (te) (k)(l)(d)

It gets even 'better'.

This was perhaps the most extreme case of repetition in the MS (?)