| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neirhaund (0) - 1 freq nearhaund (1) - 16 freq narhaund (2) - 1 freq neirhann (2) - 1 freq naurhaund (2) - 1 freq nearhand (2) - 2 freq nearhaun (2) - 69 freq lefthaund (3) - 1 freq nearhan (3) - 28 freq deerhound (3) - 1 freq nerr-haun (3) - 1 freq deerhund (3) - 1 freq near-haun (3) - 5 freq birnand (4) - 2 freq efterhaund (4) - 4 freq nearesthaund (4) - 1 freq airland (4) - 2 freq hinthaund (4) - 1 freq new-fand (4) - 1 freq eittand (4) - 1 freq €˜naurhaund (4) - 1 freq muirlaun (4) - 1 freq neithen (4) - 3 freq servand (4) - 2 freq foirgaun (4) - 3 freq |
neirhaund (0) - 1 freq nearhaund (1) - 16 freq naurhaund (2) - 1 freq nearhand (2) - 2 freq narhaund (2) - 1 freq nearhaun (3) - 69 freq neirhann (3) - 1 freq deerhound (4) - 1 freq deerhund (4) - 1 freq nearhan (4) - 28 freq narhaan (5) - 1 freq naarhan (5) - 17 freq norland (5) - 9 freq aforehaund (5) - 7 freq near-haun (5) - 5 freq norlauns (6) - 5 freq irland (6) - 6 freq errand (6) - 5 freq greyhound (6) - 3 freq menshund (6) - 1 freq haund (6) - 384 freq 'haund (6) - 3 freq norlaun (6) - 1 freq fermhand (6) - 1 freq deerhunds (6) - 1 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 - NRHNT nearhaund - 16 freq neirhaund - 1 freq naurhaund - 1 freq narhaund - 1 freq nearhand - 2 freq €˜naurhaund - 1 freq |
NEIRHAUND |
| Time to execute Levenshtein function - 0.274003 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.549517 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.060027 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.038429 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.000991 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. |