The Voynich Ninja

MarcoP made a count of the letters of words in the ms.
 
Counted were the end-letters of a word and also the start-letter of the next word. Only single letters.
We call that combination prefix - suffix,  which applies to two words, but only 1 letter of the prefix and 1 letter of the prefix were used.
 
Also counted were the first letters of words and the combination of those with end letters of that same word. We call that combination first-last letter, which applies to one word.
 
Those counts have been placed in a matrix and two graphs show the numbers.
 
 
Conclusion
The pattern for both matrices are the same.
We can see that the first - last letter of 1 word follow the exact same pattern/tules versus the suffix word_A followed by prefix of word_B.
 
To the writer of the VMS it did not matter if he wrote just words or sequences of words: they follow the same rules.
This means, there are only 8 possible end letters of a word and 12 possible first letters of any word.


See the graphs here: You are not allowed to view links. Register or Login to view.


Addition:
This is a simplication of my so called language dna method, which i developed some years ago for language identification purposes,
explained in detail on my site You are not allowed to view links. Register or Login to view.  and You are not allowed to view links. Register or Login to view.

I have moved this post to a new thread of its own, as the content seems to warrant it.

(06-04-2016, 11:43 PM)Davidsch Wrote: You are not allowed to view links. Register or Login to view.Conclusion
The pattern for both matrices are the same.
We can see that the first - last letter of 1 word follow the exact same pattern/tules versus the suffix word_A followed by prefix of word_B.
 
To the writer of the VMS it did not matter if he wrote just words or sequences of words: they follow the same rules.
This means, there are only 8 possible end letters of a word and 12 possible first letters of any word.


See the graphs here: You are not allowed to view links. Register or Login to view.

Hello David,
data in the two matrices seem rather different to me.

E.g. 
column 'a' of table 1 has:
a:1 l:2 n:0

column 'a' of table 2 has:
a:2 l:158 n:232

yes, but as you can by the graphs, you have to reverse the axis of 1 table to see them in right perspective.

(You can notice that the graphs are also reversed in order)

i also have a matrix where they are both in the same direction. Let me find it and post it there.

DONE

The term "suffix" here refers to the last letter of a word or to the first letter?

the combination prefix - suffix,  which applies to two words, 
represents the suffix of 1 letter of Word A and the 
1 letter prefix of the following word B

Then is not the third graph erroneous? If I understand correctly, according to that graph there should be ~7000 words with suffix c, - i.e. ending with c.

you seem to be right, something is wrong ! i will check the file this evening

The graphs are fine. Data checked. Seems also right.

There was a problem in the additional numbers in the  table i made to show all data however,
by "cleaning up the zero" i used search and replace and erroneously removed also the zero's in any number.. 
i replaced that table and added the summs.

Now i also replaced the prefix table with a reversed orientation.

Anton:
As you can see there are 7088 words with suffix c.
from those there are 10 words of the next word that have a prefix with a
and 0 with prefix c

As a fact, only these letters have a prefix & suffix that are the same:  adlory:  a (2x), d (18x), l (170x), o (99x), r(18x), s (15x), y (287x)
i made a new table for that

I'm still confused.

The statement "the word has suffix c" equals the statement "the word ends with c", am I right?

If so, then 7088 words end with c? Can this be true?