| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vhbnt (0) - 1 freq vhn (2) - 1 freq vhvnm (2) - 1 freq ahint (2) - 748 freq whant (2) - 15 freq vhan (2) - 1 freq vhbr (2) - 1 freq ahent (2) - 102 freq vent (2) - 6 freq hent (2) - 6 freq vaunt (2) - 1 freq hunt (2) - 62 freq hint (2) - 78 freq chunt (2) - 4 freq phont (2) - 3 freq chant (2) - 26 freq shent (2) - 3 freq hant (2) - 6 freq shunt (2) - 1 freq vbt (2) - 1 freq pwbnt (2) - 1 freq vine (3) - 25 freq rbnf (3) - 1 freq cvht (3) - 1 freq heet (3) - 2 freq |
vhbnt (0) - 1 freq phont (4) - 3 freq chunt (4) - 4 freq hint (4) - 78 freq chant (4) - 26 freq shunt (4) - 1 freq pwbnt (4) - 1 freq vbt (4) - 1 freq hunt (4) - 62 freq hant (4) - 6 freq shent (4) - 3 freq whant (4) - 15 freq ahint (4) - 748 freq vhvnm (4) - 1 freq vaunt (4) - 1 freq vhan (4) - 1 freq vhn (4) - 1 freq hent (4) - 6 freq ahent (4) - 102 freq vent (4) - 6 freq vhbr (4) - 1 freq vaunty (5) - 2 freq chyint (5) - 1 freq bint (5) - 10 freq habit (5) - 50 freq |
SoundEx code - V153 viewpoint - 6 freq vivendi - 1 freq vhbnt - 1 freq vveebndydw - 1 freq viewpoints - 1 freq |
MetaPhone code - FBNT vhbnt - 1 freq |
VHBNT |
| Time to execute Levenshtein function - 0.481888 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.647215 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.029911 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.042581 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.000857 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. |