| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ettlit (0) - 3 freq ettlt (1) - 21 freq ettl't (1) - 2 freq settlit (1) - 7 freq ettlin (1) - 315 freq ettlet (1) - 8 freq rettlin (2) - 2 freq settlt (2) - 13 freq ettie (2) - 4 freq settlet (2) - 2 freq eatit (2) - 1 freq ettlin' (2) - 1 freq ettilin (2) - 1 freq ettelt (2) - 13 freq estait (2) - 2 freq settit (2) - 1 freq entitlit (2) - 1 freq ettle' (2) - 1 freq ethlie (2) - 1 freq ettles (2) - 80 freq kettlie (2) - 3 freq ettil (2) - 22 freq ettltin (2) - 1 freq telit (2) - 1 freq ettling (2) - 2 freq |
ettlit (0) - 3 freq ettlet (1) - 8 freq ettlt (1) - 21 freq ettelt (2) - 13 freq ettilt (2) - 25 freq ettlin (2) - 315 freq ettl't (2) - 2 freq settlit (2) - 7 freq ettltin (3) - 1 freq ettles (3) - 80 freq telit (3) - 1 freq ettil (3) - 22 freq ettle (3) - 190 freq kittlit (3) - 2 freq ettled (3) - 76 freq ettlan (3) - 1 freq ettld (3) - 1 freq titlet (3) - 1 freq settlet (3) - 2 freq ettle' (3) - 1 freq settlt (3) - 13 freq ettilin (3) - 1 freq entitlit (3) - 1 freq settelt (4) - 10 freq settilt (4) - 1 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 |
ETTLIT |
| Time to execute Levenshtein function - 0.183066 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.329710 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.027891 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.037267 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.000855 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. |