Jump to content

Sukhotin's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Autarch (talk | contribs) at 19:46, 19 August 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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 as in deciphering the Voynich manuscript, though one problem is to agree on the set of symbols the manuscript is written in.

See Also