- Options
- Login
- Desktop Style
Options
Why and how the text could be Bavarian
- Why and how the text could be Bavarian
-
RE: Why and how the text could be Bavarian
Grove > Yesterday, 02:55 PM
<f75r.P.13;V> pchedy.keedy.qokedy-
{figure}qokedy.qokedy.qokedy
Pchedy keed… end end end end? -
RE: Why and how the text could be Bavarian
Grove > Yesterday, 03:33 PM
Ha! Forgot I read that before. I was thinking in English of course and thought four consecutive ends would have been interesting. -
RE: Why and how the text could be Bavarian
JoJo_Jost > 4 hours ago
Continued from: You are not allowed to view links. Register or Login to view.
The big problem is figuring out the exact coding of the matrix. Since we don’t know the writing conventions, more complex frequency analysis of such a cipher is impossible.
Here’s an example. Let’s stick with “nd” and “nde.”
Let’s examine the various German texts I’m using as a basis for their occurrences:
Here you can see the full extent of the problem: Calculated per word: Breslauer 7.65 percent, Ortloff 0.26 percent. And this is mainly due to a difference in the spelling of the word “and” as “unde” in Breslauer and as “vnd” and “vnnd” in Ortloff.
Added to this are spelling conventions: The “cooking recipes” contain an extremely high number of “und,” while the Bavarian text has relatively few. But the lack of consistent spelling rules—b/p, t/d, a/o, etc.—also makes it nearly impossible to analyze the text based on frequency if you don’t know which spelling convention it follows.
And the final problem is this: The other families will also encode clusters, and as long as we don’t know exactly which ones, it’s impossible anyway.
That’s why I’m still not sure if it can be solved at all. The most likely approach is probably via the “Crips”—that is, the peculiarities of word repetitions in the VMS—but even that is extremely time-consuming. I don’t know if I can manage it..