- Options
- Login
- Desktop Style
Options
Inside the Voynich Network: graph analysis
- Inside the Voynich Network: graph analysis
-
RE: Inside the Voynich Network: graph analysis
quimqu > 8 hours ago
(9 hours ago)Rafal Wrote: You are not allowed to view links. Register or Login to view.Are these groups something more subtle and abstract? How do they work?
The apparent contradiction comes from what level of regularity is being measured.
When I say that Voynich words form tightly bound groups I don’t mean literally repeated sentences or phrases, as you wrote. Instead, the regularity appears in the network structure of word co-occurrence (remember, in this thread I always talk about networks, links between words).
I built a graph where each node is a word (token) and its edges link words that often appear next to each other (at the 5 word window). The Voynich graph splits into small, densely connected clusters. Inside each cluster, the same few words tend to appear near each other over and over, but not necessarily in identical sequences. Between clusters, links are rare. That gives the graph high modularity, meaning strong internal cohesion but little cross-talk between groups.
So the “groups” are not obvious to the naked eye, because they’re combinatorial patterns, not repeated sentences. For example, a cluster might contain words like {chol, shol, qokedy, qokeedy, shedy}, which often occur in similar local contexts, even if never in the exact same order.
(9 hours ago)Rafal Wrote: You are not allowed to view links. Register or Login to view.Does your method allow to find and show some concrete examples of such regularity?
Yes, let me work with it and come back with examples. -
RE: Inside the Voynich Network: graph analysis
quimqu > 5 hours ago
OK, so here are the results with Rohon, Old Portuguese, Portuguese and Chinese. I added also a part of the English version of the Materia Medica of Dioscorides.
(Jorge: I think the Portugese texts are too short and that's why they look a bit as outliers (they have only about 4000 words, and I usually work between 20k and 50k) (high modularity, low H1 entropy...) Even if I normalize the KPI, if the grafs are so different in size, I think they generate these differences.)
In the following plots I removed the Voynich versions (A, B, shuffled, CUVA) and the generated text, as we have the results in my previous post. So you can compare results with natural language texts and Voynich EVA.
-
RE: Inside the Voynich Network: graph analysis
quimqu > 3 hours ago
(9 hours ago)Rafal Wrote: You are not allowed to view links. Register or Login to view.Does your method allow to find and show some concrete examples of such regularity?
Hi Rafal,
here are the highest weighted subgraphs (or frequent token sets) (jus showing the top 15 members each):
Community 0: ['chdaiin', 'chdal', 'chdam', 'qokam', 'okody', 'opar', 'okair', 'okeeol', 'olkey', 'chs', 'qokeeey', 'qokshedy', 'pchedy', 'qotchedy', 'qokair']
Community 1: ['dcheey', 'keeey', 'opaiin', 'qopchey', 'keeody', 'qoteody', 'chotaiin', 'shedaiin', 'ched', 'qopchedy', 'opchdy', 'kal', 'keey', 'otey', 'pcheol']
Community 2: ['oram', 'shod', 'olkam', 'yshey', 'aral', 'oaiin', 'okshy', 'daim', 'otair', 'araiin', 'qoeedy', 'olkaiin', 'chekaiin', 'oraiin', 'kain']
Community 3: ['okary', 'opal', 'chain', 'chkain', 'chedal', 'okees', 'otody', 'ykar', 'ytchey', 'otchedy', 'tshedy', 'ytar', 'ytor', 'odar', 'cthey']
Community 4: ['do', 'ykol', 'chockhy', 'teody', 'ctheol', 'okeol', 'aldy', 'dary', 'okeos', 'ykeody', 'dl', 'ral', 'chky', 'sh', 'sheos']
Community 5: ['chom', 'tchor', 'cphol', 'teol', 'cthody', 'oees', 'kchor', 'sheod', 'ky', 'ty', 'dan', 'shocthy', 'qoteol', 'shee', 'sy']
Community 6: ['oteeos', 'yteody', 'oain', 'sam', 'shes', 'oteody', 'oteos', 'shodaiin', 'kair', 'qokeeo', 'shar', 'shedal', 'tal', 'rol', 'cheal']
Community 7: ['cheeody', 'qokeeody', 'qokeody', 'laiin', 'okeeody', 'qody', 'shdar', 'qockhey', 'doiin', 'oldy', 'qockhy', 'pchedar', 'sheody', 'qokchey', 'ockhy']
The following are hubs with very strong neighbors:
otchol → ['chom', 'cphol', 'ctho', 'cthol', 'dchey', 'qopchy']
shodaiin → ['ctho', 'qokcho', 'qokor', 'rol', 'sam', 'yteody']
kchy → ['dchol', 'dchy', 'otchy', 'qotchol', 'ykchy', 'ytol']
chaiin → ['chan', 'kchey', 'qotchol', 'shaiin', 'ykain']
sam → ['oain', 'shes', 'shodaiin', 'yteody']
do → ['chky', 'qotor', 'sh', 'ykol']
chdaiin → ['chdal', 'ckhy', 'qokchdy', 'ykar']
cthody → ['ctho', 'oees', 'qokchol', 'teol']
araiin → ['lkaiin', 'olkaiin', 'opchedy', 'qoeedy']
chan → ['chaiin', 'char', 'cthor', 'tchor']
oteody → ['oar', 'oteos', 'ykeeody', 'ykeody']
shaiin → ['chaiin', 'cthar', 'cthy', 'soiin']
kchol → ['choky', 'ctheey', 'otchor', 'ytchy']
otody → ['okees', 'okody', 'otchdy', 'qokair']
tchey → ['shes', 'shky', 'tal', 'yty']
otchedy → ['odar', 'sheos', 'tshedy', 'ytchedy']
odar → ['cheodaiin', 'okees', 'olkaiin', 'otchedy']
ary → ['cham', 'okees', 'otair', 'sal']
There are very few triades (triangles in the graph) and no cliques (more than 3 tokens). They are strong, cohesive triads. NPMI values 1.244, 1.000, 0.976 indicate frequent, above-chance co-occurrence.
1.244 ('sam', 'shodaiin', 'yteody')
1.000 ('chom', 'cthol', 'otchol')
0.976 ('ldy', 'qopchdy', 'shear') -
RE: Inside the Voynich Network: graph analysis
Jorge_Stolfi > 1 hour ago
(8 hours ago)quimqu Wrote: You are not allowed to view links. Register or Login to view.Hello Jorge, I work with words separated with a dot.
That's okay; the encoding does not use dot as a letter.
You are sure that the other special characters [µß^~+`'°] are not deleted, remapped, or interpreted as separators at some point?
Note that chaos happens if a program reads a iso-latin-1 file (like my samples) with those non-ascii characters, expecting it to be Unicode in utf-8 (which is practically the norm nowadays)...
All the best, --stolfi -
RE: Inside the Voynich Network: graph analysis
Jorge_Stolfi > 1 hour ago
(5 hours ago)quimqu Wrote: You are not allowed to view links. Register or Login to view.Jorge: I think the Portugese texts are too short and that's why they look a bit as outliers
OK, I can provide longer samples.
The three previous samples were from the same novel in three languages/encodings, but taking alternating chapters, so that there was no overlap between the three samples. Shall I do the same, but with longer samples? Or should I just send you the three versions of the whole novel?
All the best, --srolfi