| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| annemariedehaan (0) - 1 freq annemarieneary (4) - 1 freq nearer-haun (7) - 1 freq annmariegallig (7) - 1 freq aforehaan (8) - 1 freq narhaan (8) - 1 freq annemar (8) - 1 freq nearesthaund (8) - 1 freq unnerstaan (8) - 15 freq annelaird (8) - 1 freq annmari (8) - 2 freq annmairelee (8) - 1 freq annewitha (8) - 1 freq nearhan (8) - 28 freq near-haun (8) - 5 freq nearbegyaain (8) - 1 freq headie-eraa (8) - 1 freq innerleithen (8) - 2 freq innerleithin (8) - 1 freq angst-ridden (8) - 1 freq interbreedeen (8) - 1 freq hebridean (8) - 2 freq near-at-haun (8) - 2 freq annemclaughlin (8) - 8 freq near-be-gaan (8) - 1 freq |
annemariedehaan (0) - 1 freq annemarieneary (7) - 1 freq nearer-haun (10) - 1 freq near-haun (11) - 5 freq nearhan (11) - 28 freq innerleithin (11) - 1 freq nearhaun (11) - 69 freq annmari (11) - 2 freq innerleithen (11) - 2 freq annmairelee (11) - 1 freq narhaan (11) - 1 freq annmariegallig (11) - 1 freq annelaird (11) - 1 freq annemar (11) - 1 freq unnerstaan (11) - 15 freq meridian (12) - 1 freq unnerin (12) - 1 freq unnerstaun (12) - 207 freq unnerstan (12) - 49 freq onnerstaun (12) - 2 freq neanderthal (12) - 4 freq naarhan (12) - 17 freq dungarbhan (12) - 1 freq manmademoon (12) - 1 freq unnertaken (12) - 1 freq |
SoundEx code - A556 anymair - 33 freq anymare - 17 freq anymore - 14 freq anymaire - 11 freq anunner - 1 freq annemarieneary - 1 freq annemar - 1 freq annemariedehaan - 1 freq annamorozova - 1 freq |
MetaPhone code - ANMRTHN annemariedehaan - 1 freq |
ANNEMARIEDEHAAN |
| Time to execute Levenshtein function - 0.367748 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.552421 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.055791 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.042548 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.000906 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. |