Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
velvous (0) - 1 freq nervous (2) - 80 freq velvets (2) - 1 freq volvos (2) - 1 freq vicious (3) - 17 freq velue (3) - 17 freq bulbous (3) - 4 freq valour (3) - 1 freq velues (3) - 6 freq helios (3) - 5 freq vesuvius (3) - 1 freq melrois (3) - 1 freq kelsohs (3) - 1 freq veicious (3) - 6 freq lous (3) - 1 freq yellows (3) - 4 freq devious (3) - 4 freq viscous (3) - 1 freq allous (3) - 27 freq jeyous (3) - 1 freq villius (3) - 2 freq melons (3) - 2 freq volvo (3) - 2 freq verus (3) - 1 freq vacuous (3) - 2 freq |
velvous (0) - 1 freq volvos (2) - 1 freq velvets (3) - 1 freq velvet (4) - 32 freq valvona (4) - 1 freq selves (4) - 4 freq villius (4) - 2 freq volvo (4) - 2 freq evolves (4) - 1 freq velvety (4) - 2 freq elves (4) - 10 freq vilots (4) - 1 freq elvis (4) - 11 freq pelvis (4) - 2 freq valorous (4) - 2 freq nervous (4) - 80 freq velues (4) - 6 freq velars (4) - 1 freq vesuvius (4) - 1 freq vls (5) - 1 freq volleys (5) - 2 freq velvetie (5) - 1 freq leaves (5) - 208 freq oblivious (5) - 14 freq volumes (5) - 16 freq |
SoundEx code - V412 velvous - 1 freq volvos - 1 freq vulpis - 1 freq velvickchris - 1 freq |
MetaPhone code - FLFS velvous - 1 freq volvos - 1 freq |
VELVOUS |
Time to execute Levenshtein function - 0.236457 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.454890 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.061547 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.078019 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.001175 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. |