| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dilutin (0) - 10 freq diluting (1) - 2 freq dilution (1) - 2 freq delytin (2) - 1 freq tiltin (2) - 6 freq disputin (2) - 8 freq deludin (2) - 1 freq salutin (2) - 1 freq dichtin (2) - 40 freq doutin (2) - 1 freq dautin (2) - 2 freq diluted (2) - 5 freq liltin (2) - 6 freq giltin (2) - 2 freq hiltit (3) - 1 freq ablution (3) - 2 freq flitin (3) - 1 freq dautie (3) - 5 freq spoutin (3) - 7 freq ailin (3) - 2 freq dilip (3) - 1 freq dwaumin (3) - 3 freq dillt (3) - 1 freq riotin (3) - 3 freq milin (3) - 2 freq |
dilutin (0) - 10 freq dilution (1) - 2 freq diluting (2) - 2 freq delytin (2) - 1 freq giltin (3) - 2 freq diluted (3) - 5 freq dolton (3) - 1 freq deletion (3) - 1 freq dautin (3) - 2 freq dalton (3) - 1 freq liltin (3) - 6 freq deludin (3) - 1 freq tiltin (3) - 6 freq doutin (3) - 1 freq salutin (3) - 1 freq editin (4) - 22 freq devotin (4) - 1 freq delusion (4) - 3 freq dellin (4) - 5 freq dertin (4) - 1 freq deistin (4) - 3 freq fluten (4) - 1 freq slatin (4) - 2 freq dillon (4) - 2 freq delting (4) - 2 freq |
SoundEx code - D435 dalton - 1 freq dilutin - 10 freq dilations - 1 freq delytin - 1 freq dilettanti - 2 freq dilettanti's - 1 freq dilution - 2 freq diluting - 2 freq deludin - 1 freq €œdilution - 1 freq deletion - 1 freq delting - 2 freq dilettantes - 1 freq dolton - 1 freq |
MetaPhone code - TLTN dalton - 1 freq tiltin - 6 freq dilutin - 10 freq teltna - 1 freq tiltan - 1 freq delytin - 1 freq tildin - 1 freq deludin - 1 freq dolton - 1 freq |
DILUTIN |
| Time to execute Levenshtein function - 0.193723 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.353854 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.027109 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.037262 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.000855 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. |