I have analyzed the similarity relations between words of the VMS. For doing so it is possible to represent each word as a node in a graph. Starting with the most frequent token one can recursively search for other words differing by just a single glyph, and connect these new nodes with an edge.
On Github it is possible to find the resulting network graphs for individual You are not allowed to view links. Register or Login to view., You are not allowed to view links. Register or Login to view., You are not allowed to view links. Register or Login to view..
The main network is connecting 6796 out of 8026 word types (=84.67 %). The longest path within this network has a length of 21 steps, substantiating its surprisingly high connectivity. Another feature is that high-frequency tokens also tend to have high numbers of similar words, whereas isolated words (i.e. unconnected nodes in the graph) usually appear just once in the entire VMS (see You are not allowed to view links. Register or Login to view.).
Consequently high-frequency tokens share their glyph order with many other frequently used tokens. For instance the most frequently used word in the VMS is "daiin". Therefore the glyph next to "d" is in 31.4% of the cases "a" (and in 52.8% "y"). However in Currier A "d" is followed in 48.3% of the cases by "a" and only in 25.4% by "y" whereas in Currier B "d" is followed in 64.4 % of the cases by "y" and only in 23.9% by "a". This happens since "chedy" is the most frequently used word in Currier B and an exception in Currier A. Consequently words similar to "chedy" especially words ending in "edy" occur far more frequently in Currier B than in Currier A.
On Github it is possible to find the resulting network graphs for individual You are not allowed to view links. Register or Login to view., You are not allowed to view links. Register or Login to view., You are not allowed to view links. Register or Login to view..
The main network is connecting 6796 out of 8026 word types (=84.67 %). The longest path within this network has a length of 21 steps, substantiating its surprisingly high connectivity. Another feature is that high-frequency tokens also tend to have high numbers of similar words, whereas isolated words (i.e. unconnected nodes in the graph) usually appear just once in the entire VMS (see You are not allowed to view links. Register or Login to view.).
Consequently high-frequency tokens share their glyph order with many other frequently used tokens. For instance the most frequently used word in the VMS is "daiin". Therefore the glyph next to "d" is in 31.4% of the cases "a" (and in 52.8% "y"). However in Currier A "d" is followed in 48.3% of the cases by "a" and only in 25.4% by "y" whereas in Currier B "d" is followed in 64.4 % of the cases by "y" and only in 23.9% by "a". This happens since "chedy" is the most frequently used word in Currier B and an exception in Currier A. Consequently words similar to "chedy" especially words ending in "edy" occur far more frequently in Currier B than in Currier A.
![[+]](https://www.voynich.ninja/images/collapse_collapsed.png)