| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ella (0) - 26 freq eela (1) - 3 freq fella (1) - 101 freq ellar (1) - 1 freq “lla (1) - 1 freq ell (1) - 1 freq bella (1) - 96 freq elba (1) - 15 freq ellan (1) - 2 freq yella (1) - 130 freq erll (2) - 1 freq cola (2) - 10 freq claa (2) - 14 freq alsa (2) - 1 freq emlaw (2) - 1 freq wells (2) - 19 freq hecla (2) - 4 freq ll (2) - 69 freq sellan (2) - 1 freq hell (2) - 375 freq well (2) - 1429 freq slaa (2) - 3 freq elfs (2) - 1 freq enna (2) - 11 freq erly (2) - 3 freq |
ella (0) - 26 freq yella (1) - 130 freq ell (1) - 1 freq yilla (2) - 1 freq yell (2) - 57 freq yalla (2) - 99 freq yellay (2) - 2 freq olly (2) - 6 freq ally (2) - 309 freq iell (2) - 2 freq ill (2) - 411 freq lila (2) - 1 freq all (2) - 1296 freq yellae (2) - 55 freq yelly (2) - 12 freq lle (2) - 1 freq ull (2) - 24 freq oll (2) - 1 freq ll (2) - 69 freq allay (2) - 1 freq ellan (2) - 2 freq bella (2) - 96 freq elba (2) - 15 freq “lla (2) - 1 freq ellie (2) - 7 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 |
ELLA |
| Time to execute Levenshtein function - 0.236512 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.503185 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.059815 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.038223 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.000927 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. |