| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| named (0) - 53 freq damed (1) - 1 freq gamed (1) - 1 freq name' (1) - 3 freq naemed (1) - 1 freq naked (1) - 22 freq famed (1) - 9 freq ramed (1) - 2 freq name (1) - 1220 freq nimed (1) - 1 freq names (1) - 304 freq namer (1) - 1 freq tamed (1) - 15 freq kamed (1) - 1 freq hames (2) - 51 freq rated (2) - 3 freq med (2) - 184 freq nare (2) - 1 freq nashed (2) - 4 freq neded (2) - 3 freq sayed (2) - 1135 freq amen (2) - 24 freq wames (2) - 6 freq hated (2) - 52 freq saved (2) - 87 freq |
named (0) - 53 freq naemed (1) - 1 freq nimed (1) - 1 freq namer (2) - 1 freq names (2) - 304 freq tamed (2) - 15 freq nemd (2) - 1 freq name (2) - 1220 freq kamed (2) - 1 freq damed (2) - 1 freq gamed (2) - 1 freq ramed (2) - 2 freq name' (2) - 3 freq naked (2) - 22 freq famed (2) - 9 freq unnamed (3) - 4 freq timed (3) - 4 freq namin (3) - 7 freq maed (3) - 38 freq naard (3) - 1 freq bumed (3) - 1 freq tymed (3) - 1 freq naem (3) - 48 freq ahmed (3) - 6 freq mimed (3) - 3 freq |
SoundEx code - N530 ninth - 10 freq ninety - 35 freq named - 53 freq naehandy - 1 freq newmade - 1 freq namit - 4 freq nimed - 1 freq nummet - 1 freq ninetie - 2 freq nemyt - 1 freq naemed - 1 freq nint - 4 freq nimmt - 1 freq nemmit - 1 freq new-made - 1 freq naemit - 1 freq nanto - 2 freq nemd - 1 freq |
MetaPhone code - NMT named - 53 freq newmade - 1 freq namit - 4 freq numbed - 4 freq nimed - 1 freq nummet - 1 freq nemyt - 1 freq næmt - 2 freq naemed - 1 freq nimmt - 1 freq nemmit - 1 freq new-made - 1 freq naemit - 1 freq nemd - 1 freq |
NAMED name - 1220 freq named - 53 freq names - 304 freq naming - 2 freq |
| Time to execute Levenshtein function - 0.202104 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.361995 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.029535 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.038117 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.000918 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. |