| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ettling (0) - 2 freq ettlin (1) - 314 freq settling (1) - 2 freq ettlins (1) - 23 freq ettlin' (1) - 1 freq ettlan (2) - 1 freq fettlin (2) - 6 freq eating (2) - 18 freq ettin (2) - 13 freq erling (2) - 1 freq rettlin (2) - 2 freq stiling (2) - 1 freq kittling (2) - 4 freq ettlin's (2) - 1 freq ettlit (2) - 3 freq getting (2) - 307 freq setting (2) - 14 freq bottling (2) - 2 freq kettlin (2) - 3 freq outling (2) - 2 freq settlin' (2) - 3 freq battling (2) - 1 freq endling (2) - 1 freq settlin (2) - 37 freq letting (2) - 14 freq |
ettling (0) - 2 freq ettlins (2) - 23 freq ettlin' (2) - 1 freq settling (2) - 2 freq ettlin (2) - 314 freq outling (3) - 2 freq bottling (3) - 2 freq battling (3) - 1 freq kittling (3) - 4 freq ettilin (3) - 1 freq stiling (3) - 1 freq ettlan (3) - 1 freq betting (4) - 2 freq stealing (4) - 3 freq toiling (4) - 2 freq uttering (4) - 1 freq ettltin (4) - 1 freq nettlin (4) - 1 freq tilling (4) - 1 freq atheling (4) - 4 freq telling (4) - 78 freq toting (4) - 1 freq letting (4) - 14 freq settlin (4) - 37 freq rettlin (4) - 2 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 - ETLNK ettling - 2 freq |
ETTLING |
| Time to execute Levenshtein function - 0.874342 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.756763 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.028805 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.038739 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.000761 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. |