| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| etle (0) - 1 freq eile (1) - 1 freq ettle (1) - 188 freq etl (1) - 1 freq erle (1) - 4 freq mule (2) - 4 freq meyle (2) - 1 freq €™le (2) - 4 freq tetley (2) - 1 freq tlee (2) - 2 freq etin (2) - 10 freq lethe (2) - 2 freq etxu (2) - 1 freq efler (2) - 1 freq 'tl (2) - 1 freq rule (2) - 164 freq mlle (2) - 1 freq exile (2) - 20 freq myle (2) - 15 freq eal (2) - 1 freq elke (2) - 3 freq mle (2) - 1 freq eilse (2) - 1 freq wyle (2) - 5 freq idle (2) - 27 freq |
etle (0) - 1 freq etl (1) - 1 freq tl (2) - 8 freq tyle (2) - 1 freq atl (2) - 2 freq tile (2) - 5 freq tele (2) - 28 freq tale (2) - 299 freq tlee (2) - 2 freq atli (2) - 1 freq eile (2) - 1 freq ettle (2) - 188 freq erle (2) - 4 freq etc (3) - 189 freq tbe (3) - 1 freq gale (3) - 64 freq cele (3) - 1 freq toole (3) - 1 freq title (3) - 64 freq eyl (3) - 9 freq dale (3) - 29 freq heile (3) - 1 freq dole (3) - 20 freq mele (3) - 1 freq leetle (3) - 2 freq |
SoundEx code - E340 ettle - 188 freq eedol - 1 freq eithlie - 8 freq ettil - 20 freq eittle - 1 freq eet'll - 9 freq eithly - 2 freq ettle' - 1 freq etttle - 1 freq etle - 1 freq ethlie - 1 freq eedle - 1 freq etl - 1 freq |
MetaPhone code - ETL ettle - 188 freq eedol - 1 freq ettil - 20 freq eittle - 1 freq eet'll - 9 freq ettle' - 1 freq etttle - 1 freq etle - 1 freq eedle - 1 freq etl - 1 freq |
ETLE |
| Time to execute Levenshtein function - 0.167832 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.327063 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.027475 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.037145 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.000810 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. |