| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| votit (0) - 42 freq votet (1) - 1 freq vottit (1) - 1 freq vott (1) - 2 freq notit (1) - 12 freq dotit (1) - 1 freq votin (1) - 45 freq vomit (1) - 9 freq hootit (2) - 2 freq coit (2) - 7 freq hottit (2) - 1 freq lootit (2) - 1 freq petit (2) - 1 freq iftit (2) - 1 freq yoit (2) - 1 freq rostit (2) - 1 freq hopit (2) - 2 freq dotie (2) - 1 freq dotir (2) - 1 freq intit (2) - 11 freq visit (2) - 146 freq ootpit (2) - 28 freq notict (2) - 1 freq optit (2) - 1 freq loutit (2) - 3 freq |
votit (0) - 42 freq vott (1) - 2 freq votet (1) - 1 freq evytit (2) - 1 freq evitit (2) - 2 freq vomit (2) - 9 freq votin (2) - 45 freq notit (2) - 12 freq vottit (2) - 1 freq dotit (2) - 1 freq wytit (3) - 20 freq bootit (3) - 2 freq vreit (3) - 1 freq xotot (3) - 1 freq tootit (3) - 1 freq moutit (3) - 1 freq varit (3) - 1 freq voot (3) - 1 freq vexit (3) - 2 freq quotit (3) - 11 freq citit (3) - 2 freq hatit (3) - 15 freq rootit (3) - 8 freq actit (3) - 9 freq devotit (3) - 5 freq |
SoundEx code - V330 votit - 42 freq voted - 39 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 - 39 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.251372 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.490153 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.058678 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.037364 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.000831 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. |