| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vinegar (0) - 18 freq veinegar (1) - 1 freq vinegary (1) - 1 freq linear (2) - 3 freq veenegar (2) - 1 freq vineyard (2) - 7 freq pindar (3) - 1 freq fingtr (3) - 1 freq sicecar (3) - 2 freq hingan (3) - 18 freq siecar (3) - 1 freq sidecar (3) - 3 freq liner (3) - 4 freq cinemas (3) - 2 freq sicear (3) - 6 freq dinger (3) - 17 freq mine-a (3) - 2 freq vicar (3) - 1 freq annemar (3) - 1 freq vincher (3) - 1 freq sinead (3) - 2 freq singal (3) - 1 freq literar (3) - 3 freq donegal (3) - 7 freq fingars (3) - 1 freq |
vinegar (0) - 18 freq vinegary (1) - 1 freq veinegar (1) - 1 freq veenegar (2) - 1 freq linger (4) - 5 freq vulgar (4) - 4 freq fingir (4) - 55 freq venera (4) - 2 freq finger (4) - 202 freq mingary (4) - 1 freq hinger (4) - 6 freq ginger (4) - 121 freq yinger (4) - 2 freq ainger (4) - 3 freq avenger (4) - 1 freq fingur (4) - 3 freq minger (4) - 7 freq singer (4) - 47 freq hingir (4) - 1 freq dinger (4) - 17 freq veneer (4) - 1 freq ringer (4) - 6 freq vineyard (4) - 7 freq winger (4) - 3 freq linear (4) - 3 freq |
SoundEx code - V526 vinegar - 18 freq vanguard - 5 freq vincher - 1 freq vennacher - 2 freq veenegar - 1 freq veinegar - 1 freq vncorrupte - 1 freq venacher - 1 freq vpnzrppnsb - 1 freq vangaird - 1 freq vinegary - 1 freq |
MetaPhone code - FNKR vinegar - 18 freq fingur - 3 freq fing'r - 4 freq fïng'r - 3 freq fng'r - 1 freq veenegar - 1 freq veinegar - 1 freq vinegary - 1 freq |
VINEGAR |
| Time to execute Levenshtein function - 0.381946 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.914538 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.096780 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.169851 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.000866 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. |