Sukhotin's algorithm
From HandWiki
Revision as of 01:18, 27 October 2021 by imported>NBrushPhys (change)
Sukhotin's algorithm (introduced by Boris V. Sukhotin) is a statistical classification algorithm for classifying characters in a text as vowels or consonants. It may also be of use in some of substitution ciphers and has been considered in deciphering the Voynich manuscript, though one problem is to agree on the set of symbols the manuscript is written in.
See also
External links
- An excerpt from CRYPTOLOGY July 1991 Volume XV Number 3
- "OPTIMIZATION ALGORITHMS OF DECIPHERING AS THE ELEMENTS OF A LINGUISTIC THEORY - B.V. Sukhotin
 |
