| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kxdkh (0) - 1 freq keich (3) - 8 freq kmch (3) - 1 freq katsh (3) - 1 freq yxdb (3) - 1 freq koko (3) - 1 freq ktkn (3) - 1 freq kiddy (3) - 1 freq vwdh (3) - 1 freq yxd (3) - 1 freq dh (3) - 1 freq uydh (3) - 1 freq kicks (3) - 27 freq keek (3) - 199 freq kxo (3) - 1 freq rdku (3) - 1 freq kick (3) - 120 freq kitth (3) - 1 freq xxtk (3) - 1 freq xvdh (3) - 1 freq exak (3) - 1 freq kxn (3) - 1 freq kids (3) - 87 freq kecks (3) - 5 freq kumbh (3) - 3 freq |
kxdkh (0) - 1 freq kodak (5) - 1 freq ukxkr (5) - 1 freq kdyhu (5) - 1 freq dqh (6) - 1 freq kik (6) - 1 freq hkh (6) - 1 freq kich (6) - 1 freq kxf (6) - 1 freq kudos (6) - 2 freq keks (6) - 4 freq xvk (6) - 1 freq kdu (6) - 1 freq dk (6) - 4 freq kh (6) - 5 freq ttdku (6) - 1 freq xh (6) - 6 freq idk (6) - 1 freq wwdh (6) - 1 freq kiek (6) - 1 freq kyth (6) - 3 freq lxbrh (6) - 1 freq klach (6) - 1 freq kxiw (6) - 1 freq kx (6) - 6 freq |
SoundEx code - K320 kites - 6 freq ketch - 9 freq kittiwake - 2 freq kate's - 26 freq kythes - 64 freq kiddies - 2 freq kids - 87 freq kitchie - 71 freq katja - 6 freq kitty's - 1 freq ket's - 1 freq kidz - 1 freq kits - 3 freq kïsts - 1 freq kytes - 2 freq kat's - 15 freq 'kat's - 1 freq kittag - 1 freq kuts - 1 freq katsh - 1 freq 'katze - 1 freq kyths - 5 freq kitsch - 4 freq kidds - 2 freq kudos - 2 freq kathak - 1 freq kodak - 1 freq kszydj - 1 freq katiec - 18 freq kdaz - 1 freq keithc - 1 freq kdz - 1 freq kdeyg - 1 freq kid's - 1 freq ketts - 1 freq kxdkh - 1 freq ktsc - 1 freq ktze - 1 freq kdjya - 1 freq kdiouwg - 1 freq kawwhtaxw - 1 freq |
MetaPhone code - KKSTK kxdkh - 1 freq |
KXDKH |
| Time to execute Levenshtein function - 0.187173 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.338262 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.027162 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.071779 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.000852 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. |