| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| windae-lozens (0) - 1 freq windae-panes (4) - 2 freq windae-sole (4) - 3 freq windae-seat (5) - 1 freq windae-frames (5) - 1 freq windaesole (5) - 1 freq windae-sills (5) - 2 freq windae-panesin (6) - 1 freq wind-riven (6) - 1 freq windaes (6) - 158 freq handle-less (6) - 1 freq windae-sill (6) - 2 freq indwellers (6) - 2 freq wildflooers (6) - 6 freq windin-sheets (6) - 1 freq wind-bourne (6) - 1 freq wide-kent (6) - 1 freq windae's (6) - 5 freq daeleens (6) - 1 freq wine-skins (6) - 1 freq wide-os (6) - 1 freq windae- (6) - 1 freq wind-moan (6) - 1 freq wildflowers (6) - 1 freq wild-flowers (6) - 1 freq |
windae-lozens (0) - 1 freq windae-panes (6) - 2 freq windae-sills (8) - 2 freq windae-frames (8) - 1 freq windae-sole (8) - 3 freq wind-moan (9) - 1 freq wine-skins (9) - 1 freq wind-bourne (9) - 1 freq windolene (9) - 2 freq wind-riven (9) - 1 freq windaesole (9) - 1 freq windae-seat (9) - 1 freq windae-panesin (9) - 1 freq wonderlaand (10) - 4 freq windywilson (10) - 4 freq windoes (10) - 1 freq dandelions (10) - 1 freq vindaloos (10) - 1 freq in-lyins (10) - 1 freq wunderlaant (10) - 4 freq wanderans (10) - 1 freq underlines (10) - 1 freq windlestraes (10) - 1 freq wonderland (10) - 8 freq wyndless (10) - 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 - WNTLSNS windae-lozens - 1 freq |
WINDAE-LOZENS |
| Time to execute Levenshtein function - 0.327462 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.616611 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.035266 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.047215 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.001111 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. |