VM TTR values

[Searcher]

I think most people understand that thoughtlessly removing all common endings will not lead to anything good, since all we get is frequent beginnings. Why not continue to search the rules? Is it really a hopeless exercise and does not lead to any positive results? So what are we doing here?

My point was kind of the opposite. If we thoughtlessly remove all common endings and beginnings from Latin, what we are left with is still relatively good. It won't be a real language and information will be lost, but in almost all metrics you can imagine it will behave like a normal language. Word length might start looking abnormal, as an abnormal amount of words will be very short. But most words in this text will still look viable. With Voynichese you cannot do anything like that.

Oh, it wasn't an objection to your Latin example indeed. Maybe I put quotes not too well. I rather confirmed your phrase from the next quote, adding my observation, as I've also tried to delete "-dy"s, "-edy's or "-iin's and saw that the result was "many frequent beginnings".

It's true I've been looking for ways to optimize certain stats, but I did so without taking the "workability" of the system into account. What I did was check if the information within voynichese words could be expressed in such a way that entropy becomes normal (it barely does). But this was a purely statistical exercise that did not aim to discover a workable encryption system.

For example, a workable version might be that each Voynichese word stands for one plaintext letter that has been padded in a way to make it look like a word. So if one knows how to read the relevant letters, one can easily ignore the padding and retrieve the meaning.

I try to do this, too. I want to reach higher perfection of my experiment, and I'll share it later. Maybe, it's just an exercise, but still... who knows where it will lead to.