| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winmill (0) - 1 freq windmill (1) - 2 freq linmill (1) - 3 freq windmills (2) - 2 freq wingilt (2) - 1 freq win'll (2) - 1 freq wine'll (2) - 1 freq lintmill (2) - 3 freq intill (2) - 125 freq wincin (3) - 1 freq intilla (3) - 1 freq wintir (3) - 8 freq wingies (3) - 1 freq windie (3) - 4 freq ashmill (3) - 3 freq winrin (3) - 2 freq wummily (3) - 2 freq ainvils (3) - 1 freq winniks (3) - 2 freq yin'll (3) - 3 freq mcneill (3) - 5 freq wintit (3) - 111 freq twin'll (3) - 1 freq windis (3) - 2 freq pincil (3) - 22 freq |
winmill (0) - 1 freq linmill (2) - 3 freq windmill (2) - 2 freq wine'll (3) - 1 freq win'll (3) - 1 freq lintmill (4) - 3 freq intill (4) - 125 freq wingilt (4) - 1 freq windmills (4) - 2 freq w-will (5) - 1 freq mill (5) - 82 freq pinball (5) - 1 freq oneill (5) - 2 freq windyhill (5) - 1 freq tinsell (5) - 1 freq wuill (5) - 1 freq withall (5) - 1 freq candill (5) - 1 freq winkels (5) - 1 freq intull (5) - 5 freq wimble (5) - 1 freq whill (5) - 13 freq wi'll (5) - 33 freq wummile (5) - 1 freq sawmill (5) - 9 freq |
SoundEx code - W540 whummlle - 1 freq wean'll - 3 freq whummle - 7 freq wainly - 1 freq whammle - 2 freq winmill - 1 freq wine'll - 1 freq wheen'll - 1 freq win'll - 1 freq whummil - 1 freq wummile - 1 freq wammle - 2 freq wummle - 1 freq wummily - 2 freq wan-nil - 1 freq wenl - 1 freq weenell - 8 freq wnl - 1 freq |
MetaPhone code - WNML winmill - 1 freq |
WINMILL |
| Time to execute Levenshtein function - 0.221129 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.346765 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.027827 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.040034 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.000975 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. |