Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
valye (0) - 6 freq vale (1) - 8 freq valyee (1) - 1 freq qalye (1) - 1 freq valve (1) - 1 freq valyae (1) - 1 freq velye (1) - 1 freq value (1) - 64 freq vailye (1) - 6 freq 'aye (2) - 304 freq halve (2) - 1 freq vance (2) - 6 freq vague (2) - 18 freq gaye (2) - 2 freq sale (2) - 62 freq vole (2) - 1 freq blye (2) - 2 freq waly (2) - 27 freq aale (2) - 1 freq kale (2) - 26 freq tale (2) - 299 freq gale (2) - 64 freq ale (2) - 51 freq halle (2) - 4 freq val (2) - 34 freq |
valye (0) - 6 freq value (1) - 64 freq vailye (1) - 6 freq velye (1) - 1 freq valyae (1) - 1 freq valyee (1) - 1 freq vale (1) - 8 freq vailyie (2) - 3 freq velue (2) - 17 freq vile (2) - 14 freq vole (2) - 1 freq val (2) - 34 freq valve (2) - 1 freq qalye (2) - 1 freq vaila (3) - 6 freq aalie (3) - 1 freq walee (3) - 1 freq lye (3) - 8 freq clye (3) - 2 freq hale (3) - 959 freq aly (3) - 5 freq allye (3) - 1 freq vaege (3) - 3 freq vary (3) - 3 freq dale (3) - 29 freq |
SoundEx code - V400 vowel - 87 freq vailley - 6 freq volley - 9 freq ve'll - 1 freq value - 64 freq valley - 48 freq veil - 25 freq vile - 14 freq vil - 2 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 viola - 3 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 |
VALYE |
Time to execute Levenshtein function - 0.193986 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.362771 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.027471 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.039319 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.000855 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. |