| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vantage (0) - 9 freq avantage (1) - 1 freq vintage (1) - 9 freq voltage (2) - 2 freq manage (2) - 184 freq vannae (2) - 1 freq bandage (2) - 8 freq wastage (2) - 3 freq fantace (2) - 1 freq langage (2) - 244 freq gantae (2) - 6 freq oantae (2) - 99 freq advantage (2) - 47 freq wantae (2) - 15 freq avantages (2) - 1 freq vaige (3) - 13 freq mentae (3) - 1 freq pantan (3) - 3 freq untae (3) - 13 freq yaisage (3) - 4 freq santa's (3) - 9 freq montague (3) - 3 freq haalage (3) - 1 freq vannan (3) - 1 freq hantle (3) - 116 freq |
vantage (0) - 9 freq avantage (1) - 1 freq vintage (1) - 9 freq advantage (3) - 47 freq avantages (3) - 1 freq voltage (3) - 2 freq vauntie (4) - 25 freq santiago (4) - 2 freq venge (4) - 1 freq venture (4) - 21 freq advuntage (4) - 2 freq vestige (4) - 1 freq advauntage (4) - 1 freq montague (4) - 3 freq vanitie (4) - 2 freq wantae (4) - 15 freq bandage (4) - 8 freq vannae (4) - 1 freq manage (4) - 184 freq wastage (4) - 3 freq fantace (4) - 1 freq oantae (4) - 99 freq langage (4) - 244 freq gantae (4) - 6 freq maneyge (5) - 2 freq |
SoundEx code - V532 vauntyhike - 1 freq viands - 3 freq vintage - 9 freq vindictive - 2 freq vanities - 1 freq vindication - 4 freq vents - 1 freq vindicated - 1 freq vantage - 9 freq |
MetaPhone code - FNTJ vintage - 9 freq vantage - 9 freq |
VANTAGE |
| Time to execute Levenshtein function - 0.207801 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.344625 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.027831 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.037146 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.000870 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. |