(08-12-2024, 06:42 PM)Mauro wrote: You are not allowed to view links. Register or Login to view.I propose as a ‘figure of merit’ for a slot grammar the total number of unique chunks in the chunkified grammar (Nchunktypes). That is to say: the total number of unique chunks in the second table above. The lower the number, the ‘better’ the grammar. This applies to any grammar, with a loop or without (that would be a grammar where the ‘loop’ repeats only 1 time).
I have some difficulties following your argument, so I hope you won't mind a few dumb questions on my part. How do you define "unique chunks" here? Is it unique per slot or unique in all the slots?
From the way I understand it, the trivial grammar that just lists 25 most common Voynichese characters in 10 slots would have either 25 NChunktypes or 250 NChunktypes with almost 100% coverage. Is this correct?