| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elmar (0) - 2 freq elmer (1) - 2 freq ellar (1) - 1 freq elder (2) - 58 freq eynar (2) - 34 freq lear (2) - 107 freq sellar (2) - 15 freq hamar (2) - 5 freq alma (2) - 1 freq liar (2) - 24 freq fulmar (2) - 2 freq weimar (2) - 1 freq kelman (2) - 6 freq alomar (2) - 1 freq ear (2) - 139 freq velar (2) - 7 freq edgar (2) - 10 freq fellar (2) - 1 freq floar (2) - 6 freq elbas (2) - 9 freq almark (2) - 1 freq eemur (2) - 1 freq mar (2) - 16 freq elm (2) - 3 freq elms (2) - 1 freq |
elmar (0) - 2 freq elmer (1) - 2 freq alomar (2) - 1 freq ellar (2) - 1 freq mar (3) - 16 freq elm (3) - 3 freq eemur (3) - 1 freq almark (3) - 1 freq laar (3) - 2 freq altar (3) - 22 freq kumar (3) - 1 freq neymar (3) - 1 freq almac (3) - 1 freq elr (3) - 1 freq tamar (3) - 2 freq elyer (3) - 1 freq elms (3) - 1 freq liar (3) - 24 freq fulmar (3) - 2 freq alma (3) - 1 freq lear (3) - 107 freq elder (3) - 58 freq weimar (3) - 1 freq hamar (3) - 5 freq leir (4) - 20 freq |
SoundEx code - E456 elmer - 2 freq eyeliners - 1 freq eyeliner - 2 freq eleanor - 10 freq elmar - 2 freq eleanordacq - 1 freq ellenrwilson - 1 freq |
MetaPhone code - ELMR elmer - 2 freq elmar - 2 freq |
ELMAR |
| Time to execute Levenshtein function - 0.188626 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.337351 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.028550 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.036902 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.000815 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. |