| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deletion (0) - 1 freq detention (2) - 10 freq desertion (2) - 2 freq deletit (2) - 3 freq deflation (2) - 1 freq delusion (2) - 3 freq devotion (2) - 21 freq election (2) - 87 freq dilution (2) - 2 freq dejection (2) - 2 freq selection (2) - 28 freq delegation (2) - 7 freq demption (2) - 1 freq elation (2) - 3 freq delytin (2) - 1 freq deflection (2) - 2 freq relation (2) - 18 freq edeetion (2) - 12 freq adulation (3) - 1 freq leetin (3) - 5 freq digestion (3) - 1 freq selections (3) - 1 freq deein (3) - 295 freq depletit (3) - 1 freq vexation (3) - 5 freq |
deletion (0) - 1 freq dilution (2) - 2 freq delytin (2) - 1 freq deletit (3) - 3 freq elation (3) - 3 freq edeetion (3) - 12 freq adulation (3) - 1 freq dalton (3) - 1 freq delegation (3) - 7 freq relation (3) - 18 freq deflation (3) - 1 freq devotion (3) - 21 freq dilutin (3) - 10 freq dolton (3) - 1 freq delusion (3) - 3 freq delegatin (4) - 1 freq addeetion (4) - 3 freq delitit (4) - 3 freq melton (4) - 1 freq deludin (4) - 1 freq deistin (4) - 3 freq devotin (4) - 1 freq desolation (4) - 2 freq deelin (4) - 1 freq dellin (4) - 5 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 - TLXN delusion - 3 freq tulchan - 1 freq dilution - 2 freq €œdilution - 1 freq deletion - 1 freq tulachan - 1 freq |
DELETION |
| Time to execute Levenshtein function - 0.403906 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 - 1.008159 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.106385 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.105817 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.000971 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. |