| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eflir (0) - 1 freq efir (1) - 1 freq efler (1) - 1 freq eftir (1) - 500 freq dlir (2) - 1 freq flirt (2) - 6 freq effair (2) - 1 freq elic (2) - 2 freq evir (2) - 4 freq elr (2) - 1 freq ellar (2) - 1 freq effirt (2) - 3 freq effi (2) - 1 freq esli (2) - 3 freq feir (2) - 7 freq foir (2) - 6 freq fir (2) - 4027 freq eftur (2) - 1 freq afoir (2) - 68 freq efl (2) - 2 freq flie (2) - 9 freq efer (2) - 1 freq flr (2) - 3 freq befoir (2) - 2 freq elie (2) - 1 freq |
eflir (0) - 1 freq efler (1) - 1 freq flier (2) - 1 freq flair (2) - 398 freq flr (2) - 3 freq flor (2) - 1 freq fluir (2) - 40 freq eftir (2) - 500 freq efir (2) - 1 freq flip (3) - 9 freq fylier (3) - 1 freq aftir (3) - 1 freq malir (3) - 1 freq lir (3) - 16 freq flit (3) - 64 freq eftyr (3) - 1 freq efter (3) - 3150 freq flaur (3) - 1 freq floor (3) - 87 freq floar (3) - 6 freq flyer (3) - 1 freq floer (3) - 2 freq flyre (3) - 1 freq flare (3) - 10 freq flure (3) - 13 freq |
SoundEx code - E146 efflorescent - 1 freq efler - 1 freq efflorescence - 1 freq eflir - 1 freq eablairshamster - 17 freq |
MetaPhone code - EFLR efler - 1 freq eflir - 1 freq |
EFLIR |
| Time to execute Levenshtein function - 0.214253 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.362135 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.027411 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.037648 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.000916 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. |