I think you did an interesting work and you deserve some compliments, but I fear there are some problems.
You followed Torsten Timm's copy-and-modify algorithm, but with a twist. Torsten enforces the generation of Voynich-like words by having a (complex) set of modification rules. Instead your modification algorithm is simple (I did not check it, but I'm sure it is) and you enforce the Voynich-likeness of the words by adding the ledger sieve at the end. So, the basic idea is Timm's, and you are proposing an alternative approach in its implementation. Which is surely a good idea: a drawback of Timm's implementation is that his modification rules are many and complex, and with enough rules (enough parameters) one can approximate any text to any arbitrary degree of precision. And in my opinion, Timm's implementation uses too many rules to achieve too rough an approximation of the VMS word structure, so it's not a smoking gun for the copy-and-modify theory.
Your approach is surely interesting, but ultimately it runs into the same problem. You can use very complex 'ledger tables' (many parameters) or, as intelligently you choose to do, you can use simpler tables (less parameters), but by doing so you generate distinctly un-Voynich like words, ie. in your sample there are three 'ddocta' in the six rows of text starting at <f3v.P1.2;K>. The sieve has too large a mesh (this is the 'fankao' problem I noticed in a previous post), and to narrow the mesh you would need to add more parameters (many, many more).
But in any case, a nice work. I hope you will go on searching for clues to unravel the VMS!
You followed Torsten Timm's copy-and-modify algorithm, but with a twist. Torsten enforces the generation of Voynich-like words by having a (complex) set of modification rules. Instead your modification algorithm is simple (I did not check it, but I'm sure it is) and you enforce the Voynich-likeness of the words by adding the ledger sieve at the end. So, the basic idea is Timm's, and you are proposing an alternative approach in its implementation. Which is surely a good idea: a drawback of Timm's implementation is that his modification rules are many and complex, and with enough rules (enough parameters) one can approximate any text to any arbitrary degree of precision. And in my opinion, Timm's implementation uses too many rules to achieve too rough an approximation of the VMS word structure, so it's not a smoking gun for the copy-and-modify theory.
Your approach is surely interesting, but ultimately it runs into the same problem. You can use very complex 'ledger tables' (many parameters) or, as intelligently you choose to do, you can use simpler tables (less parameters), but by doing so you generate distinctly un-Voynich like words, ie. in your sample there are three 'ddocta' in the six rows of text starting at <f3v.P1.2;K>. The sieve has too large a mesh (this is the 'fankao' problem I noticed in a previous post), and to narrow the mesh you would need to add more parameters (many, many more).
But in any case, a nice work. I hope you will go on searching for clues to unravel the VMS!
![[+]](https://www.voynich.ninja/images/collapse_collapsed.png)