| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drearisome (0) - 1 freq wearisome (2) - 10 freq derksome (3) - 2 freq dreidsome (3) - 1 freq cheerisome (3) - 2 freq fearsome (3) - 28 freq drearie (3) - 1 freq deavesome (3) - 1 freq hertsome (4) - 10 freq worrisome (4) - 1 freq realise (4) - 119 freq dreame (4) - 6 freq realism (4) - 3 freq dreamtime (4) - 1 freq reprise (4) - 1 freq dearie (4) - 37 freq brawsome (4) - 8 freq daurksome (4) - 1 freq leasome (4) - 1 freq oorisome (4) - 1 freq scarsome (4) - 1 freq ransome (4) - 1 freq tedisome (4) - 1 freq treatise (4) - 2 freq iresome (4) - 1 freq |
drearisome (0) - 1 freq dreidsome (4) - 1 freq derksome (4) - 2 freq wearisome (4) - 10 freq daurksome (5) - 1 freq worrisome (5) - 1 freq deavesome (5) - 1 freq fearsome (5) - 28 freq cheerisome (5) - 2 freq drearie (5) - 1 freq feeriesome (6) - 1 freq drearily (6) - 1 freq faersome (6) - 5 freq treesome (6) - 1 freq draars (6) - 37 freq careerism (6) - 1 freq darksum (6) - 1 freq iresome (6) - 1 freq virrsome (6) - 6 freq worrysome (6) - 1 freq drars (6) - 2 freq ransome (6) - 1 freq dreamtime (6) - 1 freq realism (6) - 3 freq dreame (6) - 6 freq |
SoundEx code - D662 draaers - 3 freq drawers - 52 freq dreerieshire - 4 freq drawr's - 1 freq draars - 37 freq drearisome - 1 freq dray-horse - 2 freq drars - 2 freq draawers - 1 freq drawers - 2 freq draw'ers - 1 freq drawers - 1 freq draars - 1 freq dra'ers - 2 freq draaars - 1 freq drawrs - 1 freq |
MetaPhone code - TRRSM terrorism - 3 freq drearisome - 1 freq |
DREARISOME |
| Time to execute Levenshtein function - 0.255348 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.402274 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.029521 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.038225 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.000977 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. |