| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ellen (0) - 28 freq elren (1) - 1 freq elven (1) - 1 freq ellan (1) - 2 freq ellon (1) - 19 freq fellen (1) - 1 freq allen (1) - 2 freq tellen (1) - 3 freq wellen (1) - 1 freq rellin (2) - 1 freq elmer (2) - 2 freq pullen (2) - 1 freq elke (2) - 3 freq pleen (2) - 1 freq aller (2) - 1 freq helpen (2) - 1 freq etten (2) - 35 freq efler (2) - 1 freq eldon (2) - 1 freq fallen (2) - 29 freq fullen (2) - 1 freq helen (2) - 46 freq yellan (2) - 1 freq sullen (2) - 7 freq eilean (2) - 1 freq |
ellen (0) - 28 freq allen (1) - 2 freq ellon (1) - 19 freq ellan (1) - 2 freq allan (2) - 91 freq yellan (2) - 1 freq wellen (2) - 1 freq yellin (2) - 13 freq elven (2) - 1 freq fellen (2) - 1 freq tellen (2) - 3 freq elren (2) - 1 freq kleen (3) - 1 freq feelen (3) - 5 freq sellin (3) - 70 freq len (3) - 73 freq wellin (3) - 5 freq cleen (3) - 3 freq ellot (3) - 1 freq eleven (3) - 36 freq ellis (3) - 2 freq ealled (3) - 1 freq elyven (3) - 2 freq eglon (3) - 1 freq alles (3) - 1 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 - ELN ellan - 2 freq elaine - 12 freq ellen - 28 freq eileen - 18 freq ae-lane - 2 freq eilean - 1 freq ellon - 19 freq elon - 1 freq |
ELLEN |
| Time to execute Levenshtein function - 0.292333 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.536751 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.062761 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.042063 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.000792 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. |