| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| valve (0) - 1 freq salve (1) - 5 freq valye (1) - 6 freq vale (1) - 8 freq value (1) - 64 freq halve (1) - 1 freq halse (2) - 1 freq salved (2) - 1 freq ave (2) - 42 freq sauve (2) - 1 freq pale (2) - 86 freq delve (2) - 6 freq vague (2) - 18 freq kale (2) - 26 freq walie (2) - 1 freq alse (2) - 8 freq veeve (2) - 5 freq vaege (2) - 3 freq veive (2) - 5 freq alive (2) - 160 freq halie (2) - 83 freq waive (2) - 3 freq tale (2) - 299 freq vance (2) - 6 freq yale (2) - 7 freq |
valve (0) - 1 freq volvo (2) - 2 freq vlv (2) - 1 freq vulva (2) - 1 freq salve (2) - 5 freq evolve (2) - 7 freq valye (2) - 6 freq vale (2) - 8 freq value (2) - 64 freq halve (2) - 1 freq lave (3) - 227 freq valyee (3) - 1 freq velye (3) - 1 freq vile (3) - 14 freq laive (3) - 3 freq solve (3) - 9 freq values (3) - 14 freq laeve (3) - 37 freq val (3) - 34 freq alva (3) - 2 freq vailye (3) - 6 freq haleve (3) - 1 freq alyve (3) - 1 freq vole (3) - 1 freq vales (3) - 4 freq |
SoundEx code - V410 valpo - 1 freq valve - 1 freq vallvé - 1 freq vulva - 1 freq vlp - 1 freq vlv - 1 freq volvo - 2 freq |
MetaPhone code - FLF fluffy - 17 freq flaff - 5 freq valve - 1 freq philiphaugh - 2 freq philiphaw - 1 freq fluff - 5 freq vallvé - 1 freq vulva - 1 freq vlv - 1 freq flava - 1 freq flav - 1 freq volvo - 2 freq |
VALVE |
| Time to execute Levenshtein function - 0.217513 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.392389 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.030564 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.037180 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.000874 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. |