| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yeukin (0) - 1 freq lyeukin (1) - 6 freq yeukie (1) - 6 freq beukin (1) - 1 freq yerkin (1) - 4 freq reukin (1) - 1 freq yaukin (1) - 1 freq yeusin (1) - 1 freq leukin (1) - 256 freq feukit (2) - 1 freq bekkin (2) - 1 freq eskin (2) - 2 freq leuikin (2) - 1 freq keekin (2) - 126 freq fekkin (2) - 1 freq lyeukit (2) - 10 freq werkin (2) - 2 freq reekin (2) - 45 freq beukie (2) - 7 freq yankin (2) - 4 freq -ukin (2) - 1 freq geckin (2) - 3 freq maukin (2) - 35 freq leukan (2) - 3 freq aekin (2) - 1 freq |
yeukin (0) - 1 freq yaukin (1) - 1 freq eikin (2) - 29 freq yokin (2) - 24 freq eekin (2) - 1 freq yeken (2) - 1 freq aekin (2) - 1 freq leukin (2) - 256 freq yeukie (2) - 6 freq lyeukin (2) - 6 freq beukin (2) - 1 freq yerkin (2) - 4 freq reukin (2) - 1 freq yeusin (2) - 1 freq lukin (3) - 52 freq yeuk (3) - 6 freq peekin (3) - 3 freq kin (3) - 1351 freq keikin (3) - 10 freq seekin (3) - 100 freq yalkin (3) - 2 freq aakin (3) - 3 freq beakin (3) - 1 freq bukin (3) - 1 freq yulin (3) - 1 freq |
SoundEx code - Y250 yaisin - 98 freq yaukin - 1 freq yakcam - 35 freq 'yakcam' - 2 freq ye-keen - 1 freq yasin - 15 freq yaizin - 1 freq yokin - 24 freq yokkin - 8 freq yoosin - 1 freq yazin - 3 freq yeuchan - 1 freq yican - 1 freq y'know - 5 freq yowchin - 1 freq yokin' - 1 freq y'ken - 2 freq yusan - 2 freq yeukin - 1 freq yaissin - 1 freq yakkin - 2 freq you-ken-who - 1 freq you-ken - 1 freq yokohama - 1 freq yeuchin - 1 freq yeken - 1 freq yeusin - 1 freq yeusan - 1 freq yokhin - 1 freq ycn - 1 freq yikm - 1 freq yaesin - 2 freq yhazony - 1 freq ykn - 1 freq yken - 1 freq |
MetaPhone code - YKN yaukin - 1 freq ye-keen - 1 freq yokin - 24 freq yokkin - 8 freq yican - 1 freq yokin' - 1 freq yeukin - 1 freq yakkin - 2 freq you-ken - 1 freq yeken - 1 freq |
YEUKIN |
| Time to execute Levenshtein function - 0.492461 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.610016 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027454 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.070171 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000775 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |