16-09-2024, 01:15 AM
Switched to Italian plaintext and changed the letter values, reversing the letter_sum to letter values now gives a lot less possibilities.
And creating a codebook makes it much easier and shows the multiple word possibililtes per letter_sum
ranging from 1 to 16 words with an average of 6 and a mode of 2.
Again with better chosen letter values this could be improved the same with pseudo-repetition,
there are a few like this, but yes as MarcoP observed, not enough and not quite in the same manner as voynichese.
e.g "oteeedy kool oteein ool oteol qoorin keetol otiin"
This Roman numeral method works and its mostly reversible,
but the voynichese is a quite a bit off, also this method does not really explain glyph letter positions within a word,
Perhaps with the addition of a newline char so '\nD' encodes to seperate eva-char(s), you could then have \nD, _D, D, D_, D\n
but there are currently 22 rules and already 'daiin' will never occur alone which is wrong.
Sculpting those rules and adding others will take some time to do a lot of that comes down to finding out the best glyph sequences.
idk if i can even do it with a genetic alogrithm (GA) or Hill climbing algorithm (HC).
Overall, this would be an extremely laborious method, you need to calculate the letter sum of every distinct word in the plaintext
then apply the set of substitution rules to each word in a line as you write it, because of the included spaces.
A full decode of the start of Orlando furioso goes like this.
And creating a codebook makes it much easier and shows the multiple word possibililtes per letter_sum
ranging from 1 to 16 words with an average of 6 and a mode of 2.
Again with better chosen letter values this could be improved the same with pseudo-repetition,
there are a few like this, but yes as MarcoP observed, not enough and not quite in the same manner as voynichese.
e.g "oteeedy kool oteein ool oteol qoorin keetol otiin"
This Roman numeral method works and its mostly reversible,
but the voynichese is a quite a bit off, also this method does not really explain glyph letter positions within a word,
Perhaps with the addition of a newline char so '\nD' encodes to seperate eva-char(s), you could then have \nD, _D, D, D_, D\n
but there are currently 22 rules and already 'daiin' will never occur alone which is wrong.
Sculpting those rules and adding others will take some time to do a lot of that comes down to finding out the best glyph sequences.
idk if i can even do it with a genetic alogrithm (GA) or Hill climbing algorithm (HC).
Overall, this would be an extremely laborious method, you need to calculate the letter sum of every distinct word in the plaintext
then apply the set of substitution rules to each word in a line as you write it, because of the included spaces.
A full decode of the start of Orlando furioso goes like this.