| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vanish (0) - 6 freq vainish (1) - 9 freq vanisht (1) - 4 freq varnish (1) - 6 freq danish (1) - 19 freq manish (1) - 4 freq spanish (2) - 41 freq verish (2) - 1 freq vans (2) - 22 freq papish (2) - 1 freq manisht (2) - 1 freq warnish (2) - 4 freq mcnish (2) - 22 freq parish (2) - 30 freq tavish (2) - 1 freq vanished (2) - 39 freq vanes (2) - 2 freq wanis (2) - 3 freq canisp (2) - 1 freq lenish (2) - 1 freq vinkish (2) - 1 freq garish (2) - 1 freq wankish (2) - 1 freq marish (2) - 1 freq damish (2) - 4 freq |
vanish (0) - 6 freq vainish (1) - 9 freq manish (2) - 4 freq danish (2) - 19 freq varnish (2) - 6 freq vanisht (2) - 4 freq vinkish (3) - 1 freq lenish (3) - 1 freq vanes (3) - 2 freq punish (3) - 4 freq vanishan (3) - 1 freq vanished (3) - 39 freq finish (3) - 76 freq gansh (3) - 12 freq ganesh (3) - 6 freq vainist (3) - 1 freq vanishin (3) - 5 freq vans (3) - 22 freq verish (3) - 1 freq vanishes (3) - 1 freq vanishit (3) - 1 freq vainisht (3) - 5 freq enosh (4) - 3 freq nsh (4) - 1 freq punsh (4) - 2 freq |
SoundEx code - V520 vans - 22 freq venus - 32 freq vainish - 9 freq veins - 44 freq van's - 1 freq vines - 6 freq venice - 11 freq vamoose - 1 freq venge - 1 freq 'venus - 1 freq venues - 19 freq vanessa - 1 freq vonnie's - 1 freq viennese - 2 freq venusia - 1 freq vinci - 1 freq vanes - 2 freq vanish - 6 freq vaines - 1 freq vinnys - 1 freq viewing - 6 freq vonoq - 1 freq vying - 1 freq vvmj - 1 freq vance - 6 freq vmas - 1 freq |
MetaPhone code - FNX feenish - 106 freq feeneesh - 12 freq finish - 76 freq feinish - 13 freq vainish - 9 freq feenich - 1 freq feenesh - 2 freq fïnish - 1 freq venusia - 1 freq finiesh - 1 freq finnish - 11 freq finch - 1 freq vanish - 6 freq fínish - 5 freq phoenicia - 1 freq |
VANISH |
| Time to execute Levenshtein function - 0.203173 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.354986 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.036670 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.039342 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.000865 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. |