| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wildly (0) - 7 freq wilely (1) - 1 freq mildly (1) - 7 freq willy (1) - 12 freq wild (2) - 236 freq windy (2) - 35 freq wilny (2) - 2 freq wigly (2) - 1 freq diddly (2) - 1 freq boldly (2) - 8 freq silly (2) - 63 freq wilds (2) - 7 freq filly (2) - 8 freq killy (2) - 9 freq wily (2) - 6 freq widely (2) - 25 freq zilly (2) - 1 freq wisely (2) - 8 freq wardly (2) - 1 freq 'willy (2) - 1 freq warldly (2) - 4 freq wickly (2) - 2 freq willl (2) - 1 freq middly (2) - 3 freq wikkly (2) - 1 freq |
wildly (0) - 7 freq mildly (2) - 7 freq willy (2) - 12 freq wilely (2) - 1 freq wille (3) - 1 freq wully (3) - 127 freq wilde (3) - 3 freq windle (3) - 1 freq weirdly (3) - 5 freq will (3) - 3251 freq willl (3) - 1 freq wieltly (3) - 1 freq wildlaw (3) - 13 freq willa (3) - 3 freq waldy (3) - 1 freq welly (3) - 5 freq wardly (3) - 1 freq wilder (3) - 4 freq warldly (3) - 4 freq wilds (3) - 7 freq boldly (3) - 8 freq widely (3) - 25 freq wild (3) - 236 freq wally (3) - 47 freq wyll (4) - 2 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 |
WILDLY |
| Time to execute Levenshtein function - 0.167849 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.333418 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.032004 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.038874 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.000873 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. |