Re:Sukhotin's Algorithm
by lookACamel on Thursday July 08, 2010 @01:50AM
(#1496603)
What if the words in your language looked like 'thcobjk'?
Presumably it would work so long as vowels appear more frequently than consonants and typically are seen next to consonants. If you want to try a made up language, just create one and feed it into the program.
Basically, all it's doing is tracking the letter with maximum frequency and subtracting 2x its occurrences next to every other letter. If there's a letter that's still positive in frequency, it keeps going, otherwise it assumes all the vowels have been found. Clever!