| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winkels (0) - 1 freq winkers (1) - 1 freq wirkers (2) - 20 freq lintels (2) - 2 freq tinkelt (2) - 1 freq tinkers (2) - 4 freq wiskers (2) - 1 freq wankers (2) - 5 freq wirsels (2) - 80 freq winces (2) - 3 freq winked (2) - 12 freq ainsels (2) - 1 freq winners (2) - 30 freq wickers (2) - 1 freq winks (2) - 14 freq winless (2) - 1 freq winters (2) - 21 freq winders (2) - 3 freq minkers (2) - 3 freq rankels (2) - 1 freq windeas (2) - 1 freq wikkers (2) - 1 freq incels (2) - 1 freq jinkers (2) - 1 freq windes (2) - 1 freq |
winkels (0) - 1 freq winkers (2) - 1 freq winks (3) - 14 freq wankers (3) - 5 freq rankels (3) - 1 freq wonka's (4) - 24 freq ingels (4) - 2 freq wingers (4) - 1 freq wines (4) - 8 freq windes (4) - 1 freq wrinkles (4) - 4 freq wine's (4) - 2 freq wonkas (4) - 2 freq winkled (4) - 1 freq runkils (4) - 1 freq onkils (4) - 1 freq wanks (4) - 1 freq fankils (4) - 1 freq incels (4) - 1 freq rinkles (4) - 1 freq winkler (4) - 1 freq jinkers (4) - 1 freq wirsels (4) - 80 freq winces (4) - 3 freq wikkers (4) - 1 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 - WNKLS winkels - 1 freq |
WINKELS |
| Time to execute Levenshtein function - 0.254767 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.399219 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.028974 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.038176 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.000919 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. |