| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elmundo (0) - 2 freq edmunds (2) - 1 freq lundy (3) - 1 freq mondo (3) - 2 freq lundon (3) - 2 freq munro (3) - 46 freq undo (3) - 1 freq mundi (3) - 2 freq murdo (3) - 18 freq almond (3) - 4 freq elude (3) - 1 freq almonds (3) - 2 freq soundo (3) - 1 freq slundy (3) - 1 freq blund (3) - 1 freq launds (3) - 19 freq emond (3) - 1 freq ludo (3) - 1 freq mindo (3) - 1 freq eliud (3) - 3 freq laund (3) - 89 freq lando (3) - 1 freq munda (3) - 1 freq mungo (3) - 7 freq melgund (3) - 1 freq |
elmundo (0) - 2 freq almond (3) - 4 freq munda (4) - 1 freq almonds (4) - 2 freq mindo (4) - 1 freq lomond (4) - 17 freq eland (4) - 1 freq mundi (4) - 2 freq lundy (4) - 1 freq edmunds (4) - 1 freq mondo (4) - 2 freq lando (4) - 1 freq lamond (4) - 1 freq laund (4) - 89 freq emond (4) - 1 freq remind (5) - 41 freq lindy (5) - 1 freq 'mynd (5) - 3 freq munday (5) - 1 freq lend (5) - 22 freq almeida (5) - 1 freq lyand (5) - 1 freq 'amanda (5) - 1 freq mend (5) - 42 freq landy (5) - 9 freq |
SoundEx code - E455 elementary - 4 freq element - 45 freq eliminate - 2 freq elements - 35 freq 'elements' - 1 freq eliminates - 1 freq elemints - 1 freq eliminated - 1 freq elementar - 3 freq elaineyoung - 3 freq elmentalhealth - 3 freq elmundo - 2 freq |
MetaPhone code - ELMNT element - 45 freq eliminate - 2 freq elmundo - 2 freq |
ELMUNDO |
| Time to execute Levenshtein function - 0.212415 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.428104 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.028289 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.038778 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.001135 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. |