| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| votingday (0) - 1 freq voting (3) - 27 freq onyday (4) - 1 freq nottingham (4) - 5 freq toting (4) - 1 freq monday (4) - 230 freq yinday (4) - 1 freq votin (4) - 45 freq tinglan (4) - 3 freq tindal (4) - 4 freq nooindays (4) - 2 freq stingan (4) - 1 freq lovingly (4) - 9 freq hemingway (4) - 4 freq holieday (4) - 1 freq copinsay (4) - 2 freq monanday (4) - 2 freq opingan (4) - 1 freq tingly (4) - 2 freq holiday (4) - 152 freq moanday (4) - 1 freq stingy (4) - 6 freq unkindly (5) - 1 freq blindly (5) - 1 freq clingan (5) - 2 freq |
votingday (0) - 1 freq voting (4) - 27 freq tingly (6) - 2 freq tinged (6) - 3 freq stingy (6) - 6 freq votin (6) - 45 freq stingan (6) - 1 freq toting (6) - 1 freq vomiting (7) - 1 freq tingle (7) - 4 freq stingin (7) - 12 freq acting (7) - 12 freq tinge (7) - 4 freq invitingly (7) - 1 freq coating (7) - 1 freq biting (7) - 1 freq tingled (7) - 1 freq veined (7) - 2 freq mating (7) - 1 freq tingil (7) - 4 freq motioned (7) - 1 freq vikings (7) - 33 freq viking (7) - 60 freq verandae (7) - 1 freq veinegar (7) - 1 freq |
SoundEx code - V352 voting - 27 freq votingday - 1 freq |
MetaPhone code - FTNKT votingday - 1 freq |
VOTINGDAY |
| Time to execute Levenshtein function - 0.791984 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 - 1.303314 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.184591 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.204402 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.000794 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. |