| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dilations (0) - 1 freq dilution (2) - 2 freq donations (2) - 2 freq dalmations (2) - 3 freq relations (2) - 14 freq citations (2) - 3 freq rations (3) - 8 freq hilarious (3) - 18 freq edication (3) - 3 freq rotations (3) - 1 freq dillion (3) - 3 freq solutions (3) - 20 freq novations (3) - 1 freq billions (3) - 7 freq editions (3) - 4 freq deflation (3) - 1 freq dictation (3) - 1 freq duration (3) - 5 freq migrations (3) - 1 freq vibrations (3) - 4 freq delusions (3) - 3 freq diluting (3) - 2 freq devotions (3) - 4 freq directions (3) - 36 freq digestions (3) - 1 freq |
dilations (0) - 1 freq dalmations (3) - 3 freq relations (3) - 14 freq dilution (3) - 2 freq donations (3) - 2 freq deletion (4) - 1 freq relatiouns (4) - 1 freq devotions (4) - 4 freq dilutin (4) - 10 freq delusions (4) - 3 freq ablutions (4) - 2 freq dalmatians (4) - 4 freq relaetions (4) - 2 freq platoons (4) - 2 freq lotions (4) - 1 freq diluting (4) - 2 freq citations (4) - 3 freq editions (4) - 4 freq solutions (4) - 20 freq elation (5) - 3 freq evolutions (5) - 1 freq dailins (5) - 4 freq dauntons (5) - 1 freq delting (5) - 2 freq donation (5) - 12 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 - TLXNS delusions - 3 freq dilations - 1 freq |
DILATIONS |
| Time to execute Levenshtein function - 0.209637 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.409463 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.027699 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.038574 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.000784 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. |