| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| effel (0) - 1 freq reffel (1) - 2 freq effek (1) - 4 freq eiffel (1) - 2 freq fiel (2) - 31 freq essel (2) - 1 freq duffel (2) - 2 freq feel (2) - 1303 freq eesel (2) - 1 freq effin (2) - 14 freq offen (2) - 17 freq effeks (2) - 1 freq efter (2) - 3150 freq iffen (2) - 4 freq baffel (2) - 1 freq effie (2) - 11 freq excel (2) - 3 freq seffer (2) - 1 freq affil (2) - 7 freq effeir (2) - 1 freq efler (2) - 1 freq fel (2) - 2 freq ersel (2) - 36 freq fael (2) - 2 freq esel (2) - 2 freq |
effel (0) - 1 freq eiffel (1) - 2 freq offal (2) - 2 freq reffel (2) - 2 freq affil (2) - 7 freq effek (2) - 4 freq affen (3) - 118 freq effies (3) - 1 freq efl (3) - 2 freq fael (3) - 2 freq effete (3) - 4 freq eff (3) - 13 freq iffer (3) - 1 freq fufil (3) - 2 freq affer (3) - 2 freq offer (3) - 177 freq fuel (3) - 45 freq fel (3) - 2 freq tfel (3) - 1 freq effi (3) - 1 freq iffen (3) - 4 freq baffel (3) - 1 freq fiel (3) - 31 freq effin (3) - 14 freq offen (3) - 17 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 |
EFFEL |
| Time to execute Levenshtein function - 0.233846 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.339178 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.032302 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.037070 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.000897 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. |