| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| velye (0) - 1 freq valye (1) - 6 freq velue (1) - 17 freq velues (2) - 6 freq verde (2) - 2 freq value (2) - 65 freq eely (2) - 2 freq belie (2) - 2 freq delve (2) - 6 freq telle (2) - 7 freq venue (2) - 16 freq valyee (2) - 1 freq volce (2) - 1 freq rely (2) - 16 freq verve (2) - 2 freq nelde (2) - 3 freq veive (2) - 6 freq veere (2) - 1 freq vole (2) - 1 freq delyt (2) - 3 freq vile (2) - 14 freq tele (2) - 32 freq enye (2) - 1 freq fele (2) - 3 freq wely (2) - 1 freq |
velye (0) - 1 freq valye (1) - 6 freq velue (1) - 17 freq vale (2) - 8 freq vailye (2) - 6 freq valyee (2) - 1 freq vole (2) - 1 freq valyae (2) - 1 freq vile (2) - 14 freq value (2) - 65 freq velay (2) - 1 freq verie (3) - 23 freq velued (3) - 2 freq ely (3) - 1 freq kele (3) - 1 freq ville (3) - 1 freq clye (3) - 2 freq qalye (3) - 1 freq vol (3) - 1 freq mele (3) - 1 freq melee (3) - 3 freq pele (3) - 17 freq valve (3) - 1 freq elie (3) - 1 freq veice (3) - 2 freq |
SoundEx code - V400 vowel - 87 freq vailley - 6 freq volley - 9 freq ve'll - 1 freq value - 65 freq valley - 48 freq veil - 25 freq vile - 14 freq vil - 2 freq viola - 4 freq vale - 8 freq vl - 6 freq vailye - 6 freq valyee - 1 freq valley' - 2 freq velye - 1 freq valye - 6 freq velay - 1 freq vole - 1 freq villee - 1 freq velue - 17 freq vail - 2 freq vowel'll - 1 freq vaila - 6 freq voll - 1 freq 'value - 1 freq val - 34 freq vailey - 5 freq -vol - 1 freq villa - 7 freq vaill - 7 freq vaillie - 1 freq vailyie - 3 freq vouel - 2 freq valyae - 1 freq voil - 1 freq veal - 2 freq €œvil - 1 freq vool - 2 freq vol - 1 freq vlo - 1 freq vll - 1 freq ville - 1 freq |
MetaPhone code - FLY vailye - 6 freq valyee - 1 freq velye - 1 freq valye - 6 freq fulyie - 2 freq failyie - 1 freq vailyie - 3 freq valyae - 1 freq |
VELYE |
| Time to execute Levenshtein function - 0.200092 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.346579 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.029021 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.043689 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.000957 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. |