Inside the Voynich Network: graph analysis

[Mauro]

I was thinking of calculating the word similarity and given a high threshold, join words. If I give a threshold of one or two character change, I could reduce the graph dimension and the number of different tokens. But this needs to be tested and proofed... I really don't know if this can be so easy... (Guess not).

It's probably not useful. Ie. in Italian 'casa' and 'case' are related ('house' and 'houses'), but caso ('case') is not. I doubt it can be done without knowing the language.