| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winsome (0) - 5 freq wilsome (1) - 1 freq dinsome (1) - 3 freq hansome (2) - 3 freq wulsome (2) - 2 freq winsnae (2) - 1 freq wilcome (2) - 4 freq insole (2) - 1 freq waesome (2) - 19 freq income (2) - 16 freq ransome (2) - 1 freq winqm (3) - 1 freq smitsome (3) - 1 freq lonesome (3) - 9 freq awsome (3) - 2 freq console (3) - 5 freq bisoms (3) - 1 freq noisome (3) - 1 freq windle (3) - 1 freq winryfe (3) - 1 freq insece (3) - 1 freq windae (3) - 564 freq wullsome (3) - 1 freq wilcomed (3) - 3 freq twasome (3) - 1 freq |
winsome (0) - 5 freq dinsome (2) - 3 freq wilsome (2) - 1 freq ransome (3) - 1 freq waesome (3) - 19 freq wunsum (3) - 1 freq hansome (3) - 3 freq winsnae (3) - 1 freq wulsome (3) - 2 freq winos (4) - 2 freq hansom (4) - 3 freq haunsome (4) - 2 freq ransom (4) - 6 freq winsy (4) - 1 freq wilsum (4) - 1 freq consume (4) - 3 freq lanesome (4) - 29 freq wansce (4) - 1 freq wins (4) - 78 freq noisome (4) - 1 freq winqm (4) - 1 freq income (4) - 16 freq insole (4) - 1 freq wilcome (4) - 4 freq awsome (4) - 2 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 |
WINSOME |
| Time to execute Levenshtein function - 0.306038 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.406955 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.027616 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.038133 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.000859 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. |