| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wunsum (0) - 1 freq wilsum (2) - 1 freq wunnur (2) - 1 freq ugsum (2) - 2 freq wuns (2) - 3 freq sursum (2) - 1 freq bunkum (2) - 1 freq lusum (2) - 1 freq unum (2) - 1 freq wnzum (2) - 1 freq wunup (2) - 1 freq twasum (3) - 18 freq windup (3) - 1 freq weltum (3) - 1 freq duojum (3) - 1 freq pursue (3) - 9 freq winsy (3) - 1 freq outcum (3) - 1 freq wanun (3) - 1 freq oncum (3) - 50 freq census (3) - 101 freq consume (3) - 3 freq untul (3) - 1 freq wunner (3) - 282 freq gruesum (3) - 4 freq |
wunsum (0) - 1 freq wilsum (3) - 1 freq wnzum (3) - 1 freq wuns (3) - 3 freq winsome (3) - 5 freq lanesum (4) - 5 freq wanst (4) - 32 freq consume (4) - 3 freq ransom (4) - 6 freq wansce (4) - 1 freq winqm (4) - 1 freq wans' (4) - 1 freq wansie (4) - 1 freq nsm (4) - 1 freq wins (4) - 78 freq wuins (4) - 1 freq wulsome (4) - 2 freq bunkum (4) - 1 freq lusum (4) - 1 freq sursum (4) - 1 freq ugsum (4) - 2 freq wunnur (4) - 1 freq winsy (4) - 1 freq unum (4) - 1 freq wunup (4) - 1 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 - WNSM winsome - 5 freq wunsum - 1 freq |
WUNSUM |
| Time to execute Levenshtein function - 0.271546 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.520545 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.031600 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.045468 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.001253 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. |