Deconstructing the VMS : A positionless ledger (part 1)

[Dunsel]

Maybe it's possible word forms up to a certain length?

I don't know.

My preference would be to simplify the ledger enough to prevent infinite strings, by removing the rarest transitions. For example d after n does occur but a more parsimonious explanation is that a space is missing. These compound words would fail the check but I see that as an improvement, because spaces cannot be trusted (especially in transliterations) and as long as the subdivision does not create any new hapax: not sure if that's possible. Anyway, the "no hapax" rule is probably not really needed if the rarest transitions are eliminated, it will take care of possible scribal errors and misreadings.

Words formed until the scribe wanted them to stop.  If the Voynich is copy and mutate the ledger wasn't used to create words. It was used to keep the scribes on track with valid transitions when they did modify a word.  If you copy a word, you don't need a ledger, just copy it.

And yes, a missing space is entirely possible and, very likely probable.  However, those would be subject to interpretation.  The ledger can accommodate ANY language and ANY transcription.  If you think one transcription has bad spaces, try another.  But those spaces are subjective. If I did not include d after n then someone would complain that the ledger is incomplete because I didn't include them.  That's why I've split them into common and rare.  

But you're free to use this information however you wish. Please, experiment. Find new things.