| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dentition (0) - 1 freq petition (2) - 11 freq rendition (2) - 5 freq deflation (3) - 1 freq ventilation (3) - 2 freq defineition (3) - 2 freq sensation (3) - 22 freq contrition (3) - 1 freq entities (3) - 15 freq fantation (3) - 2 freq desertion (3) - 2 freq dejection (3) - 2 freq centurion (3) - 6 freq identities (3) - 17 freq seetiation (3) - 8 freq dictation (3) - 1 freq renditon (3) - 1 freq deletion (3) - 1 freq edeition (3) - 13 freq depiction (3) - 3 freq destitution (3) - 2 freq peteition (3) - 1 freq seitiation (3) - 3 freq dentit (3) - 3 freq partition (3) - 4 freq |
dentition (0) - 1 freq identities (4) - 17 freq dentit (4) - 3 freq dictation (4) - 1 freq denotations (4) - 2 freq identitie (4) - 17 freq indentation (4) - 1 freq fantation (4) - 2 freq intuition (4) - 6 freq petition (4) - 11 freq rendition (4) - 5 freq donation (4) - 12 freq dictatin (5) - 2 freq dottin (5) - 1 freq ignition (5) - 2 freq naition (5) - 1 freq densities (5) - 1 freq dennison (5) - 10 freq denotit (5) - 1 freq gestation (5) - 1 freq rendeition (5) - 1 freq mention (5) - 144 freq detention (5) - 9 freq identity (5) - 162 freq duntin (5) - 24 freq |
SoundEx code - D533 duntit - 25 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 - TNTXN dentition - 1 freq |
DENTITION |
| Time to execute Levenshtein function - 0.241790 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.520392 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.032180 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.071473 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.000849 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. |