| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keithc (0) - 1 freq keith (1) - 21 freq meith (2) - 3 freq eithe (2) - 1 freq kithy (2) - 2 freq leith' (2) - 1 freq deith (2) - 103 freq keit (2) - 1 freq beith (2) - 5 freq keich (2) - 8 freq kith (2) - 13 freq meiths (2) - 3 freq deiths (2) - 7 freq teith (2) - 5 freq leith (2) - 200 freq eith (2) - 26 freq deith' (2) - 1 freq paiths (3) - 1 freq aneith (3) - 8 freq nith (3) - 12 freq aiths (3) - 3 freq deaths (3) - 8 freq either (3) - 458 freq switha (3) - 1 freq skeptic (3) - 1 freq |
keithc (0) - 1 freq keith (2) - 21 freq kith (3) - 13 freq kithy (3) - 2 freq ktsc (4) - 1 freq keethin (4) - 1 freq thc (4) - 3 freq kyth (4) - 3 freq kath (4) - 3 freq kathy (4) - 4 freq kythe (4) - 65 freq lithca (4) - 1 freq ethic (4) - 1 freq kytht (4) - 3 freq kyths (4) - 6 freq kithan (4) - 1 freq deith' (4) - 1 freq keit (4) - 1 freq beith (4) - 5 freq deith (4) - 103 freq leith' (4) - 1 freq meith (4) - 3 freq eithe (4) - 1 freq keich (4) - 8 freq meiths (4) - 3 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 - K0K quiethke - 1 freq gothic - 5 freq kathak - 1 freq keithc - 1 freq |
KEITHC |
| Time to execute Levenshtein function - 0.344057 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.614469 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.057533 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.039474 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.000974 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. |