| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| veesited (0) - 7 freq veesiter (1) - 1 freq veisited (1) - 3 freq leemited (2) - 1 freq veesitin (2) - 31 freq vested (2) - 2 freq veesiters (2) - 2 freq visited (2) - 23 freq veesitor (2) - 21 freq veesits (2) - 15 freq veesit (2) - 93 freq veesitur (2) - 1 freq veesitit (2) - 8 freq detested (3) - 1 freq peesies (3) - 2 freq weeted (3) - 1 freq vomited (3) - 4 freq versity (3) - 11 freq reesed (3) - 12 freq peetied (3) - 3 freq veisit (3) - 25 freq beeried (3) - 14 freq teeted (3) - 1 freq veisitar (3) - 2 freq bested (3) - 2 freq |
veesited (0) - 7 freq veisited (1) - 3 freq vested (2) - 2 freq veesiter (2) - 1 freq visited (2) - 23 freq veesit (3) - 93 freq veesitit (3) - 8 freq veesits (3) - 15 freq veesitur (3) - 1 freq veesitor (3) - 21 freq veesitin (3) - 31 freq veeseeten (4) - 1 freq veisitor (4) - 7 freq nested (4) - 1 freq veisits (4) - 8 freq tested (4) - 21 freq bested (4) - 2 freq vissied (4) - 2 freq feasted (4) - 2 freq veisitar (4) - 2 freq lested (4) - 4 freq egested (4) - 1 freq rested (4) - 12 freq veisit (4) - 25 freq veisitin (4) - 4 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 - FSTT foostit - 1 freq visited - 23 freq ghaistit - 1 freq foistit - 1 freq veesitit - 8 freq fisted - 1 freq foisted - 1 freq facetit - 1 freq veisited - 3 freq vestit - 1 freq veesited - 7 freq foustit - 1 freq veisitit - 7 freq vested - 2 freq visitit - 2 freq feasted - 2 freq vísitit - 1 freq |
VEESITED |
| Time to execute Levenshtein function - 0.210142 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.357208 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.029046 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.041382 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.000947 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. |