| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| namely (0) - 10 freq hamely (1) - 45 freq nately (1) - 2 freq namesy (1) - 1 freq nicely (2) - 16 freq names (2) - 300 freq name's (2) - 33 freq ralely (2) - 5 freq name (2) - 1202 freq names' (2) - 1 freq namer (2) - 1 freq navel (2) - 1 freq awely (2) - 8 freq navels (2) - 1 freq famly (2) - 5 freq comely (2) - 4 freq camels (2) - 4 freq enamel (2) - 5 freq barely (2) - 96 freq timely (2) - 4 freq lakely (2) - 2 freq lanely (2) - 31 freq sarely (2) - 1 freq lately (2) - 57 freq nairly (2) - 1 freq |
namely (0) - 10 freq namelie (2) - 3 freq namesy (2) - 1 freq enamel (2) - 5 freq hamely (2) - 45 freq nately (2) - 2 freq camel (3) - 7 freq family (3) - 324 freq pamela (3) - 1 freq nael (3) - 2 freq nairly (3) - 1 freq femely (3) - 1 freq namby (3) - 1 freq somely (3) - 1 freq named (3) - 50 freq homely (3) - 2 freq amly (3) - 1 freq name' (3) - 3 freq anely (3) - 323 freq anomaly (3) - 2 freq comely (3) - 4 freq famly (3) - 5 freq name (3) - 1202 freq anomoly (3) - 1 freq navel (3) - 1 freq |
SoundEx code - N540 nane'll - 2 freq nimmle - 2 freq name'll - 3 freq namely - 10 freq namelie - 3 freq nine'll - 1 freq newmill - 1 freq |
MetaPhone code - NML nimmle - 2 freq nimble - 1 freq name'll - 3 freq namely - 10 freq namelie - 3 freq newmill - 1 freq |
NAMELY |
| Time to execute Levenshtein function - 0.196129 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.342964 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.027723 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.040681 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.000875 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. |