| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| voters (0) - 63 freq votes (1) - 69 freq voter (1) - 11 freq moters (1) - 1 freq votars (1) - 4 freq voters' (1) - 1 freq voger (2) - 1 freq hooters (2) - 3 freq dothers (2) - 5 freq votar (2) - 1 freq haters (2) - 1 freq votet (2) - 1 freq dooters (2) - 2 freq towers (2) - 19 freq afters (2) - 3 freq vipers (2) - 5 freq conters (2) - 1 freq eaters (2) - 2 freq overs (2) - 2 freq meters (2) - 12 freq tooers (2) - 6 freq vooels (2) - 2 freq vouels (2) - 1 freq motets (2) - 3 freq owers (2) - 2 freq |
voters (0) - 63 freq votars (1) - 4 freq moters (2) - 1 freq voters' (2) - 1 freq voter (2) - 11 freq votes (2) - 69 freq otters (3) - 3 freq sters (3) - 1 freq votre (3) - 1 freq waters (3) - 18 freq motirs (3) - 2 freq fters (3) - 1 freq avatars (3) - 3 freq efters (3) - 1 freq naters (3) - 1 freq oxters (3) - 45 freq laters (3) - 12 freq veers (3) - 1 freq enters (3) - 10 freq baters (3) - 2 freq peters (3) - 4 freq rioters (3) - 1 freq touers (3) - 4 freq vers (3) - 1 freq vivers (3) - 1 freq |
SoundEx code - V362 voters - 63 freq vtheris - 1 freq votars - 4 freq voters' - 1 freq vtrzoti - 1 freq vpdirx - 1 freq |
MetaPhone code - FTRS futures - 7 freq footers - 3 freq fedders - 21 freq features - 45 freq future's - 5 freq voters - 63 freq features' - 1 freq fadder's - 7 freq fadders - 3 freq fadders' - 1 freq fedder's - 2 freq futurs - 2 freq faider's - 1 freq feeders - 1 freq featurs - 14 freq fautors - 1 freq votars - 4 freq fatures - 1 freq faiders - 1 freq fitters - 3 freq voters' - 1 freq faitters - 1 freq 'features - 1 freq fters - 1 freq |
VOTERS |
| Time to execute Levenshtein function - 0.178408 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.359780 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.027526 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.037462 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.000791 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. |