| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eamonnreynolds (0) - 87 freq leonreynolds (4) - 2 freq reynolds (6) - 4 freq minneapolis (7) - 1 freq eamonnss (7) - 1 freq eamonns (7) - 1 freq monkeynuts (7) - 1 freq eamonnoneill (7) - 3 freq eamonnmallie (7) - 1 freq mongrels (7) - 1 freq mornen's (8) - 2 freq gangrels (8) - 1 freq homogenous (8) - 1 freq amorous (8) - 3 freq mooren's (8) - 1 freq eminently (8) - 2 freq weemen-freends (8) - 1 freq mountainous (8) - 5 freq mcconnell's (8) - 1 freq montheneeps (8) - 1 freq tonnels (8) - 1 freq monthedons (8) - 1 freq anyroads (8) - 1 freq pannells (8) - 1 freq monkeys (8) - 18 freq |
eamonnreynolds (0) - 87 freq leonreynolds (6) - 2 freq reynolds (9) - 4 freq eamonnoneill (10) - 3 freq ronnieronaldo (10) - 2 freq mongrels (10) - 1 freq minneapolis (10) - 1 freq marigolds (11) - 4 freq emeralds (11) - 10 freq minefields (11) - 1 freq monkeynuts (11) - 1 freq unfreends (11) - 3 freq eamonnmallie (11) - 1 freq eamonns (11) - 1 freq eamonnss (11) - 1 freq monklands (11) - 1 freq bonnieness (12) - 5 freq mongrel (12) - 4 freq sannels (12) - 1 freq onnen's (12) - 1 freq thunnerbolts (12) - 1 freq monietors (12) - 2 freq onieroads (12) - 6 freq o'connells (12) - 1 freq monketnuts (12) - 1 freq |
SoundEx code - E556 enamourt - 1 freq enamoured - 1 freq eamonnreynolds - 87 freq |
MetaPhone code - EMNRNLTS eamonnreynolds - 87 freq |
EAMONNREYNOLDS |
| Time to execute Levenshtein function - 0.250382 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.463023 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.032671 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.037715 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.001030 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. |