Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
editit (0) - 6 freq editin (1) - 22 freq ditit (1) - 1 freq evitit (1) - 2 freq ectit (2) - 1 freq haitit (2) - 1 freq smitit (2) - 1 freq suitit (2) - 8 freq eijit (2) - 1 freq ruitit (2) - 7 freq delitit (2) - 3 freq evictit (2) - 1 freq excitit (2) - 31 freq edict (2) - 2 freq saitit (2) - 2 freq endytit (2) - 1 freq editor (2) - 70 freq edit (2) - 17 freq evytit (2) - 1 freq leitit (2) - 3 freq emptit (2) - 1 freq creditit (2) - 4 freq mediatit (2) - 1 freq waitit (2) - 81 freq recitit (2) - 5 freq |
editit (0) - 6 freq ditit (1) - 1 freq datit (2) - 6 freq dotit (2) - 1 freq dytit (2) - 2 freq editin (2) - 22 freq evitit (2) - 2 freq doitit (2) - 13 freq eatit (3) - 1 freq unitit (3) - 29 freq editer (3) - 1 freq elatit (3) - 1 freq edited (3) - 6 freq dintit (3) - 3 freq pitit (3) - 5 freq citit (3) - 2 freq ditto (3) - 2 freq daetit (3) - 1 freq ditty (3) - 4 freq doutit (3) - 4 freq dootit (3) - 2 freq edition (3) - 27 freq editar (3) - 2 freq ediot (3) - 1 freq dittit (3) - 1 freq |
SoundEx code - E333 editit - 6 freq edited - 6 freq editathon - 3 freq |
MetaPhone code - ETTT editit - 6 freq edited - 6 freq |
EDITIT |
Time to execute Levenshtein function - 0.201475 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.328669 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.027515 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.037182 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.000911 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. |