| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winqm (0) - 1 freq winos (2) - 2 freq inqa (2) - 1 freq wints (2) - 49 freq wins (2) - 78 freq win's (2) - 8 freq windy (2) - 36 freq win (2) - 980 freq winna (2) - 384 freq winky (2) - 7 freq winkt (2) - 2 freq winsy (2) - 1 freq wincy (2) - 2 freq winda (2) - 47 freq windi (2) - 2 freq winks (2) - 14 freq wi'm (2) - 3 freq wince (2) - 5 freq cinq (2) - 1 freq winds (2) - 61 freq linjm (2) - 1 freq wings (2) - 131 freq winae (2) - 2 freq winfa (2) - 1 freq winch (2) - 6 freq |
winqm (0) - 1 freq wined (4) - 4 freq wino (4) - 2 freq winnd (4) - 3 freq wines (4) - 8 freq wine' (4) - 1 freq winn (4) - 1 freq wink (4) - 117 freq wina (4) - 1 freq winze (4) - 1 freq win- (4) - 2 freq wini (4) - 2 freq wint (4) - 629 freq winny (4) - 7 freq wunsum (4) - 1 freq winsome (4) - 5 freq wnzum (4) - 1 freq wing (4) - 38 freq wind' (4) - 1 freq win' (4) - 7 freq wim (4) - 2 freq wind (4) - 482 freq wine (4) - 272 freq wirm (4) - 17 freq win't (4) - 4 freq |
SoundEx code - W525 whingin - 4 freq winkin - 16 freq winsome - 5 freq winchin - 16 freq wenchin - 1 freq wanchancy - 18 freq wankin - 4 freq wheengin - 3 freq wanchauncie - 2 freq wincin - 1 freq whingein - 5 freq wink-wink - 1 freq wineskins - 3 freq wunsum - 1 freq wineskïns - 1 freq wine-skins - 1 freq weengan - 1 freq wameskin - 1 freq wanchance - 1 freq wanchancie - 4 freq winchin' - 1 freq whinkin - 1 freq winsnae - 1 freq wanchany - 1 freq winging - 1 freq whinging - 1 freq winqm - 1 freq winchman - 1 freq wnzum - 1 freq wnusmqrptt - 1 freq wnquanjar - 1 freq |
MetaPhone code - WNKM winqm - 1 freq |
WINQM |
| Time to execute Levenshtein function - 0.291156 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.378802 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.029638 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.038067 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.001071 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. |