| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ettlt (0) - 21 freq settlt (1) - 13 freq ettlit (1) - 3 freq ettlet (1) - 8 freq ettelt (1) - 13 freq ettilt (1) - 25 freq ettle (1) - 190 freq ettl't (1) - 2 freq ettld (1) - 1 freq nestlt (2) - 1 freq tilt (2) - 30 freq eurlt (2) - 1 freq fettit (2) - 1 freq httle (2) - 1 freq elt (2) - 2 freq ectit (2) - 1 freq settlet (2) - 2 freq ently (2) - 2 freq mettle (2) - 12 freq settilt (2) - 1 freq etttle (2) - 1 freq settl (2) - 1 freq etnlz (2) - 1 freq sattlt (2) - 4 freq pettit (2) - 13 freq |
ettlt (0) - 21 freq ettilt (1) - 25 freq ettelt (1) - 13 freq ettlit (1) - 3 freq ettlet (1) - 8 freq ettl't (2) - 2 freq ettld (2) - 1 freq ettle (2) - 190 freq settlt (2) - 13 freq kittlt (3) - 4 freq ettled (3) - 76 freq telt (3) - 1569 freq ettils (3) - 14 freq settelt (3) - 10 freq ettltin (3) - 1 freq ettle' (3) - 1 freq stelt (3) - 2 freq settlit (3) - 7 freq rattlt (3) - 1 freq ettles (3) - 80 freq ettil (3) - 22 freq 'telt (3) - 1 freq ettlan (3) - 1 freq stilt (3) - 1 freq ettlin (3) - 315 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 |
ETTLT |
| Time to execute Levenshtein function - 0.310855 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.702511 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.078872 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.085671 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.000904 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. |