| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| visitation (0) - 1 freq veesitation (2) - 1 freq hesitation (2) - 12 freq imitation (2) - 4 freq limitation (2) - 1 freq visitabdn (3) - 11 freq limitations (3) - 2 freq station (3) - 143 freq isolation (3) - 20 freq dictation (3) - 1 freq sitiation (3) - 1 freq i'station (3) - 2 freq litigation (3) - 1 freq imitatin (3) - 3 freq recitation (3) - 2 freq veesitations (3) - 1 freq citation (3) - 2 freq habitation (3) - 6 freq invitation (3) - 27 freq meditation (3) - 12 freq initiation (3) - 2 freq hesitatin (3) - 4 freq vegetation (3) - 6 freq gestation (3) - 1 freq validation (3) - 2 freq |
visitation (0) - 1 freq veesitation (2) - 1 freq hesitation (3) - 12 freq veesitations (4) - 1 freq i'station (4) - 2 freq hesitatin (4) - 4 freq visitin (4) - 22 freq sitiation (4) - 1 freq gestation (4) - 1 freq vegetation (4) - 6 freq situation (4) - 157 freq limitation (4) - 1 freq station (4) - 143 freq imitation (4) - 4 freq seitiation (5) - 3 freq dictation (5) - 1 freq irritation (5) - 4 freq visitit (5) - 2 freq vibration (5) - 4 freq seituation (5) - 6 freq veisitin (5) - 4 freq sittin (5) - 737 freq statin (5) - 12 freq devastation (5) - 4 freq staetion (5) - 28 freq |
SoundEx code - V233 veesitation - 1 freq visited - 23 freq veesitit - 8 freq vegetation - 6 freq veisited - 3 freq vestit - 1 freq veesited - 7 freq veisitit - 7 freq visitation - 1 freq vested - 2 freq vegetation's - 1 freq visitit - 2 freq veesitations - 1 freq vegetative - 2 freq vísitit - 1 freq vgtot - 1 freq |
MetaPhone code - FSTXN veesitation - 1 freq visitation - 1 freq |
VISITATION |
| Time to execute Levenshtein function - 0.202769 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.375653 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.030502 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.038258 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.000949 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. |