| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vainishes (0) - 5 freq vanishes (1) - 1 freq vainished (1) - 10 freq vainishin (2) - 4 freq vainish (2) - 9 freq feinishes (2) - 12 freq varnished (2) - 3 freq vanished (2) - 39 freq bainished (2) - 1 freq vainisht (2) - 5 freq finishes (2) - 8 freq pairishes (2) - 3 freq vinkished (3) - 1 freq tarnished (3) - 1 freq vanishin (3) - 5 freq vanishan (3) - 1 freq manished (3) - 4 freq ganshes (3) - 11 freq varnish (3) - 6 freq painches (3) - 1 freq vairses (3) - 1 freq feinished (3) - 5 freq painites (3) - 1 freq bainisht (3) - 5 freq finished (3) - 129 freq |
vainishes (0) - 5 freq vanishes (1) - 1 freq vainished (2) - 10 freq vanished (3) - 39 freq vainisht (3) - 5 freq finishes (3) - 8 freq feinishes (3) - 12 freq vainishin (3) - 4 freq vainish (3) - 9 freq vanisht (4) - 4 freq feenishes (4) - 7 freq vanish (4) - 6 freq ganshes (4) - 11 freq vanishit (4) - 1 freq vanishan (4) - 1 freq pairishes (4) - 3 freq bainished (4) - 1 freq varnished (4) - 3 freq vanishin (4) - 5 freq vainist (5) - 1 freq vanities (5) - 1 freq vaines (5) - 1 freq parishes (5) - 1 freq manishee (5) - 1 freq knashes (5) - 1 freq |
SoundEx code - V522 vinkished - 1 freq vinci's - 2 freq vainishes - 5 freq vanishes - 1 freq vincust - 1 freq vinkish - 1 freq vfhnzick - 1 freq vffnjejnyt - 1 freq |
MetaPhone code - FNXS feenishes - 7 freq feinishes - 12 freq finishes - 8 freq feeneeshes - 2 freq finches - 1 freq vainishes - 5 freq vanishes - 1 freq |
VAINISHES |
| Time to execute Levenshtein function - 0.591641 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.099934 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.086808 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.094033 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.001079 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. |