| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ettlins (0) - 23 freq ettlin's (1) - 1 freq ettling (1) - 2 freq ettlin (1) - 314 freq ettlin' (1) - 1 freq etins (2) - 5 freq outlins (2) - 2 freq eastlins (2) - 1 freq ettlit (2) - 3 freq fettlin (2) - 6 freq settlin' (2) - 3 freq littlins (2) - 25 freq kittlins (2) - 5 freq nettlin (2) - 1 freq kettlin (2) - 3 freq ettlan (2) - 1 freq ettltin (2) - 1 freq emmlins (2) - 1 freq rettlin (2) - 2 freq settling (2) - 2 freq ettils (2) - 14 freq westlins (2) - 2 freq aestlins (2) - 2 freq ootlins (2) - 2 freq ettin (2) - 13 freq |
ettlins (0) - 23 freq ettlin' (2) - 1 freq ettlin (2) - 314 freq ettlin's (2) - 1 freq ettling (2) - 2 freq kittlins (3) - 5 freq kitlins (3) - 6 freq ootlins (3) - 2 freq littlins (3) - 25 freq ettlan (3) - 1 freq ettilin (3) - 1 freq ettles (3) - 79 freq butlins (3) - 1 freq outlins (3) - 2 freq eastlins (3) - 1 freq aestlins (3) - 2 freq ettils (3) - 14 freq etchins (4) - 1 freq settins (4) - 10 freq italians (4) - 7 freq tellins (4) - 3 freq talons (4) - 5 freq tholins (4) - 1 freq littleins (4) - 1 freq kettleens (4) - 3 freq |
SoundEx code - E345 ettlin - 314 freq ettling - 2 freq ettlins - 23 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 - ETLNS ettlins - 23 freq ettlin's - 1 freq |
ETTLINS |
| Time to execute Levenshtein function - 0.189015 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.358758 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.027226 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.036729 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.000836 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. |