Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eel (0) - 24 freq eely (1) - 2 freq el (1) - 25 freq gel (1) - 13 freq heel (1) - 36 freq ee (1) - 1592 freq seel (1) - 1 freq tel (1) - 47 freq eet (1) - 581 freq esel (1) - 2 freq eela (1) - 3 freq yeel (1) - 10 freq ee' (1) - 4 freq epl (1) - 9 freq jeel (1) - 7 freq ell (1) - 1 freq keel (1) - 12 freq reel (1) - 44 freq mel (1) - 4 freq ael (1) - 1 freq eee (1) - 3 freq fel (1) - 2 freq hel (1) - 15 freq meel (1) - 3 freq eyl (1) - 9 freq |
eel (0) - 24 freq yeel (1) - 10 freq eela (1) - 3 freq ael (1) - 1 freq yel (1) - 4 freq iel (1) - 1 freq eal (1) - 1 freq eil (1) - 11 freq el (1) - 25 freq eyl (1) - 9 freq eely (1) - 2 freq eile (2) - 1 freq yul (2) - 1 freq l (2) - 178 freq elo (2) - 2 freq lea (2) - 155 freq yeil (2) - 1 freq yiel (2) - 1 freq efl (2) - 2 freq eeh (2) - 1 freq sel (2) - 75 freq peel (2) - 41 freq eec (2) - 2 freq ley (2) - 3 freq aal (2) - 755 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 |
EEL |
Time to execute Levenshtein function - 0.172109 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.304740 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.027650 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.037188 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.000882 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. |