Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ettlin (0) - 315 freq fettlin (1) - 6 freq ettilin (1) - 1 freq ettlins (1) - 26 freq settlin (1) - 38 freq ettlit (1) - 3 freq ettlin' (1) - 1 freq ettlan (1) - 1 freq kettlin (1) - 3 freq ettin (1) - 13 freq nettlin (1) - 1 freq rettlin (1) - 2 freq ettltin (1) - 1 freq ettling (1) - 2 freq getttin (2) - 2 freq yatlin (2) - 1 freq ootlin (2) - 12 freq wettin (2) - 2 freq setttlin (2) - 1 freq attain (2) - 2 freq nettin (2) - 6 freq ettil (2) - 22 freq gettin (2) - 1172 freq tittlin (2) - 1 freq mettin (2) - 2 freq |
ettlin (0) - 315 freq ettlan (1) - 1 freq ettilin (1) - 1 freq ettin (2) - 13 freq nettlin (2) - 1 freq ettling (2) - 2 freq kettlin (2) - 3 freq ettltin (2) - 1 freq rettlin (2) - 2 freq ettlin' (2) - 1 freq fettlin (2) - 6 freq settlin (2) - 38 freq ettlins (2) - 26 freq ettlit (2) - 3 freq beettlin (3) - 1 freq bottlin (3) - 2 freq kittlin (3) - 59 freq rattlin (3) - 52 freq ettle' (3) - 1 freq butlin (3) - 2 freq kitlin (3) - 4 freq setlin (3) - 1 freq ettle (3) - 190 freq futtlin (3) - 1 freq ettld (3) - 1 freq |
SoundEx code - E345 ettlin - 315 freq ettling - 2 freq ettlins - 26 freq ettlin-like - 1 freq ettlin's - 1 freq ettlin' - 1 freq ettilin - 1 freq ettlan - 1 freq eytalian - 1 freq ethwilliams - 1 freq |
MetaPhone code - ETLN ettlin - 315 freq ettlin' - 1 freq ettilin - 1 freq ettlan - 1 freq eytalian - 1 freq |
ETTLIN |
Time to execute Levenshtein function - 0.221102 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.487335 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.029843 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.076440 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.000887 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. |