| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kxdkh (0) - 1 freq doh (3) - 31 freq kko (3) - 3 freq kd (3) - 2 freq sikh (3) - 8 freq kirky (3) - 12 freq kid's (3) - 1 freq keach (3) - 2 freq dh (3) - 1 freq xgkz (3) - 1 freq kdy (3) - 1 freq kirk' (3) - 1 freq judah (3) - 13 freq keich (3) - 8 freq gxh (3) - 1 freq keik (3) - 13 freq xk (3) - 1 freq xwkf (3) - 1 freq kirk (3) - 532 freq kbdfj (3) - 1 freq yxdb (3) - 1 freq kh (3) - 5 freq cedk (3) - 1 freq kxiac (3) - 1 freq kinks (3) - 12 freq |
kxdkh (0) - 1 freq ukxkr (5) - 1 freq kdyhu (5) - 1 freq kodak (5) - 1 freq kke (6) - 1 freq kitth (6) - 1 freq kydd (6) - 1 freq kecks (6) - 5 freq xxtk (6) - 1 freq xh (6) - 6 freq kirko (6) - 2 freq dk (6) - 4 freq sadko (6) - 1 freq hxdav (6) - 1 freq kich (6) - 1 freq kowk (6) - 1 freq kid' (6) - 2 freq kidds (6) - 2 freq keks (6) - 4 freq ahdh (6) - 1 freq kchkr (6) - 1 freq ixd (6) - 1 freq kach (6) - 1 freq klach (6) - 1 freq kolkw (6) - 1 freq |
SoundEx code - K320 kites - 6 freq ketch - 9 freq kittiwake - 3 freq kate's - 26 freq kythes - 64 freq kiddies - 2 freq kids - 87 freq kitchie - 71 freq katja - 6 freq kitty's - 1 freq kyths - 6 freq kits - 4 freq ket's - 1 freq kidz - 1 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 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.213566 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.390727 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.030075 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.041759 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.000860 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. |