ReneZ > 22-03-2018, 08:33 PM
Anton > 22-03-2018, 09:00 PM
doranchak > 23-03-2018, 03:01 AM
DonaldFisk > 23-03-2018, 05:33 PM
(22-03-2018, 08:33 PM)ReneZ Wrote: You are not allowed to view links. Register or Login to view.Most people will be familiar with the algorithm of Boris V. Sukhotin that identifies which characters in a text are more likely to be vowels and which are more likely to be consonants.
The Russian text was translated into English by Jacques Guy and published in Cryptologia.
There is also a copy of this article You are not allowed to view links. Register or Login to view. .
Sukhotin has designed several more articles and these were also translated by Jacques Guy. He posted them to the old mailing list in 1997.
I have converted these to HTML and You are not allowed to view links. Register or Login to view. .
They seem quite interesting, and I am not aware of anyone having tried them out on the Voynich MS text.
-JKP- > 23-03-2018, 06:03 PM
(23-03-2018, 05:33 PM)DonaldFisk Wrote: You are not allowed to view links. Register or Login to view.(22-03-2018, 08:33 PM)ReneZ Wrote: You are not allowed to view links. Register or Login to view.Most people will be familiar with the algorithm of Boris V. Sukhotin that identifies which characters in a text are more likely to be vowels and which are more likely to be consonants.
The Russian text was translated into English by Jacques Guy and published in Cryptologia.
There is also a copy of this article You are not allowed to view links. Register or Login to view. .
Sukhotin has designed several more articles and these were also translated by Jacques Guy. He posted them to the old mailing list in 1997.
I have converted these to HTML and You are not allowed to view links. Register or Login to view. .
They seem quite interesting, and I am not aware of anyone having tried them out on the Voynich MS text.
Thanks for bringing this to my attention. Sukhotin's algorithm is new to me, and should be easy to implement. I'm surprised it hasn't been done already.
...
DonaldFisk > 23-03-2018, 06:54 PM
(23-03-2018, 06:03 PM)-JKP- Wrote: You are not allowed to view links. Register or Login to view.(23-03-2018, 05:33 PM)DonaldFisk Wrote: You are not allowed to view links. Register or Login to view.(22-03-2018, 08:33 PM)ReneZ Wrote: You are not allowed to view links. Register or Login to view.Most people will be familiar with the algorithm of Boris V. Sukhotin that identifies which characters in a text are more likely to be vowels and which are more likely to be consonants.
The Russian text was translated into English by Jacques Guy and published in Cryptologia.
There is also a copy of this article You are not allowed to view links. Register or Login to view. .
Sukhotin has designed several more articles and these were also translated by Jacques Guy. He posted them to the old mailing list in 1997.
I have converted these to HTML and You are not allowed to view links. Register or Login to view. .
They seem quite interesting, and I am not aware of anyone having tried them out on the Voynich MS text.
Thanks for bringing this to my attention. Sukhotin's algorithm is new to me, and should be easy to implement. I'm surprised it hasn't been done already.
...
It has been done already. I have linked to some of the Cryptologia articles in which the Sukhotin algorithm has been applied to the Voynich text here (along with some commentary):
You are not allowed to view links. Register or Login to view.
ReneZ > 24-03-2018, 09:48 AM
-JKP- > 24-03-2018, 11:07 AM
MarcoP > 26-03-2018, 12:02 PM
Quote:there is no one—letter string which does not have a non—empty intersection with another string
Anton > 26-03-2018, 03:29 PM