A family of grammars for Voynichese

[Mauro]

Welcome to the forum!

I am not sure what you are comparing and how. Massimiliano Zattera claims an F1 score of 0.27 for his "Simply the Best" grammar "SLOT MACHINE", described by a state machine: You are not allowed to view links. Register or Login to view.

The state machine restricts considerably the possibilities that "SLOT" (slot model, F1 = 0.001) offers. You are not allowed to view links. Register or Login to view.

I guess your "grammars" are defined by a slot sequence only, without a state machine, like MZ's "SLOT".

Thank you for your remarks. I used the the grammar which Zattera published in reference [2] of my presentation: M. Zattera, A new transliteration alphabet brings new evidence of word structurs and multiple "languages" in the Voynich manuscript, 2022. You are not allowed to view links. Register or Login to view.. The values Zattera gives (in Table 2 of his paper) are different from the ones in my presentation, but this is because he used a different transcription, so I re-calculated the results of his grammar with the same transcription I used to get comparable results (I tried to explain this in my presentation, probably not that clearly). I guess this is the grammar you call MZ's "SLOT" (without MACHINE attached).

I was not aware of Zattera's "Simply the best" "SLOT MACHINE" grammar that you brought to my attention. At the moment I don't have the time to check your links, so I don't know what to say. Tomorrow I will look at them and see what I can say.

And yes, my grammar is stateless.