| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nearhaunthat's (2) - 1 freq nearhaun (4) - 69 freq nearhaund (4) - 16 freq narhaund (5) - 1 freq near-haun (5) - 5 freq nearhand (5) - 2 freq neirhaund (5) - 1 freq nearhan (5) - 28 freq enchauntit (5) - 3 freq naurhaund (6) - 1 freq near-aboot (6) - 1 freq near-at-haun (6) - 2 freq hauntan (6) - 1 freq hauntit (6) - 15 freq yearhunner (6) - 8 freq enchantan (6) - 1 freq €˜enchauntit (6) - 1 freq narratit (6) - 1 freq near-shut (6) - 2 freq thanthay (6) - 1 freq chauntit (6) - 2 freq dishauntit (6) - 2 freq anthat (6) - 1 freq twa-haundit (6) - 3 freq naarhan (6) - 17 freq |
nearhaunthat's (4) - 1 freq enchauntit (7) - 3 freq nearhaund (7) - 16 freq nearhaun (7) - 69 freq enchantit (8) - 2 freq nearhan (8) - 28 freq neirhaund (8) - 1 freq narhaund (8) - 1 freq nearhand (8) - 2 freq dishauntit (9) - 2 freq anthat (9) - 1 freq learntit (9) - 1 freq naarhan (9) - 17 freq nargansett (9) - 1 freq inchantit (9) - 2 freq chauntit (9) - 2 freq neirhann (9) - 1 freq narhaan (9) - 1 freq hauntet (9) - 2 freq grantham (9) - 1 freq thanthay (9) - 1 freq near-haun (9) - 5 freq hauntit (9) - 15 freq enchantan (9) - 1 freq near-shut (9) - 2 freq |
SoundEx code - N653 nearhaund - 16 freq neerendin - 1 freq nearhaunthat's - 1 freq ne'er-endin - 1 freq neirhaund - 1 freq naurhaund - 1 freq narhaund - 1 freq nearhand - 2 freq normative - 1 freq €˜naurhaund - 1 freq |
MetaPhone code - NRHN0T |
NEARHAUNTHAT |
| Time to execute Levenshtein function - 0.218194 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.410893 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.029613 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.037298 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.000842 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. |