Positional Mimic Cipher (PM-Cipher)

[quimqu]

Thank you, Jorge.
  

Second, IIUC, the JSD assumes that the two distributions P,Q are defined on the same set of elements, and compares the probabilities assigned by P and Q on each element.  Thus if P is the letter pair distribution of a text, and Q is the letter pair distribution of the same text encoded with a Caesar cipher, the JST should come out huge.  Do you take this into account, and try to vary the mapping between letters of the two languages?

Just to clarify: I’m not comparing raw Vietnamese (or natural languages) against Voynich with JSD. All my JSD results for the cipher are EVA vs EVA. The cipher outputs EVA glyphs, and the Voynich reference is in EVA too, so both distributions are defined on the exact same alphabet. I think it is the right way to do it, but if this is not the right way, please feel free to tell me...

In case you haven't noticed, those "special chars" are modifiers for the letters.  It makes no sense to exclude them.

Yes, I noticed. I think I need to reconstruct the modifiers to unicode or similar, so I get the letter+modifier in a single char, and re-run. Do you think this would help? Some modifiers are separated chars, like here: "O^zya". If I work with unicode, "O^" would be a single char. One question, can I lowerize the capitalized chars, or they are really different (eg. O vs. o)?

Thanks again!!!