| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| duntet (0) - 1 freq dunted (1) - 6 freq dunteth (1) - 1 freq duntit (1) - 26 freq dunter (1) - 2 freq dunnet (1) - 1 freq hunter (2) - 48 freq puntee (2) - 1 freq dunts (2) - 23 freq dinnet (2) - 1 freq punnet (2) - 1 freq dunged (2) - 1 freq dundert (2) - 1 freq dauntit (2) - 3 freq huntit (2) - 29 freq punter (2) - 15 freq dented (2) - 2 freq dunnert (2) - 1 freq dusted (2) - 6 freq dunced (2) - 10 freq duster (2) - 12 freq hurtet (2) - 2 freq dulcet (2) - 3 freq hauntet (2) - 2 freq dentit (2) - 3 freq |
duntet (0) - 1 freq duntit (1) - 26 freq dintit (2) - 3 freq dauntit (2) - 3 freq dentit (2) - 3 freq dunnet (2) - 1 freq dunted (2) - 6 freq dunter (2) - 2 freq dunteth (2) - 1 freq pantet (3) - 1 freq unitet (3) - 3 freq daunten (3) - 2 freq countet (3) - 1 freq dunnett (3) - 6 freq duntn (3) - 1 freq luntit (3) - 3 freq dante (3) - 58 freq runtit (3) - 3 freq dustit (3) - 5 freq duntin (3) - 24 freq hintet (3) - 1 freq dantes (3) - 1 freq dunnit (3) - 1 freq dunt (3) - 92 freq muntit (3) - 3 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 |
DUNTET |
| Time to execute Levenshtein function - 0.206723 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.391718 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.051658 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.060692 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.001285 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. |