A One-Page Ledger Method for Generating Voynich-Like Text

[Jorge_Stolfi]

The lines represent ED1 relationships. Two nodes are connected if one form can be transformed into the other by a single insertion, deletion, or substitution.  The actual physical lengths of the lines are not meaningful by themselves. The graph layout uses a spring-force algorithm that tries to pull highly connected regions together while pushing weakly connected regions apart.

Thanks!  Yes, I am familiar with that spring-force method for automatic graph drawing.

I wonder if one could use the width of the lines to convey some useful information? 

Like, let A and B be two words at edit distance 1, so that they would be connected by a line in that graph.  Let Fr(x,y) denote the estimated frequency of the biword x.y (occurrences of word type x immediately followed by word type y)in the text in question.  We could compute a "semantic similarity" S(A,B) of the two words by comparing the distributions Fr(A,y) with Fr(b,y), of of Fr(x,A) with Fr(x,B), or both. Then one could draw that graph with line width proportional to S(A,B).

For more meaningful results, you should consider only one section at a time, and only those sections with substantial text: Herbal A and B, Bio, and Starred Parags.  And exclude the pages with undefined topic, like f1r, f66r, f85r1, f86v5, f86v6, f86v3, etc., plus the bottom of You are not allowed to view links. Register or Login to view. (the star-less parags).  And beware of quantization and sampling noise when comparing the two distributions.

All the best, --stolfi