A family of grammars for Voynichese

[Mauro]

This sounds interesting! Checking "the first missed word" is a nice addition too.

About the two "loop" grammars, I would be curious to know how they perform when limited to 1, 2 or 3 iterations. That makes the possible output finite, so they can be compared with the other grammars.

Yes, I had thought about this. Another possibility could be to classify each word according to the number of iterations needed.

I forgot to mention that the idea of having at most three syllables is based on Emma May Smith's word structure 

You are not allowed to view links. Register or Login to view.

Thanks for the link (which I didn't know, I need to add it to my References section). Yes, it seems Emma May Smith was on the same track as me (and a few years before!). Unfortunately she did not post a full grammar (there is a table for the 'syllables bodies', but it's not clear what she used for 'onsets' and 'codas'), else I could easily test her grammar (also for efficiency, which she did not speak of) by replicating it into my software. But the basic idea (discarding variations in the actual grammar), is the same.

By the way, my EXTENDED-12 grammars breaks down words similarly to Emma's May Smith: many have one "syllable", a good quantity have two, a few have three. I have not counted the words according to the number of syllables (there is also a thorny problem: many words have multiple decompositions), nor I have tested with more than 4 syllables, but I think I can wholly confirm her results. Also by the way, the word which requires more syllables is 'ooooooooolarsr', with a whopping 12 syllables (counted using my EXTENDED-12), which are a lot (the required grammar is on the order of 10EXP44 total strings..., while an EXTENDED-12 with one more syllable (4 in total) would be around 33*10EXP12).

Just for reference, I also tested a 'two-syllables' version of Zattera's SLOT (which, here referring to a previous post of @nablator, would be able to find also the "separable" words). I actually optimized it a bit for efficiency (removing the final 'y' at the end of the first syllable, it's almot useless as coverage goes). This are the results (directly pasted form my software):

-----------
Grammar name: Zattera's SLOT duplicated, 23 slots   (may I call it Zattera-Lanzini SLOT*2 ? in exchange I could call my grammar the EmmaSmith-Lanzini )

Slot 1: q s d
Slot 2: o y
Slot 3: l r
Slot 4: t k p f
Slot 5: ch sh
Slot 6: cth ckh cph cfh
Slot 7: e ee eee
Slot 8: s d
Slot 9: o a
Slot 10: i ii iii
Slot 11: d l r m n
Slot 12: q s d
Slot 13: o y
Slot 14: l r
Slot 15: t k p f
Slot 16: ch sh
Slot 17: cth ckh cph cfh
Slot 18: e ee eee
Slot 19: s d
Slot 20: o a
Slot 21: i ii iii
Slot 22: d l r m n
Slot 23: y

Found 7228 valid words. Grammar can generate 1,088391E+13 total words
Total number of words in the Voynich text: 8078 (7700 excluding words with rare characters)
Coverage = 0,8947759, Efficiency = 6,640995E-10, F1 score = 1,328199E-09
Coverage is 0,9387013 excluding words with rare characters
---------

Coverage is excellent, even slightly better than my EXTENDED-12 (which scores 88.45%-92.79%), but the size of the grammar is greatly increased (SLOT-almost-duplicated: 1.08*10EXP13, EXTENDED-12: 6.12*10EXP9), and the F1 score greatly decreased (SLOT-almost-duplicted: 1.33*10EXP-9, EXTENDED-12: 2.33*10EXP-6). These are the words which appear at least twice in the text which cannot be generated (excellent result, I'd say at about the same level of EXTENDED-12, which misses 4 words instead of 6, but two of them have three occurences):

chotols 3 NOTFOUND
choekeey 2 NOTFOUND
otaraldy 2 NOTFOUND
polarar 2 NOTFOUND
chkoldy 2 NOTFOUND
sheoeky 2 NOTFOUND