| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vailyie (0) - 3 freq vailye (1) - 6 freq vaillie (1) - 1 freq failyie (1) - 1 freq haillie (2) - 8 freq valye (2) - 6 freq vaillyiet (2) - 1 freq baillie (2) - 17 freq failyiet (2) - 1 freq allyie (2) - 1 freq ailie (2) - 1 freq mailie (2) - 3 freq hailie (2) - 10 freq valyae (2) - 1 freq failzie (2) - 1 freq dailie (2) - 8 freq valyee (2) - 1 freq bailie (2) - 7 freq tuilyie (2) - 2 freq tailie (2) - 7 freq aillie (2) - 1 freq maisie (3) - 242 freq vaudie (3) - 1 freq hailin (3) - 7 freq sairlie (3) - 6 freq |
vailyie (0) - 3 freq vailye (1) - 6 freq valyae (2) - 1 freq valyee (2) - 1 freq valye (2) - 6 freq failyie (2) - 1 freq vaillie (2) - 1 freq aillie (3) - 1 freq tailie (3) - 7 freq tuilyie (3) - 2 freq vail (3) - 2 freq velye (3) - 1 freq vailey (3) - 5 freq vile (3) - 14 freq vaila (3) - 6 freq bailie (3) - 7 freq vale (3) - 8 freq value (3) - 65 freq ailie (3) - 1 freq dailie (3) - 8 freq mailie (3) - 3 freq allyie (3) - 1 freq hailie (3) - 10 freq ilie (4) - 1 freq vailley (4) - 6 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 |
VAILYIE |
| Time to execute Levenshtein function - 0.714777 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.715567 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.061057 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.037282 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.000899 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. |