Finding patterns in Voynich words via a Hidden Markov Model

[Mauro]

Very interesting, and I like how you consider the sequence of the words in your Markov model.

I need some clarifications  .

Each label lists the state’s top pieces: P = top prefix fragments, T = top stem fragments, F = top final/suffix fragments.

By 'top', do you mean 'most frequent'?

I'm not sure how to read the state graph. Ie., if I start at S3, which strings does it actually contain? All the six strings [o che she d o daiin] ('o' being duplicated because it's been classified both as a prefix and a stem)?

How can the outputs of S3 add up to 1.06? They should be < 1.