| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winkler (0) - 1 freq tinkler (1) - 2 freq winkled (1) - 1 freq tinkled (2) - 4 freq winked (2) - 12 freq sinker (2) - 1 freq tinker (2) - 21 freq tikkler (2) - 2 freq wanker (2) - 17 freq windier (2) - 1 freq wrinkle (2) - 5 freq linker (2) - 1 freq wirker (2) - 5 freq binkled (2) - 1 freq wrinkled (2) - 11 freq wicker (2) - 2 freq rinkle (2) - 2 freq twinkled (2) - 3 freq jinker (2) - 2 freq minker (2) - 2 freq winner (2) - 143 freq twinkle- (2) - 2 freq windle (2) - 1 freq winkers (2) - 1 freq tinklers (2) - 2 freq |
winkler (0) - 1 freq winkled (2) - 1 freq tinkler (2) - 2 freq wankier (3) - 1 freq wanker (3) - 17 freq wisker (4) - 1 freq winkie (4) - 3 freq wiker (4) - 1 freq winder (4) - 112 freq wikker (4) - 1 freq winkers (4) - 1 freq tinklers (4) - 2 freq twinkle (4) - 27 freq wrinkles (4) - 4 freq rinkles (4) - 1 freq tinkle (4) - 4 freq winkels (4) - 1 freq tickler (4) - 4 freq ainkle (4) - 1 freq winter (4) - 434 freq windle (4) - 1 freq wiler (4) - 1 freq winger (4) - 3 freq windier (4) - 1 freq wrinkle (4) - 5 freq |
SoundEx code - W524 winkle-picker's - 1 freq winkler - 1 freq wangled - 1 freq wan-o-clock - 1 freq wengle - 1 freq winkled - 1 freq winnock-soles - 1 freq wingilt - 1 freq weans'll - 1 freq waenglit - 1 freq winkelstrjitten - 1 freq winkels - 1 freq weensland - 1 freq wine-colourt - 1 freq |
MetaPhone code - WNKLR winkler - 1 freq |
WINKLER |
| Time to execute Levenshtein function - 0.257052 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.472107 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.028665 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.048134 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.000974 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. |