| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ell (0) - 1 freq eld (1) - 30 freq eal (1) - 1 freq lll (1) - 3 freq all (1) - 1296 freq pell (1) - 4 freq eyl (1) - 9 freq well (1) - 1429 freq els (1) - 11 freq erll (1) - 1 freq wll (1) - 1 freq cell (1) - 38 freq ely (1) - 1 freq oll (1) - 1 freq kell (1) - 1 freq jell (1) - 3 freq elf (1) - 10 freq etl (1) - 1 freq elt (1) - 2 freq iell (1) - 2 freq eli (1) - 4 freq ll (1) - 69 freq epl (1) - 9 freq bell (1) - 215 freq el (1) - 25 freq |
ell (0) - 1 freq ill (1) - 411 freq ll (1) - 69 freq ella (1) - 26 freq ull (1) - 24 freq oll (1) - 1 freq all (1) - 1296 freq yell (1) - 57 freq iell (1) - 2 freq elc (2) - 5 freq eil (2) - 11 freq ellie (2) - 7 freq elk (2) - 6 freq nll (2) - 1 freq nell (2) - 13 freq efl (2) - 2 freq mell (2) - 23 freq pll (2) - 5 freq hell (2) - 375 freq tll (2) - 11 freq fll (2) - 1 freq yull (2) - 6 freq uill (2) - 4 freq lol (2) - 1606 freq lil (2) - 10 freq |
SoundEx code - E400 eel - 24 freq ee'll - 12 freq el - 25 freq ellie - 7 freq eil - 11 freq ely - 1 freq eh'll - 1 freq eh''ll - 1 freq 'el - 2 freq ei'll - 2 freq ella - 26 freq ¢ell - 1 freq eal - 1 freq eli - 4 freq eyl - 9 freq eela - 3 freq 'ee'll - 1 freq eely - 2 freq ey'll - 1 freq 'elle - 1 freq eelie - 1 freq elyia - 2 freq ell - 1 freq eile - 1 freq elo - 2 freq elw - 1 freq elie - 1 freq |
MetaPhone code - EL eel - 24 freq ee'll - 12 freq el - 25 freq ellie - 7 freq eil - 11 freq ely - 1 freq eh'll - 1 freq eh''ll - 1 freq 'el - 2 freq ei'll - 2 freq ella - 26 freq ¢ell - 1 freq eal - 1 freq eli - 4 freq eyl - 9 freq ael - 1 freq eela - 3 freq 'ee'll - 1 freq eely - 2 freq ey'll - 1 freq 'elle - 1 freq eelie - 1 freq ell - 1 freq eile - 1 freq elo - 2 freq elw - 1 freq elie - 1 freq |
ELL |
| Time to execute Levenshtein function - 0.205914 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.427423 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.028985 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.038574 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.000928 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. |