| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dulesome (0) - 18 freq dulesum (2) - 1 freq fulsome (2) - 1 freq doulsome (2) - 3 freq luvesome (2) - 1 freq dulesomely (2) - 1 freq luesome (2) - 2 freq wulsome (2) - 2 freq wullsome (2) - 1 freq halesome (2) - 9 freq lowesome (3) - 1 freq leasome (3) - 1 freq fusome (3) - 1 freq aesome (3) - 7 freq awesome (3) - 35 freq doolsome (3) - 4 freq derksome (3) - 2 freq wilsome (3) - 1 freq flegsome (3) - 8 freq dulse (3) - 9 freq dinsome (3) - 3 freq lonesome (3) - 9 freq dootsome (3) - 1 freq loesome (3) - 7 freq tiresome (3) - 6 freq |
dulesome (0) - 18 freq dulesum (2) - 1 freq doulsome (2) - 3 freq doolsome (3) - 4 freq halesome (3) - 9 freq wulsome (3) - 2 freq dulesomely (3) - 1 freq luesome (3) - 2 freq fulsome (3) - 1 freq loesome (4) - 7 freq dootsome (4) - 1 freq deavesome (4) - 1 freq doutsome (4) - 1 freq leesome (4) - 9 freq dinsome (4) - 3 freq dowiesome (4) - 2 freq fleysome (4) - 6 freq dulse (4) - 9 freq wullsome (4) - 1 freq leasome (4) - 1 freq wilsome (4) - 1 freq luvesome (4) - 1 freq dualism (4) - 1 freq toilsome (5) - 1 freq iresome (5) - 1 freq |
SoundEx code - D425 dayligaun - 1 freq dayligaun's - 1 freq dulesome - 18 freq delusions - 3 freq diligently - 5 freq dailygan - 9 freq dailigan - 1 freq delusion - 3 freq dailygaun - 20 freq dayligan - 2 freq doolsome - 4 freq dulesomely - 1 freq dollaghan - 1 freq dualism - 1 freq doulsome - 3 freq dilgent - 1 freq delusional - 4 freq dulesum - 1 freq dailygan - 1 freq diligence - 1 freq dulwichhamletfc - 2 freq dulwichhamfc - 1 freq |
MetaPhone code - TLSM dulesome - 18 freq toilsome - 1 freq doolsome - 4 freq dualism - 1 freq doulsome - 3 freq dulesum - 1 freq |
DULESOME |
| Time to execute Levenshtein function - 0.196484 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.368523 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.028746 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.037449 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.004077 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. |