| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lowdent (0) - 1 freq lowsent (1) - 2 freq lowdens (1) - 4 freq lowden (1) - 12 freq lozent (2) - 1 freq lowsint (2) - 1 freq gowdens (2) - 1 freq browdent (2) - 13 freq lowest (2) - 10 freq lowert (2) - 1 freq gowden (2) - 235 freq lowen (2) - 2 freq powdert (2) - 2 freq loudens (2) - 1 freq lowsen (2) - 2 freq gowpent (2) - 1 freq loudest (2) - 9 freq cowden (2) - 7 freq lowdin (2) - 1 freq ladent (2) - 1 freq rodent (2) - 4 freq loodest (2) - 3 freq howest (3) - 1 freq howbeit (3) - 2 freq hodden (3) - 8 freq |
lowdent (0) - 1 freq lowden (2) - 12 freq lowdens (2) - 4 freq lowsent (2) - 2 freq ladent (3) - 1 freq lowsint (3) - 1 freq lowdin (3) - 1 freq gowpent (4) - 1 freq cowden (4) - 7 freq loudest (4) - 9 freq loodest (4) - 3 freq lowdoun (4) - 1 freq lowsen (4) - 2 freq rodent (4) - 4 freq wident (4) - 2 freq browdent (4) - 13 freq lozent (4) - 1 freq gowdens (4) - 1 freq lowest (4) - 10 freq loudens (4) - 1 freq lowert (4) - 1 freq lowen (4) - 2 freq powdert (4) - 2 freq gowden (4) - 235 freq lowmond (5) - 3 freq |
SoundEx code - L353 ladent - 1 freq lood-mooth - 1 freq leitmotif - 1 freq lowdent - 1 freq latinate - 21 freq latinity - 2 freq latin-derived - 1 freq lethenty - 1 freq laudando - 1 freq |
MetaPhone code - LTNT ladent - 1 freq lowdent - 1 freq latinate - 21 freq latinity - 2 freq laudando - 1 freq |
LOWDENT |
| Time to execute Levenshtein function - 0.233410 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.513990 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.028540 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.045640 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.000854 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. |