RE: Why and how the text could be Bavarian
JoJo_Jost > Yesterday, 04:45 PM
I don't need to manipulate the alphabet. I have a specific list showing which VMS clusters correspond to what in plain text and which VMS clusters are used multiple times—for example, for a glyph: nd = ked, keed, ched (just as an example).
There will probably be three lists: one with the families, one that’s more of a substitution cipher, and a list of suffixes (aiin = "en" air= "ir" etc.)
There will likely be roughly 80 entries on these lists. Arranged alphabetically, this isn’t rocket science—it’s easy to write and to decipher.
Second question
As I mentioned earlier, these examples aren’t about actual translation. The point is to show that, under certain conditions, the VBM theory is capable of converting standard VMS text into German sentences—in this case, five lines in a row into grammatically correct German sentences. To do this, the vowels and consonant clusters are assigned plain text, and the repetitions of these must also be correct.
If this can be achieved over five lines and grammatically correct sentences result, it means that the VBM fundamentally has the right structure to, in theory, translate these strange VMS tokens into plain language. It proves nothing more than that. But this proof is important for moving forward at all.
If these assignments for the clusters and vowels were already the correct cipher, the assignments for the vowels and consonant clusters would have to apply to the entire text, so that the entire VMS text could be translated. However, that is NOT the case. Although German sentence fragments are produced, there is no continuous translation.
To achieve this consistency, we must now figure out how these clusters are actually assigned and how the structures work.
With a homophonic cipher, however, this is very difficult and time-consuming.