| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| votit (0) - 42 freq dotit (1) - 1 freq notit (1) - 13 freq vomit (1) - 9 freq votin (1) - 45 freq vottit (1) - 1 freq votet (1) - 1 freq vott (1) - 2 freq vote (2) - 253 freq motet (2) - 3 freq postit (2) - 13 freq tltit (2) - 1 freq yoit (2) - 1 freq ott (2) - 4 freq yowtit (2) - 1 freq vot (2) - 1 freq tootit (2) - 1 freq evytit (2) - 1 freq voting (2) - 27 freq voits (2) - 2 freq ectit (2) - 1 freq rootit (2) - 8 freq coit (2) - 7 freq evokit (2) - 1 freq voamit (2) - 2 freq |
votit (0) - 42 freq vott (1) - 2 freq votet (1) - 1 freq vomit (2) - 9 freq evitit (2) - 2 freq evytit (2) - 1 freq notit (2) - 13 freq dotit (2) - 1 freq vottit (2) - 1 freq votin (2) - 45 freq gott (3) - 3 freq dytit (3) - 2 freq optit (3) - 1 freq voter (3) - 11 freq pitit (3) - 5 freq vatta (3) - 1 freq doitit (3) - 13 freq tit (3) - 26 freq hatit (3) - 15 freq putit (3) - 2 freq voot (3) - 1 freq voted (3) - 41 freq votre (3) - 1 freq mootit (3) - 1 freq lootit (3) - 1 freq |
SoundEx code - V330 votit - 42 freq voted - 41 freq votet - 1 freq vottit - 1 freq vetoed - 1 freq vdett - 1 freq |
MetaPhone code - FTT fadit - 10 freq faded - 16 freq fauted - 1 freq fittit - 26 freq fetid - 3 freq fitted - 27 freq fiytit - 1 freq votit - 42 freq fited - 1 freq voted - 41 freq fittet - 3 freq votet - 1 freq feddit - 1 freq fedit - 1 freq photied - 1 freq footed - 1 freq fated - 1 freq vottit - 1 freq feedit - 1 freq fautit - 3 freq fittid - 1 freq fettit - 1 freq fittaedee - 1 freq vetoed - 1 freq vdett - 1 freq ftd - 1 freq |
VOTIT |
| Time to execute Levenshtein function - 0.189977 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.337077 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.027362 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.037444 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.000959 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. |