| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| editathon (0) - 3 freq meditation (2) - 12 freq edication (2) - 3 freq dictation (3) - 1 freq medication (3) - 8 freq agitation (3) - 5 freq hesitation (3) - 12 freq eddication (3) - 51 freq meditaetion (3) - 1 freq meditatin (3) - 4 freq mediation (3) - 4 freq citation (3) - 2 freq imitation (3) - 4 freq edition (3) - 27 freq education (3) - 421 freq recitation (3) - 2 freq dedication (3) - 8 freq educatioun (4) - 7 freq editor (4) - 70 freq dittan (4) - 1 freq i'station (4) - 2 freq adulation (4) - 1 freq indication (4) - 5 freq edith (4) - 18 freq 'diagon (4) - 1 freq |
editathon (0) - 3 freq edication (4) - 3 freq meditation (4) - 12 freq edition (5) - 27 freq imitation (5) - 4 freq education (5) - 421 freq kitthin (5) - 1 freq detachin (5) - 1 freq citation (5) - 2 freq dittan (5) - 1 freq agitation (5) - 5 freq dictation (5) - 1 freq meditaetion (5) - 1 freq meditatin (5) - 4 freq edeition (6) - 13 freq dottin (6) - 1 freq heitath (6) - 1 freq sitiation (6) - 1 freq adoration (6) - 6 freq dilution (6) - 2 freq duration (6) - 5 freq emittin (6) - 1 freq aduration (6) - 1 freq station (6) - 143 freq initiation (6) - 2 freq |
SoundEx code - E333 editit - 6 freq edited - 6 freq editathon - 3 freq |
MetaPhone code - ETT0N editathon - 3 freq |
EDITATHON |
| Time to execute Levenshtein function - 0.461071 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.545746 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.030674 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.045410 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.001261 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. |