Discussion of "A possible generating algorithm of the Voynich manuscript"

[MarcoP]

So let's do the test. I have taken folio f58r. This has a lot of text in three paragraphs.

For every word, one can make the comparison with all previous words, and find the one with the smallest distance.
Using the most recent ZL transliteration (version 1r, You are not allowed to view links. Register or Login to view. ), and ignoring uncertain spaces (*), this has 344 words. Of these, exactly 25% have a minimum L distances of three or more.

Hi Rene,
I have spent a few hours trying to compare the ZL transliteration with the output of Timm and Schinner's software. As always, I may have made errors along the way.
Though I used the ZL file you mentioned, I could not perfectly replicate your results: for f58r, I find 344 words, 83 of which do not have a previous word with less than 3 Levenshtein distance. The exact 25% you found corresponds to 86 words: for some reason I apparently missed 3. I attach my list of 83 distant couples, in case you or anybody else wants to look into the details.

I have made the same measure for the different "pages" in Timm and Schinner's text (the blue squares). This plot shows the overall results.

   

The TTAS generated text is lower than the cloud of Voynich data: it seems to have about half the "distant" words that appear in Voynich pages with similar word counts (about 15 vs about 30). Both distributions show a considerable variability and both sides of f78 could fall within the range produced by the algorithm.
If my results are not totally messed-up, it would seem that You are not allowed to view links. Register or Login to view. has an exceptionally high rate of distant words.