Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ettil (0) - 22 freq settil (1) - 1 freq ettie (1) - 4 freq mettil (1) - 1 freq ettils (1) - 14 freq ettilt (1) - 25 freq ettin (1) - 13 freq fettil (1) - 3 freq mettin (2) - 2 freq it'il (2) - 1 freq egil (2) - 4 freq kittil (2) - 9 freq lettir (2) - 2 freq ectit (2) - 1 freq atil (2) - 17 freq suttil (2) - 1 freq teil (2) - 4 freq etin (2) - 10 freq ett' (2) - 1 freq entel (2) - 3 freq til (2) - 1722 freq evil (2) - 90 freq mettir (2) - 2 freq ertik (2) - 1 freq etttle (2) - 1 freq |
ettil (0) - 22 freq fettil (2) - 3 freq settil (2) - 1 freq ettle (2) - 190 freq teitil (2) - 6 freq ettin (2) - 13 freq ettie (2) - 4 freq ettilt (2) - 25 freq mettil (2) - 1 freq ettils (2) - 14 freq bottil (3) - 6 freq tail (3) - 265 freq etl (3) - 1 freq ottin (3) - 1 freq sattil (3) - 1 freq intil (3) - 554 freq leitil (3) - 1 freq ettilin (3) - 1 freq eatit (3) - 1 freq ett (3) - 97 freq battil (3) - 2 freq attic (3) - 15 freq 'til (3) - 15 freq toil (3) - 25 freq stil (3) - 5 freq |
SoundEx code - E340 ettle - 190 freq eedol - 1 freq eithlie - 8 freq ettil - 22 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 - 190 freq eedol - 1 freq ettil - 22 freq eittle - 1 freq eet'll - 9 freq ettle' - 1 freq etttle - 1 freq etle - 1 freq eedle - 1 freq etl - 1 freq |
ETTIL |
Time to execute Levenshtein function - 0.193683 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.370270 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.027524 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.041145 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.000938 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. |