| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dootsome (0) - 1 freq doutsome (1) - 1 freq doolsome (1) - 4 freq loosome (2) - 2 freq dooncome (2) - 1 freq ootcome (2) - 48 freq doulsome (2) - 3 freq dootsum (2) - 4 freq foursome (3) - 1 freq lowesome (3) - 1 freq smitsome (3) - 1 freq dulesome (3) - 18 freq dowiesome (3) - 2 freq honksome (3) - 1 freq lonesome (3) - 9 freq doutsum (3) - 1 freq doots (3) - 35 freq ootcomes (3) - 9 freq shortsome (3) - 2 freq ootside (3) - 635 freq noisome (3) - 1 freq douncome (3) - 2 freq osome (3) - 1 freq lousome (3) - 3 freq ootcom (3) - 1 freq |
dootsome (0) - 1 freq doutsome (1) - 1 freq dootsum (2) - 4 freq doolsome (2) - 4 freq doulsome (3) - 3 freq doutsum (3) - 1 freq ootcome (4) - 48 freq loosome (4) - 2 freq dinsome (4) - 3 freq doots (4) - 35 freq dowiesome (4) - 2 freq dulesome (4) - 18 freq dooncome (4) - 1 freq ootsize (5) - 1 freq doontime (5) - 1 freq doonside (5) - 4 freq bosome (5) - 1 freq fousome (5) - 17 freq outcome (5) - 4 freq derksome (5) - 2 freq loathsome (5) - 2 freq doonsize (5) - 1 freq bowsome (5) - 1 freq douts (5) - 18 freq dots (5) - 8 freq |
SoundEx code - D325 dodgson - 9 freq dudgeon - 1 freq dootsumness - 1 freq detachment - 2 freq detachments - 1 freq dodging - 2 freq dodgin' - 1 freq dodjin - 1 freq dutchmen - 1 freq daith-sentence - 1 freq doutsum - 1 freq deid-saumon - 1 freq dootsome - 1 freq deid-centre - 1 freq dodgan - 1 freq dowdoswang - 1 freq deid-sang - 1 freq deith-knell - 1 freq deid-knowes - 1 freq doutsomelike - 1 freq doutsome-like - 1 freq doutsome - 1 freq dootsum - 4 freq dutchman - 2 freq dodgin - 4 freq detachin - 1 freq didsna - 1 freq deadkings - 1 freq datsun - 3 freq dodgingtherain - 1 freq |
MetaPhone code - TTSM doutsum - 1 freq dootsome - 1 freq doutsome - 1 freq dootsum - 4 freq tedisome - 1 freq |
DOOTSOME |
| Time to execute Levenshtein function - 0.205440 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.394089 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.028721 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.046092 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.001184 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. |