Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
donated (0) - 2 freq doated (1) - 1 freq donate (1) - 9 freq donald (2) - 193 freq doubted (2) - 7 freq debated (2) - 3 freq coated (2) - 4 freq dented (2) - 2 freq dotted (2) - 11 freq douted (2) - 1 freq doatted (2) - 1 freq donard (2) - 1 freq inated (2) - 1 freq located (2) - 5 freq doted (2) - 1 freq dated (2) - 6 freq dilated (2) - 1 freq dooted (2) - 4 freq donati (2) - 3 freq donatin (2) - 1 freq doited (2) - 2 freq doobted (2) - 1 freq dominated (2) - 3 freq donned (2) - 2 freq dunted (2) - 6 freq |
donated (0) - 2 freq doated (2) - 1 freq dunted (2) - 6 freq dented (2) - 2 freq donate (2) - 9 freq dooted (3) - 4 freq dilated (3) - 1 freq dated (3) - 6 freq donati (3) - 3 freq doited (3) - 2 freq doobted (3) - 1 freq doted (3) - 1 freq dominated (3) - 3 freq donatin (3) - 1 freq donned (3) - 2 freq dotted (3) - 11 freq debated (3) - 3 freq doubted (3) - 7 freq douted (3) - 1 freq donald (3) - 193 freq doatted (3) - 1 freq inated (3) - 1 freq donard (3) - 1 freq dauted (4) - 1 freq ignited (4) - 1 freq |
SoundEx code - D533 duntit - 26 freq dintit - 3 freq denotit - 1 freq day-in-day-oot - 1 freq dented - 2 freq dauntit - 3 freq duntet - 1 freq dunteth - 1 freq donated - 2 freq dunted - 6 freq dentit - 3 freq denotational - 1 freq denotations - 2 freq doun-hauddit - 1 freq demotit - 1 freq dentition - 1 freq dontdoit - 3 freq donateaticket - 1 freq dnddad - 1 freq |
MetaPhone code - TNTT tentit - 8 freq duntit - 26 freq dintit - 3 freq tended - 16 freq tainted - 3 freq tendit - 19 freq tented - 1 freq denotit - 1 freq day-in-day-oot - 1 freq tauntit - 2 freq dented - 2 freq dauntit - 3 freq duntet - 1 freq tintit - 3 freq taintit - 1 freq tinted - 2 freq donated - 2 freq dunted - 6 freq 'tended - 1 freq dentit - 3 freq tinted - 1 freq dnddad - 1 freq |
DONATED |
Time to execute Levenshtein function - 0.217685 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.390321 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.029379 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.038438 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.000929 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. |