| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| windolene (0) - 2 freq indolence (2) - 1 freq windee (3) - 3 freq insolent (3) - 1 freq windle (3) - 1 freq insolence (3) - 4 freq windoes (3) - 1 freq mandolin (4) - 14 freq insole (4) - 1 freq kindlers (4) - 1 freq sinshene (4) - 1 freq winded (4) - 2 freq kindlie (4) - 3 freq widened (4) - 11 freq hinderend (4) - 1 freq indylive (4) - 3 freq mindeen (4) - 5 freq wundflung (4) - 1 freq wind-reft (4) - 1 freq wind-bourne (4) - 1 freq widowed (4) - 1 freq jimnarlene (4) - 4 freq involve (4) - 16 freq windaed (4) - 1 freq wondenn (4) - 1 freq |
windolene (0) - 2 freq indolence (4) - 1 freq windle (4) - 1 freq winderin (5) - 17 freq winderan (5) - 2 freq dwindlin (5) - 1 freq landline (5) - 1 freq wndwne (5) - 1 freq windin (5) - 28 freq kindlin (5) - 5 freq widlan (5) - 2 freq kindleen (5) - 1 freq wondenn (5) - 1 freq wendola (5) - 1 freq windrin (5) - 4 freq windee (5) - 3 freq windoes (5) - 1 freq mandolin (5) - 14 freq linden (6) - 11 freq windering (6) - 1 freq windae (6) - 564 freq kindle (6) - 4 freq kindon (6) - 1 freq windies (6) - 2 freq windze (6) - 1 freq |
SoundEx code - W534 wyndless - 1 freq windlestrae - 2 freq windle - 1 freq windolene - 2 freq windlestraes - 1 freq windae-lozens - 1 freq windyhill - 1 freq windywilson - 4 freq wendola - 1 freq |
MetaPhone code - WNTLN windolene - 2 freq |
WINDOLENE |
| Time to execute Levenshtein function - 0.795673 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.923288 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.082360 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.095908 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.001084 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. |