| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uplifted (0) - 3 freq upliftin (2) - 4 freq lifted (2) - 98 freq uplifts (2) - 1 freq uplift (2) - 5 freq upliftit (2) - 8 freq plotted (3) - 2 freq rifted (3) - 1 freq qualified (3) - 13 freq listed (3) - 6 freq lfted (3) - 1 freq unified (3) - 3 freq upluftit (3) - 1 freq lufted (3) - 5 freq liftcd (3) - 1 freq plaited (3) - 3 freq uplifhn (3) - 1 freq uploaded (3) - 1 freq gliffed (3) - 3 freq united (3) - 75 freq sprinted (3) - 8 freq unlimited (3) - 21 freq sifted (3) - 1 freq salisted (3) - 1 freq aplift (3) - 1 freq |
uplifted (0) - 3 freq uplift (3) - 5 freq uplifts (3) - 1 freq upliftit (3) - 8 freq lifted (3) - 98 freq upliftin (3) - 4 freq planted (4) - 31 freq plaited (4) - 3 freq plated (4) - 3 freq aplift (4) - 1 freq lufted (4) - 5 freq elufted (4) - 1 freq upluftit (4) - 1 freq liftid (4) - 1 freq lfted (4) - 1 freq plunted (4) - 7 freq plotted (4) - 2 freq pleated (4) - 5 freq gifted (5) - 8 freq pulsated (5) - 2 freq amplified (5) - 1 freq plitter (5) - 1 freq peinted (5) - 1 freq qualifeed (5) - 1 freq plister (5) - 1 freq |
SoundEx code - U141 uplift - 5 freq uplifted - 3 freq upliftit - 8 freq uplifts - 1 freq upliftin - 4 freq uplifhn - 1 freq upluftit - 1 freq uplifting - 1 freq |
MetaPhone code - UPLFTT uplifted - 3 freq upliftit - 8 freq upluftit - 1 freq |
UPLIFTED |
| Time to execute Levenshtein function - 0.214401 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.367863 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.027045 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.038112 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.000814 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. |