Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
venom (0) - 13 freq vroom (2) - 1 freq eenoo (2) - 57 freq besom (2) - 30 freq enorm (2) - 11 freq venus (2) - 32 freq eno (2) - 9 freq kenjm (2) - 1 freq venomed (2) - 1 freq genome (2) - 2 freq gnom (2) - 2 freq vents (2) - 1 freq enof (2) - 5 freq vem (2) - 1 freq zeno (2) - 1 freq meno (2) - 1 freq eenow (2) - 1 freq veni (2) - 1 freq enow (2) - 5 freq vino (2) - 9 freq phnom (2) - 1 freq enoo (2) - 8 freq vonoq (2) - 1 freq enou (2) - 1 freq tenon (2) - 1 freq |
venom (0) - 13 freq denim (3) - 9 freq venue (3) - 14 freq vent (3) - 6 freq vonoq (3) - 1 freq vino (3) - 9 freq venn (3) - 1 freq verm (3) - 1 freq venge (3) - 1 freq nom (3) - 2 freq penim (3) - 1 freq enem (3) - 2 freq veni (3) - 1 freq vom (3) - 1 freq genome (3) - 2 freq venus (3) - 32 freq gnom (3) - 2 freq vroom (3) - 1 freq venomed (3) - 1 freq vem (3) - 1 freq vein (4) - 5 freq vietnam (4) - 7 freq evens (4) - 1 freq vynd (4) - 4 freq lnm (4) - 1 freq |
SoundEx code - V550 vannin - 1 freq venom - 13 freq vannan - 1 freq |
MetaPhone code - FNM phnom - 1 freq venom - 13 freq fann'im - 2 freq |
VENOM |
Time to execute Levenshtein function - 0.179875 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.332454 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.029832 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.038748 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.000850 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. |