Inside the Voynich Network: graph analysis

[quimqu]

It would be good to try to join the declined words (or plurals). I must think how to do it

I believe you won't do it in an easy way.

There may be several patterns of declension in a language and a lot of exceptions so writing some general rules rather wouldn't work. You would basically need for each language a database of words linking forms of the same word.

I don't know if such things exist.

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).