| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| votingday (0) - 1 freq voting (3) - 27 freq nottingham (4) - 5 freq opingan (4) - 1 freq nooindays (4) - 2 freq yinday (4) - 1 freq hemingway (4) - 4 freq monanday (4) - 2 freq stingy (4) - 7 freq toting (4) - 1 freq tinglan (4) - 3 freq onyday (4) - 1 freq moanday (4) - 1 freq holieday (4) - 1 freq holiday (4) - 152 freq stingan (4) - 1 freq tingly (4) - 2 freq copinsay (4) - 2 freq votin (4) - 45 freq lovingly (4) - 9 freq monday (4) - 231 freq tindal (4) - 4 freq ootin (5) - 5 freq nominal (5) - 1 freq noticed (5) - 227 freq |
votingday (0) - 1 freq voting (4) - 27 freq votin (6) - 45 freq stingan (6) - 1 freq tingly (6) - 2 freq toting (6) - 1 freq stingy (6) - 7 freq tinged (6) - 4 freq eating (7) - 18 freq stings (7) - 9 freq standy (7) - 1 freq tinnd (7) - 1 freq vinegary (7) - 1 freq invitingly (7) - 1 freq ting' (7) - 1 freq veinegar (7) - 1 freq vikings (7) - 33 freq stingin (7) - 12 freq tonga (7) - 1 freq tings (7) - 23 freq touting (7) - 1 freq quoting (7) - 3 freq veranda (7) - 5 freq dating (7) - 8 freq tangy (7) - 2 freq |
SoundEx code - V352 voting - 27 freq votingday - 1 freq |
MetaPhone code - FTNKT votingday - 1 freq |
VOTINGDAY |
| Time to execute Levenshtein function - 0.298788 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.386586 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.030838 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.045905 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.000905 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. |