Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tilling (0) - 1 freq milling (1) - 1 freq telling (1) - 78 freq killing (1) - 7 freq pilling (1) - 1 freq filling (1) - 5 freq willing (1) - 10 freq tillin (1) - 3 freq aisling (2) - 1 freq rolling (2) - 7 freq tillies (2) - 1 freq tiring (2) - 1 freq filing (2) - 1 freq tellin (2) - 603 freq tinking (2) - 1 freq stifling (2) - 1 freq tinlin (2) - 1 freq tellin' (2) - 5 freq killin (2) - 61 freq sidling (2) - 1 freq falling (2) - 10 freq spilling (2) - 3 freq fillings (2) - 2 freq willin' (2) - 2 freq birling (2) - 1 freq |
tilling (0) - 1 freq telling (1) - 78 freq willing (2) - 10 freq filling (2) - 5 freq tillin (2) - 3 freq pilling (2) - 1 freq milling (2) - 1 freq killing (2) - 7 freq falling (3) - 10 freq polling (3) - 3 freq tellin' (3) - 5 freq trolling (3) - 3 freq calling (3) - 15 freq culling (3) - 2 freq selling (3) - 10 freq tellins (3) - 3 freq yelling (3) - 1 freq pulling (3) - 11 freq talking (3) - 54 freq tellin (3) - 603 freq rolling (3) - 7 freq toiling (3) - 2 freq milking (4) - 1 freq birlling (4) - 1 freq kipling (4) - 3 freq |
SoundEx code - T452 telling - 78 freq tellins - 3 freq talons - 5 freq tilling - 1 freq tholins - 1 freq tullynagardy - 3 freq tholance - 1 freq toiling - 2 freq thelonious - 8 freq tellingly - 1 freq tellemstevedave - 3 freq |
MetaPhone code - TLNK telling - 78 freq dealing - 8 freq tilling - 1 freq day-lang - 1 freq toiling - 2 freq dowling - 1 freq duolingo - 7 freq |
TILLING |
Time to execute Levenshtein function - 0.202241 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.401594 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.027918 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.040496 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.000856 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. |