| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dwindling (0) - 1 freq dwindlin (1) - 1 freq dwindlin' (1) - 1 freq winding (2) - 2 freq dwinnlin (2) - 2 freq dwinlin (2) - 2 freq dwelling (3) - 2 freq handling (3) - 1 freq idling (3) - 1 freq dinnlin (3) - 2 freq endling (3) - 1 freq swinglin (3) - 1 freq skinkling (3) - 1 freq dinging (3) - 1 freq windrin (3) - 4 freq twiddlin (3) - 2 freq finding (3) - 16 freq dining (3) - 6 freq middling (3) - 2 freq dribbling (3) - 1 freq 'minding (3) - 3 freq 'wining (3) - 1 freq swinging (3) - 3 freq twinklin (3) - 15 freq swiggling (3) - 1 freq |
dwindling (0) - 1 freq dwindlin' (2) - 1 freq dwindlin (2) - 1 freq dwinlin (4) - 2 freq dwinnlin (4) - 2 freq winding (4) - 2 freq bundling (5) - 1 freq windering (5) - 1 freq haundling (5) - 2 freq endling (5) - 1 freq waddling (5) - 1 freq handling (5) - 1 freq dwelling (5) - 2 freq swinklin (6) - 1 freq sidling (6) - 1 freq kindlin (6) - 5 freq winning (6) - 14 freq tinkling (6) - 1 freq deidline (6) - 1 freq drinking (6) - 18 freq twirling (6) - 1 freq willing (6) - 10 freq singling (6) - 1 freq grinding (6) - 2 freq dundering (6) - 2 freq |
SoundEx code - D534 dandelion - 4 freq daintily - 2 freq dandelions - 1 freq dentals - 1 freq dental - 7 freq 'dental - 1 freq dentie-like - 1 freq dentie-lik - 1 freq dwindlin - 1 freq €˜dandelion - 1 freq dently - 1 freq dwindlin' - 1 freq dentily - 1 freq dwindling - 1 freq deanmadalba - 1 freq |
MetaPhone code - TWNTLNK dwindling - 1 freq |
DWINDLING |
| Time to execute Levenshtein function - 0.212106 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.420578 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.027479 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.037226 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.000893 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. |