| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elm (0) - 3 freq emm (1) - 6 freq eld (1) - 30 freq elt (1) - 2 freq ely (1) - 1 freq erm (1) - 66 freq elw (1) - 1 freq eli (1) - 4 freq elc (1) - 5 freq em (1) - 354 freq el (1) - 25 freq elk (1) - 5 freq elo (1) - 2 freq eum (1) - 1 freq eam (1) - 7 freq lm (1) - 5 freq edm (1) - 1 freq els (1) - 11 freq blm (1) - 1 freq ell (1) - 1 freq elr (1) - 1 freq elf (1) - 10 freq elms (1) - 1 freq helm (1) - 15 freq lz (2) - 3 freq |
elm (0) - 3 freq lm (1) - 5 freq elr (2) - 1 freq ell (2) - 1 freq elf (2) - 10 freq els (2) - 11 freq elms (2) - 1 freq blm (2) - 1 freq lam (2) - 1 freq alma (2) - 1 freq lum (2) - 139 freq lym (2) - 1 freq leim (2) - 2 freq edm (2) - 1 freq lem (2) - 5 freq leam (2) - 17 freq helm (2) - 15 freq elw (2) - 1 freq ely (2) - 1 freq erm (2) - 66 freq emm (2) - 6 freq eld (2) - 30 freq eam (2) - 7 freq eli (2) - 4 freq elc (2) - 5 freq |
SoundEx code - E450 ellan - 2 freq elaine - 12 freq ellen - 28 freq elm - 3 freq eileen - 18 freq ell-wan - 1 freq eilean - 1 freq ellon - 19 freq eelyin - 1 freq elon - 1 freq |
MetaPhone code - ELM elm - 3 freq |
ELM |
| Time to execute Levenshtein function - 0.405649 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.884460 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.088606 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.094108 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.001005 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. |