Discussion of "A possible generating algorithm of the Voynich manuscript"

[Torsten]

Torsten: EVA is a stroke-based transcription alphabet, nothing more. It was designed to help communication between researchers who are exploring different groupings of strokes into tokens, e.g. for the kind of edge cases you cite. It was never designed to be interpreted as a decryptive or a linguistic alphabet. Please stay on topic.

This is exactly the point. EVA is a stroke-based transcription alphabet and therefore it is necessary to parse the strokes into tokens. Remains the question how to parse EVA into tokens. 

Following Currier, the glyphs used to write the VMS are mostly based on a curve or on a line as first quill stroke: "We have the fact that you can make up almost any of the other letters out of these two symbols <i> and <e>." (You are not allowed to view links. Register or Login to view.). Moreover, for each common word there is at least another one differing from it by only a single quill stroke. For example, in addition to the word <daiin> also the words <dain> and <daiiin> are present in the text (Timm & Schinner 2019, p. 3).

One criteria for parsing EVA into tokens are repeated <i> and <e> strokes. For instance Currier describes a series with <in>, <iin>, <iiin>, <il>, <iil> etc. Another criteria are connected strokes. Currier describes <ch>, <sh>, <cth>, <ckh>, <cph>, <cfh>. But also stroke sequences like <qo>, <ikh>, <cck> or <ckhhh> belong into this category. A third criteria are groups that are used in the same way as <in>, <iin>, <iiin> and also represent a cycle. One example for such a cycle are the tokens <ol>, <or>, <al>, and <ar>.

This means the parsing of tokens is based on observations and it is possible to describe objective criteria for them. Therefore it should't be a surprise that we both parse <qokeedy> into [qo][k][ee][dy] (see You are not allowed to view links. Register or Login to view.).