| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wieltly (0) - 1 freq wildly (2) - 7 freq willy (2) - 12 freq wilely (2) - 1 freq wielt (2) - 3 freq welly (2) - 5 freq filly (3) - 8 freq kiltle (3) - 1 freq hiely (3) - 1 freq skelly (3) - 10 freq sightly (3) - 1 freq deftly (3) - 1 freq qweeatly (3) - 1 freq nightly (3) - 3 freq wely (3) - 1 freq wrestle (3) - 3 freq skeetly (3) - 1 freq will' (3) - 2 freq wilton (3) - 1 freq quietly (3) - 61 freq fently (3) - 1 freq wisely (3) - 8 freq weell (3) - 1 freq adeptly (3) - 2 freq bienly (3) - 7 freq |
wieltly (0) - 1 freq wielt (3) - 3 freq wilely (3) - 1 freq welly (3) - 5 freq willy (3) - 12 freq wildly (3) - 7 freq wilt (4) - 3 freq will (4) - 3251 freq woolly (4) - 9 freq weell (4) - 1 freq wiltit (4) - 1 freq well (4) - 1394 freq welt (4) - 1 freq willile (4) - 1 freq wally (4) - 47 freq walthy (4) - 10 freq welts (4) - 1 freq willl (4) - 1 freq waell (4) - 1 freq weltum (4) - 1 freq laetly (4) - 2 freq wilts (4) - 1 freq wetl (4) - 1 freq wully (4) - 127 freq kiltle (4) - 1 freq |
SoundEx code - W434 wildly - 7 freq wieltly - 1 freq 'wildlaw' - 1 freq wildlife - 15 freq weel-tellt - 2 freq wildlaw - 13 freq €˜wildlaw - 4 freq wildlawyers - 1 freq wild-leukin - 1 freq wildlifephotography - 4 freq wildlifeni - 2 freq wildlifemag - 1 freq wiwildlife - 1 freq |
MetaPhone code - WLTL wildly - 7 freq wieltly - 1 freq 'wildlaw' - 1 freq wildlaw - 13 freq €˜wildlaw - 4 freq |
WIELTLY |
| Time to execute Levenshtein function - 0.192597 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.381103 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.027896 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.038157 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.000836 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. |