| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| naurhaund (0) - 1 freq narhaund (1) - 1 freq nearhaund (2) - 16 freq neirhaund (2) - 1 freq €˜naurhaund (2) - 1 freq nearhaun (3) - 69 freq daub-haund (3) - 1 freq narhaan (3) - 1 freq nearhand (3) - 2 freq naarhan (3) - 17 freq efterhaund (4) - 4 freq dounhaud (4) - 1 freq nae-baud (4) - 1 freq hairband (4) - 1 freq norland (4) - 9 freq dabhand (4) - 1 freq naerraed (4) - 1 freq backhaud (4) - 1 freq gourgaud (4) - 1 freq armand (4) - 1 freq hinthaund (4) - 1 freq norlauns (4) - 5 freq naewhaurs (4) - 1 freq narra'd (4) - 1 freq aff-haund (4) - 2 freq |
naurhaund (0) - 1 freq narhaund (1) - 1 freq neirhaund (2) - 1 freq nearhaund (2) - 16 freq nearhand (3) - 2 freq naarhan (4) - 17 freq nearhaun (4) - 69 freq narhaan (4) - 1 freq €˜naurhaund (4) - 1 freq norland (5) - 9 freq naehandy (5) - 1 freq deerhound (5) - 1 freq neirhann (5) - 1 freq nearhan (5) - 28 freq aforehaund (5) - 7 freq deerhund (5) - 1 freq tarland (6) - 4 freq fairmhand (6) - 1 freq 'haund (6) - 3 freq graund (6) - 24 freq warrand (6) - 5 freq aground (6) - 1 freq nauthin (6) - 2 freq engurland (6) - 2 freq coohaund (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 |
NAURHAUND |
| Time to execute Levenshtein function - 0.235668 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.421320 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.028621 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.038819 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.000967 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. |