| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nae-deal (0) - 1 freq nae-pea (2) - 1 freq nae-weel (2) - 6 freq naetral (3) - 1 freq naeweel (3) - 1 freq nae-say (3) - 3 freq rae-deer (3) - 1 freq dae-weel (3) - 1 freq yae-aal (3) - 1 freq nae-tail (3) - 1 freq yae-dae (3) - 1 freq ae-day (3) - 1 freq aa-heal (3) - 1 freq tae-dae (3) - 6 freq federal (4) - 5 freq bermeal (4) - 1 freq naemed (4) - 1 freq naewan (4) - 22 freq aitmeal (4) - 2 freq needed (4) - 150 freq na-na (4) - 1 freq naether (4) - 5 freq nceded (4) - 1 freq halemeal (4) - 2 freq the-day (4) - 32 freq |
nae-deal (0) - 1 freq nae-weel (3) - 6 freq nae-pea (4) - 1 freq nae-tail (4) - 1 freq neidil (5) - 1 freq aa-heal (5) - 1 freq no-weel (5) - 1 freq ae-day (5) - 1 freq sun-dial (5) - 1 freq run-deil (5) - 1 freq one-day (5) - 1 freq tae-dae (5) - 6 freq naeweel (5) - 1 freq rae-deer (5) - 1 freq nae-say (5) - 3 freq dae-weel (5) - 1 freq yae-aal (5) - 1 freq naetral (5) - 1 freq yae-dae (5) - 1 freq pedal (6) - 6 freq navel (6) - 1 freq na-say (6) - 8 freq needful (6) - 4 freq ane-eed (6) - 1 freq nelde (6) - 3 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 |
NAE-DEAL |
| Time to execute Levenshtein function - 0.186363 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.361786 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.029296 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.044412 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.001186 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. |