3 ms·
Very cool algorithm. I just implemented and tested it for fun: http://www.nashcoding.com/?p=51 http://www.nashcoding.com/?p=51 Basically, all it's doing is tra
by tansey 16y ago
Very cool algorithm. I just implemented and tested it for fun:
http://www.nashcoding.com/?p=51 http://www.nashcoding.com/?p=51
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!
- lookACamel 16y agoWhat if the words in your language looked like 'thcobjk'?
- tansey 16y agoPresumably 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.