| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ettilin (0) - 1 freq ettlin (1) - 315 freq ettltin (2) - 1 freq rettlin (2) - 2 freq ettils (2) - 14 freq emailin (2) - 1 freq catilin (2) - 1 freq ettlan (2) - 1 freq ettling (2) - 2 freq kettlin (2) - 3 freq eftimin (2) - 1 freq setttlin (2) - 1 freq ettlit (2) - 3 freq ettin (2) - 13 freq settlin (2) - 38 freq fettlin (2) - 6 freq ettil (2) - 22 freq etterin (2) - 1 freq ettlins (2) - 26 freq enticin (2) - 1 freq nettlin (2) - 1 freq toilin (2) - 2 freq ettilt (2) - 25 freq tailin (2) - 1 freq ettlin' (2) - 1 freq |
ettilin (0) - 1 freq ettlin (1) - 315 freq ettlan (2) - 1 freq etterin (3) - 1 freq ettil (3) - 22 freq fettlin (3) - 6 freq settlin (3) - 38 freq ettlins (3) - 26 freq tailin (3) - 1 freq toilin (3) - 2 freq nettlin (3) - 1 freq ettin (3) - 13 freq ettilt (3) - 25 freq ettlin' (3) - 1 freq ettlit (3) - 3 freq ettils (3) - 14 freq rettlin (3) - 2 freq catilin (3) - 1 freq ettling (3) - 2 freq ettltin (3) - 1 freq kettlin (3) - 3 freq ettle' (4) - 1 freq beettlin (4) - 1 freq yettleen (4) - 1 freq kittlin (4) - 59 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 |
ETTILIN |
| Time to execute Levenshtein function - 0.207128 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.475409 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.036695 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.041279 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.001184 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. |