| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| needle (0) - 39 freq meedle (1) - 1 freq deedle (1) - 2 freq eedle (1) - 1 freq needler (1) - 2 freq needae (1) - 1 freq needles (1) - 17 freq needly (1) - 4 freq needie (1) - 3 freq needet (2) - 2 freq deedly (2) - 2 freq needs (2) - 340 freq meedie (2) - 2 freq teeble (2) - 6 freq deedlie (2) - 1 freq needin (2) - 213 freq neale (2) - 1 freq teedee (2) - 1 freq meddle (2) - 9 freq meedae (2) - 2 freq wheedle (2) - 3 freq peeble (2) - 1 freq peeple (2) - 3 freq needid (2) - 1 freq needle's (2) - 4 freq |
needle (0) - 39 freq needly (1) - 4 freq needles (2) - 17 freq noodle (2) - 7 freq needae (2) - 1 freq needie (2) - 3 freq meedle (2) - 1 freq deedle (2) - 2 freq eedle (2) - 1 freq needler (2) - 2 freq needna (3) - 44 freq noddle (3) - 2 freq needty (3) - 1 freq needfu (3) - 12 freq needy (3) - 7 freq nyeetle (3) - 1 freq need (3) - 1819 freq need'ae (3) - 3 freq needa (3) - 1 freq neednae (3) - 21 freq eandle (3) - 1 freq needan (3) - 14 freq needen (3) - 3 freq beadle (3) - 9 freq neerly (3) - 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 |
NEEDLE |
| Time to execute Levenshtein function - 0.199244 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.347980 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.027727 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.037417 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.000952 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. |