| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nately (0) - 2 freq lately (1) - 57 freq namely (1) - 10 freq natty (2) - 2 freq lanely (2) - 33 freq blately (2) - 2 freq easely (2) - 1 freq sarely (2) - 1 freq stately (2) - 8 freq atey (2) - 1 freq nicely (2) - 16 freq nael (2) - 2 freq fatell (2) - 1 freq sagely (2) - 2 freq natrel (2) - 3 freq naters (2) - 1 freq lakely (2) - 2 freq halely (2) - 7 freq namesy (2) - 1 freq watery (2) - 8 freq ralely (2) - 5 freq rarely (2) - 43 freq nate (2) - 9 freq natal (2) - 2 freq hamely (2) - 45 freq |
nately (0) - 2 freq neatly (2) - 26 freq natal (2) - 2 freq natale (2) - 1 freq lately (2) - 57 freq namely (2) - 10 freq navel (3) - 1 freq anely (3) - 328 freq metely (3) - 1 freq patel (3) - 1 freq quately (3) - 21 freq natalia (3) - 2 freq ently (3) - 2 freq nate (3) - 9 freq nairly (3) - 1 freq entel (3) - 3 freq natalie (3) - 7 freq natty (3) - 2 freq natrel (3) - 3 freq nael (3) - 2 freq nicely (3) - 16 freq noel (4) - 1 freq hotel (4) - 99 freq anatomy (4) - 5 freq aaftly (4) - 1 freq |
SoundEx code - N340 neatly - 26 freq needle - 39 freq nately - 2 freq nettle - 8 freq noddle - 2 freq noodle - 7 freq natalia - 2 freq natal - 2 freq newtyle - 2 freq ïntil - 2 freq nae-tail - 1 freq needly - 4 freq nyeetle - 1 freq natalie - 7 freq neidil - 1 freq naitlie - 1 freq nae-deal - 1 freq natale - 1 freq nuttella - 1 freq nuttall - 1 freq |
MetaPhone code - NTL neatly - 26 freq needle - 39 freq nately - 2 freq nettle - 8 freq noddle - 2 freq noodle - 7 freq natalia - 2 freq natal - 2 freq newtyle - 2 freq ïntil - 2 freq know-it-all - 1 freq nae-tail - 1 freq needly - 4 freq natalie - 7 freq neidil - 1 freq naitlie - 1 freq nae-deal - 1 freq natale - 1 freq nuttella - 1 freq nuttall - 1 freq |
NATELY |
| Time to execute Levenshtein function - 0.227382 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.379946 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.028200 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.038007 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.000986 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. |