| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eile (0) - 1 freq etle (1) - 1 freq heile (1) - 1 freq eire (1) - 3 freq pile (1) - 113 freq eil (1) - 11 freq wile (1) - 164 freq eine (1) - 1 freq erle (1) - 4 freq lile (1) - 1 freq tile (1) - 5 freq eise (1) - 2 freq eilse (1) - 1 freq geile (1) - 1 freq nile (1) - 14 freq eild (1) - 17 freq rile (1) - 3 freq exile (1) - 20 freq mile (1) - 278 freq jile (1) - 42 freq uile (1) - 2 freq vile (1) - 14 freq sile (1) - 9 freq ile (1) - 65 freq bile (1) - 56 freq |
eile (0) - 1 freq uile (1) - 2 freq eil (1) - 11 freq ile (1) - 65 freq elie (2) - 1 freq eal (2) - 1 freq eli (2) - 4 freq aule (2) - 1 freq yuile (2) - 1 freq ilie (2) - 1 freq ely (2) - 1 freq yale (2) - 7 freq aale (2) - 1 freq ole (2) - 2 freq le (2) - 53 freq ili (2) - 1 freq eela (2) - 3 freq el (2) - 25 freq ily (2) - 2 freq ale (2) - 53 freq oil (2) - 90 freq eel (2) - 24 freq lie (2) - 262 freq ail (2) - 7 freq iley (2) - 4 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 |
EILE |
| Time to execute Levenshtein function - 0.215397 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.340378 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.027676 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.037445 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.000883 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. |