| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| velvet (0) - 32 freq velvets (1) - 1 freq veluet (1) - 1 freq velvety (1) - 2 freq velues (2) - 6 freq elves (2) - 10 freq velye (2) - 1 freq veeve (2) - 5 freq velvetie (2) - 1 freq delvit (2) - 1 freq verve (2) - 2 freq veive (2) - 6 freq valve (2) - 1 freq veleta (2) - 1 freq selves (2) - 4 freq velued (2) - 2 freq delve (2) - 6 freq helmet (2) - 15 freq nevet (2) - 1 freq ve've (2) - 1 freq veet (2) - 6 freq velue (2) - 17 freq delved (2) - 2 freq valet (2) - 1 freq elven (2) - 1 freq |
velvet (0) - 32 freq velvety (1) - 2 freq velvetie (2) - 1 freq velvets (2) - 1 freq veluet (2) - 1 freq valet (3) - 1 freq veleta (3) - 1 freq valve (3) - 1 freq delvit (3) - 1 freq salvit (4) - 1 freq velvous (4) - 1 freq evolves (4) - 1 freq livet (4) - 1 freq believt (4) - 1 freq volvos (4) - 1 freq beluvit (4) - 7 freq believet (4) - 1 freq leevit (4) - 4 freq belovit (4) - 5 freq evolve (4) - 7 freq velveteen (4) - 2 freq vulva (4) - 1 freq belevit (4) - 1 freq evolved (4) - 9 freq volvo (4) - 2 freq |
SoundEx code - V413 velvet - 32 freq velvetie - 1 freq velvety - 2 freq velveteen - 2 freq velvets - 1 freq voluptuous - 1 freq velvetmoongifts - 1 freq |
MetaPhone code - FLFT flight - 45 freq velvet - 32 freq full-fed - 1 freq velvetie - 1 freq velvety - 2 freq flighty - 3 freq flaffed - 2 freq flaught - 1 freq fluffed - 1 freq |
VELVET |
| Time to execute Levenshtein function - 0.217828 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.366995 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.027843 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.038732 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.000929 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. |