| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| diddlin (0) - 2 freq piddlin (1) - 2 freq middlin (1) - 10 freq hiddlin (1) - 4 freq fiddlin (1) - 5 freq riddlin (1) - 1 freq skiddlin (2) - 2 freq dinnlin (2) - 2 freq daddin (2) - 1 freq biddin (2) - 30 freq diallin (2) - 4 freq diddly (2) - 1 freq cuddlin (2) - 4 freq middling (2) - 2 freq coddlin (2) - 1 freq dawdlin (2) - 2 freq doodlin (2) - 2 freq didderin (2) - 1 freq middlin' (2) - 2 freq kiddin (2) - 70 freq dirdin (2) - 10 freq dwindlin (2) - 1 freq meddlin (2) - 5 freq disdain (2) - 10 freq hiddlins (2) - 1 freq |
diddlin (0) - 2 freq riddlin (2) - 1 freq hiddlin (2) - 4 freq fiddlin (2) - 5 freq middlin (2) - 10 freq piddlin (2) - 2 freq meddlin (3) - 5 freq guddlin (3) - 11 freq didderin (3) - 1 freq peddlin (3) - 6 freq hoddlin (3) - 1 freq waddlin (3) - 2 freq doodlin (3) - 2 freq paddlin (3) - 5 freq toddlin (3) - 2 freq coddlin (3) - 1 freq puddlin (3) - 1 freq diddle (3) - 14 freq daddin (3) - 1 freq paiddlin (3) - 4 freq dawdlin (3) - 2 freq diddly (3) - 1 freq cuddlin (3) - 4 freq diddled (3) - 2 freq deddin (3) - 1 freq |
SoundEx code - D345 dawdlin - 2 freq diddlin - 2 freq daddy-longlegs - 1 freq daddylanglegs - 7 freq doodlin - 2 freq deidline - 1 freq deadline - 4 freq deadline's - 1 freq dodeallen - 6 freq |
MetaPhone code - TTLN dawdlin - 2 freq toddlin - 2 freq diddlin - 2 freq tittlin - 1 freq doodlin - 2 freq tideline - 1 freq deidline - 1 freq deadline - 4 freq dodeallen - 6 freq |
DIDDLIN |
| Time to execute Levenshtein function - 0.687027 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.899067 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.027306 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.097467 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.000980 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. |