| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ettilt (0) - 25 freq ettil (1) - 22 freq settilt (1) - 1 freq ettlt (1) - 21 freq ettils (1) - 14 freq ettelt (1) - 13 freq fettilt (1) - 1 freq ettlet (2) - 8 freq ettle (2) - 190 freq ettin (2) - 13 freq fettil (2) - 3 freq sattilt (2) - 9 freq ettie (2) - 4 freq ettlit (2) - 3 freq settint (2) - 1 freq ectit (2) - 1 freq twilt (2) - 2 freq nettils (2) - 1 freq tilt (2) - 30 freq settil (2) - 1 freq fettit (2) - 1 freq settlt (2) - 13 freq ontilt (2) - 4 freq ettilin (2) - 1 freq etttle (2) - 1 freq |
ettilt (0) - 25 freq ettlt (1) - 21 freq ettelt (1) - 13 freq fettilt (2) - 1 freq ettlit (2) - 3 freq ettlet (2) - 8 freq ettils (2) - 14 freq ettil (2) - 22 freq settilt (2) - 1 freq rattilt (3) - 1 freq intilt (3) - 11 freq ettilin (3) - 1 freq detailt (3) - 2 freq ontilt (3) - 4 freq ettl't (3) - 2 freq stilt (3) - 1 freq entitilt (3) - 1 freq settlt (3) - 13 freq attimt (3) - 1 freq ettld (3) - 1 freq settelt (3) - 10 freq kittilt (3) - 5 freq tilt (3) - 30 freq twilt (3) - 2 freq sattilt (3) - 9 freq |
SoundEx code - E343 ettled - 76 freq ettelt - 13 freq ettilt - 25 freq ettlt - 21 freq ettld - 1 freq ettltin - 1 freq ettlit - 3 freq ettlet - 8 freq ettl't - 2 freq |
MetaPhone code - ETLT ettled - 76 freq ettelt - 13 freq ettilt - 25 freq ettlt - 21 freq ettld - 1 freq ettlit - 3 freq ettlet - 8 freq ettl't - 2 freq |
ETTILT |
| Time to execute Levenshtein function - 0.205079 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.404645 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.027058 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.039746 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.000912 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. |