(24-06-2020, 12:43 PM)ReneZ wrote: You are not allowed to view links. Register or Login to view.All this is based on the assumption that the Voynich MS words are the equivalents of complete words in some natural language.
This is a most natural assumption that is made almost automatically by most people (at least by most people presenting solutions) but I am not at all sure that it is correct.
There are arguments in favour of it and arguments against it, but both types are rather weak.
In favour: adherence (more or less) to Zipf's law
Against: unusual distribution of repeating word sequences.
There are far more arguments (without claim of completeness):
In favor (somehow it looks like language):
- it is structured
- adherence to Zipf's law
- context dependency
Against (it doesn't behave like natural language):
- repetition, repetition and repetition / low entropy value
- binomial word length distribution
- no word order / repeated phrases are missing
- Currier A vs. Currier B
- context-dependent self-similarity / deep correlation between frequency, similarity, and spatial vicinity of tokens / one single network of similar words
- random walk results / long-range correlations
- the line works as a functional unit
- no distinguishable semantic word categories (nouns vs verbs etc.)
- function words are missing (equally distributed words)
- no identifiable word roots
- no deleted glyph sequences
- the end of the lines nearly always fit into the available space