Inside the Voynich Network: graph analysis

[nablator]

This first part of the analysis is based on directed word-to-word graphs, where each edge connects a token A → B if word B follows A in the text. This approach keeps the natural direction of information flow, unlike undirected co-occurrence graphs that only record proximity.

What are your exact criteria of co-occurrence? Is there a distance limit?

With bifolia possibly reordered (wrong page order) and non-sequential components (paragraphs, circular texts, radial texts, labels, etc.) the VMS cannot be processed like other texts.