| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| naitherback (0) - 1 freq waithercock' (4) - 1 freq gaitheran (4) - 2 freq naiteral (4) - 6 freq sate-back (4) - 1 freq paperback (4) - 25 freq naither (4) - 63 freq biteback (4) - 1 freq silverback (4) - 2 freq gait-track (4) - 1 freq faither' (5) - 5 freq gaithert (5) - 79 freq mitherlaun (5) - 1 freq laidback (5) - 1 freq faither'll (5) - 1 freq smithermann (5) - 1 freq leiteracy (5) - 3 freq saiterday (5) - 2 freq itherhaun (5) - 1 freq centre-back (5) - 1 freq gaitherer's (5) - 1 freq naitered (5) - 1 freq gaithery (5) - 8 freq taethebard (5) - 1 freq saut-brack (5) - 1 freq |
naitherback (0) - 1 freq silverback (7) - 2 freq atarbuck (7) - 1 freq mathrick (7) - 1 freq naither (7) - 63 freq netherbow (7) - 6 freq biteback (7) - 1 freq sate-back (7) - 1 freq cheerback (7) - 1 freq waithercock' (7) - 1 freq paperback (7) - 25 freq interack (7) - 1 freq tarbuck (8) - 1 freq fisherfock (8) - 1 freq nithered (8) - 1 freq throwback (8) - 2 freq interdick (8) - 1 freq netherwarl (8) - 1 freq keithjack (8) - 8 freq neither'd (8) - 1 freq interlock (8) - 1 freq nithert (8) - 2 freq nethergate (8) - 13 freq intherect (8) - 1 freq fightback (8) - 1 freq |
SoundEx code - N361 netherbow - 6 freq naitherback - 1 freq natureprescriptions - 1 freq |
MetaPhone code - N0RBK naitherback - 1 freq |
NAITHERBACK |
| Time to execute Levenshtein function - 0.394698 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.708052 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.031312 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.037319 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.000889 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. |