| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| efl (0) - 2 freq eel (1) - 24 freq eff (1) - 13 freq ef (1) - 14 freq eft (1) - 3 freq efj (1) - 1 freq epl (1) - 9 freq eyl (1) - 9 freq efc (1) - 1 freq fl (1) - 3 freq ell (1) - 1 freq eal (1) - 1 freq nfl (1) - 2 freq efp (1) - 1 freq etl (1) - 1 freq efo (1) - 1 freq efr (1) - 1 freq pfl (1) - 1 freq el (1) - 25 freq efh (1) - 1 freq efi (1) - 1 freq eil (1) - 11 freq afk (2) - 1 freq eye (2) - 237 freq kell (2) - 1 freq |
efl (0) - 2 freq fl (1) - 3 freq feal (2) - 1 freq fal (2) - 4 freq feel (2) - 1303 freq flo (2) - 7 freq efi (2) - 1 freq eil (2) - 11 freq afil (2) - 1 freq feil (2) - 7 freq fly (2) - 183 freq ful (2) - 51 freq fol (2) - 2 freq fil (2) - 2 freq afyl (2) - 1 freq fel (2) - 2 freq flu (2) - 36 freq efh (2) - 1 freq feul (2) - 1 freq eft (2) - 3 freq nfl (2) - 2 freq ell (2) - 1 freq efp (2) - 1 freq efj (2) - 1 freq epl (2) - 9 freq |
SoundEx code - E140 evil - 90 freq epple - 13 freq effel - 1 freq ebola - 1 freq eeevilly - 1 freq eiffel - 2 freq eivill - 1 freq evil' - 1 freq evill - 1 freq €˜evil - 2 freq ebble - 1 freq epl - 9 freq efl - 2 freq epely - 1 freq |
MetaPhone code - EFL evil - 90 freq effel - 1 freq eeevilly - 1 freq eiffel - 2 freq eivill - 1 freq aefaal - 1 freq aefaallie - 1 freq evil' - 1 freq evill - 1 freq €˜evil - 2 freq efl - 2 freq |
EFL |
| Time to execute Levenshtein function - 0.215802 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.374937 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.030363 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.037967 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.001016 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. |