| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vegetative (0) - 2 freq vegetation (2) - 6 freq repetitive (3) - 2 freq negative (3) - 41 freq vegetable (3) - 15 freq vegetarian (3) - 10 freq tentative (3) - 3 freq derivative (4) - 3 freq selective (4) - 4 freq elective (4) - 1 freq feigurative (4) - 2 freq imitative (4) - 1 freq sedative (4) - 1 freq figurative (4) - 3 freq versatile (4) - 4 freq vegetables (4) - 23 freq vocative (4) - 1 freq selecktive (4) - 1 freq gustative (4) - 1 freq raelative (4) - 1 freq gelatine (4) - 2 freq vegetarians (4) - 3 freq negatives (4) - 3 freq executive (4) - 107 freq digestive (4) - 4 freq |
vegetative (0) - 2 freq vegetation (3) - 6 freq tentative (5) - 3 freq vegetable (5) - 15 freq vegetarian (5) - 10 freq repetitive (5) - 2 freq negative (5) - 41 freq digestive (6) - 4 freq vocative (6) - 1 freq hortative (6) - 1 freq evocative (6) - 5 freq figurative (6) - 3 freq gustative (6) - 1 freq feigurative (6) - 2 freq imitative (6) - 1 freq agitatin (7) - 2 freq agitatit (7) - 2 freq negotiate (7) - 6 freq vgtot (7) - 1 freq overactive (7) - 1 freq intiative (7) - 1 freq gettin (7) - 1172 freq guttie (7) - 5 freq fugitive (7) - 3 freq cognitive (7) - 8 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 - FJTTF vegetative - 2 freq |
VEGETATIVE |
| Time to execute Levenshtein function - 0.287779 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.613887 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.029210 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.074079 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.004784 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. |