| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| voted (0) - 41 freq doted (1) - 1 freq votes (1) - 69 freq noted (1) - 23 freq toted (1) - 1 freq ooted (1) - 1 freq votet (1) - 1 freq voter (1) - 11 freq vowed (1) - 5 freq vote (1) - 253 freq oed (2) - 6 freq oozed (2) - 1 freq shoted (2) - 1 freq boxed (2) - 7 freq yoked (2) - 1 freq votar (2) - 1 freq vortex (2) - 2 freq footed (2) - 1 freq bored (2) - 48 freq poued (2) - 106 freq hotbed (2) - 2 freq lowed (2) - 3 freq domed (2) - 2 freq sored (2) - 1 freq sated (2) - 3 freq |
voted (0) - 41 freq voter (2) - 11 freq vote (2) - 253 freq vetoed (2) - 1 freq votet (2) - 1 freq vowed (2) - 5 freq votes (2) - 69 freq ooted (2) - 1 freq noted (2) - 23 freq doted (2) - 1 freq toted (2) - 1 freq ted (3) - 13 freq voyied (3) - 1 freq meted (3) - 2 freq motd (3) - 1 freq hated (3) - 52 freq outed (3) - 2 freq fited (3) - 1 freq gated (3) - 1 freq totd (3) - 1 freq vood (3) - 2 freq votit (3) - 42 freq quoted (3) - 9 freq vod (3) - 1 freq vested (3) - 2 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 |
VOTED |
| Time to execute Levenshtein function - 0.197502 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.348309 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.027498 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.042012 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.001102 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. |