| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| validatit (0) - 1 freq validatin (1) - 1 freq validation (2) - 2 freq validates (2) - 1 freq validat (2) - 1 freq validate (2) - 4 freq vitiatit (3) - 1 freq salistit (3) - 2 freq agitatit (3) - 2 freq alienatit (3) - 1 freq laminatit (3) - 1 freq animatit (3) - 3 freq facinatit (3) - 1 freq valiant (3) - 5 freq validity (3) - 6 freq salivatin (3) - 5 freq flittit (4) - 44 freq waistit (4) - 4 freq agitatin (4) - 2 freq climatic (4) - 1 freq enlistit (4) - 1 freq dominatit (4) - 1 freq vanishit (4) - 1 freq valid (4) - 26 freq relocatit (4) - 1 freq |
validatit (0) - 1 freq validatin (2) - 1 freq validate (3) - 4 freq validat (3) - 1 freq validates (3) - 1 freq validation (3) - 2 freq validity (4) - 6 freq valiant (5) - 5 freq alienatit (5) - 1 freq vaultit (5) - 2 freq vitiatit (5) - 1 freq salistit (5) - 2 freq salutit (6) - 1 freq haltit (6) - 3 freq maladetta (6) - 1 freq toleratit (6) - 1 freq talentit (6) - 6 freq laistit (6) - 2 freq delitit (6) - 3 freq flistit (6) - 1 freq liftit (6) - 135 freq evaporatit (6) - 1 freq glidit (6) - 1 freq invalidated (6) - 1 freq lifitit (6) - 2 freq |
SoundEx code - V433 vaultit - 2 freq validation - 2 freq violated - 2 freq validate - 4 freq validity - 6 freq vaulted - 1 freq validatin - 1 freq validatit - 1 freq validat - 1 freq validates - 1 freq |
MetaPhone code - FLTTT fluid-tide - 1 freq flude-tide - 1 freq validatit - 1 freq |
VALIDATIT |
| Time to execute Levenshtein function - 0.204779 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.354893 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.027083 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.043248 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.000913 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. |