| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nemmit (0) - 1 freq semmit (1) - 23 freq sommit (2) - 3 freq tempit (2) - 11 freq neckit (2) - 2 freq seemit (2) - 20 freq emit (2) - 4 freq permit (2) - 7 freq leimit (2) - 1 freq feemit (2) - 1 freq simmit (2) - 6 freq hermit (2) - 17 freq demit (2) - 2 freq nemmes (2) - 10 freq leemit (2) - 14 freq nemme (2) - 9 freq neibit (2) - 3 freq remit (2) - 11 freq nimmt (2) - 1 freq needit (2) - 167 freq lempit (2) - 2 freq mummit (2) - 1 freq nemms (2) - 2 freq kermit (2) - 2 freq lesmit (2) - 1 freq |
nemmit (0) - 1 freq semmit (2) - 23 freq nummet (2) - 1 freq nimmt (2) - 1 freq demmet (3) - 1 freq hummit (3) - 1 freq nemms (3) - 2 freq mummit (3) - 1 freq jammit (3) - 2 freq nemm (3) - 6 freq summit (3) - 54 freq naemit (3) - 1 freq dammit (3) - 9 freq namit (3) - 4 freq nummi (3) - 3 freq commit (3) - 17 freq nemyt (3) - 1 freq nemmes (3) - 10 freq simmit (3) - 6 freq nemme (3) - 9 freq sommit (3) - 3 freq nekit (4) - 2 freq remit (4) - 11 freq nesbit (4) - 1 freq neukit (4) - 1 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 |
NEMMIT |
| Time to execute Levenshtein function - 0.217069 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.389783 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.029742 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.037873 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.000873 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. |