Jump to content

Sukhotin's algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 71.167.0.28 (talk) at 23:11, 30 August 2009 (→External links). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Sukhotins' Algorithm 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

An excerpt from CRYPTOLOGY July 1991 Volume XV Number 3
"OPTIMIZATION ALGORITHMS OF DECIPHERING AS THE ELEMENTS OF A LINGUISTIC THEORY" - B.V. Sukhotin

Retrieved from "https://en.wikipedia.org/w/index.php?title=Sukhotin%27s_algorithm&oldid=310974043"