Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
valyae (0) - 1 freq valyee (1) - 1 freq valye (1) - 6 freq vale (2) - 8 freq alyve (2) - 1 freq algae (2) - 3 freq fallae (2) - 4 freq vailyie (2) - 3 freq alya (2) - 1 freq yallae (2) - 5 freq value (2) - 64 freq vailye (2) - 6 freq alsae (2) - 9 freq mallae (2) - 4 freq valve (2) - 1 freq gallae (2) - 1 freq qalye (2) - 1 freq varyan (2) - 1 freq velye (2) - 1 freq halle (3) - 4 freq €œyae (3) - 4 freq oantae (3) - 89 freq aawye (3) - 41 freq adae (3) - 139 freq yae (3) - 1059 freq |
valyae (0) - 1 freq valyee (1) - 1 freq valye (1) - 6 freq vailye (2) - 6 freq velye (2) - 1 freq vailyie (2) - 3 freq value (2) - 64 freq vale (2) - 8 freq valve (3) - 1 freq vaila (3) - 6 freq qalye (3) - 1 freq velue (3) - 17 freq val (3) - 34 freq alya (3) - 1 freq vole (3) - 1 freq yallae (3) - 5 freq vile (3) - 14 freq velay (3) - 1 freq halie (4) - 83 freq tale (4) - 299 freq bale (4) - 8 freq rale (4) - 78 freq gale (4) - 64 freq haly (4) - 60 freq slae (4) - 8 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 |
VALYAE |
Time to execute Levenshtein function - 0.484464 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.889673 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.035489 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.080802 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.000825 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. |