| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yokin (0) - 24 freq lokin (1) - 1 freq ookin (1) - 1 freq yokkin (1) - 8 freq yokin' (1) - 1 freq yokit (1) - 72 freq pokin (1) - 18 freq tokin (1) - 4 freq yokhin (1) - 1 freq hokin (1) - 11 freq bokin (1) - 5 freq jokin (1) - 46 freq yoking (1) - 2 freq yoke (2) - 30 freq tokie (2) - 1 freq gowkin (2) - 2 freq doukin (2) - 3 freq eoin (2) - 9 freq yoit (2) - 1 freq gopin (2) - 1 freq yowkit (2) - 2 freq howkin (2) - 58 freq poking (2) - 5 freq mopin (2) - 1 freq akin (2) - 11 freq |
yokin (0) - 24 freq ookin (1) - 1 freq eikin (2) - 29 freq yaukin (2) - 1 freq lokin (2) - 1 freq aakin (2) - 3 freq eekin (2) - 1 freq yken (2) - 1 freq aekin (2) - 1 freq yeken (2) - 1 freq yeukin (2) - 1 freq ykn (2) - 1 freq kin (2) - 1351 freq yoking (2) - 2 freq pokin (2) - 18 freq yokit (2) - 72 freq yokin' (2) - 1 freq yokkin (2) - 8 freq tokin (2) - 4 freq yokhin (2) - 1 freq jokin (2) - 46 freq bokin (2) - 5 freq hokin (2) - 11 freq akin (2) - 11 freq opin (3) - 9 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 |
YOKIN |
| Time to execute Levenshtein function - 0.182646 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.337033 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.027413 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.040121 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.000809 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. |