26-06-2025, 03:46 AM
(This post was last modified: 26-06-2025, 03:48 AM by Jorge_Stolfi.)
(25-06-2025, 10:17 AM)ReneZ wrote: You are not allowed to view links. Register or Login to view.Using computer terminology, if this were an enumeration system, it would appear to be neither high-endian nor low-endian, but rather both-endian.
Yes, this is the only other possible explanation that I could think of for the binomial-like distribution of the lexeme(*) lengths. See my You are not allowed to view links. Register or Login to view.about this.
Roman numerals from 1 to 999 too have a binomial-like distribution. So, just looking at the stats, it is possible that Voynichese words are just numbers into a codebook, constructed "on the fly".
Namely, the Author keeps a dictionary of plainword->codenumber as a stack of index cards, sorted by the word. The first word of the plaintext gets the code 1. He takes each word of the plaintext in turn and looks it up inthe dictionary. If it is there, he writes the corresponding code number. Otherwise he assigns to that word the next available code number, and adds it to the dictionary.
This process has the result that the most frequent words of the language will tend to get the smallest code numbers. if the codes are written in a Roman-like scheme as described in that page, the most common words will tend to get shorter codes-- an optimization seen in natural languages and the VMS.
However, I don't believe in this alternative theory; because, for one thing, a codebook cipher is extremely laborious to generate and read. Without computer help, it would be feasible only for short texts, like a diplomatic or military message.
All the best, --jorge
(*) lexeme = an entry of the lexicon, irrespective of its frequency in the text. Is that what is being called "word type" now?


![[+]](https://www.voynich.ninja/images/collapse_collapsed.png)