| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upliftin (0) - 4 freq upliftit (1) - 8 freq uplifting (1) - 1 freq uplift (2) - 5 freq liftin (2) - 75 freq uplifts (2) - 1 freq splittin (2) - 12 freq splirtin (2) - 1 freq uplifhn (2) - 1 freq uglifyin (2) - 4 freq uplifted (2) - 3 freq upluftit (2) - 1 freq unlivin (3) - 1 freq splitting (3) - 1 freq plinkin (3) - 10 freq splishin (3) - 1 freq upgiein (3) - 1 freq scriftin (3) - 4 freq plettin (3) - 1 freq driftin (3) - 23 freq gualifyin (3) - 1 freq upsitten (3) - 1 freq glintin (3) - 15 freq puitin (3) - 2 freq uglifying (3) - 1 freq |
upliftin (0) - 4 freq uplifting (2) - 1 freq upliftit (2) - 8 freq uplifted (3) - 3 freq upluftit (3) - 1 freq uplifhn (3) - 1 freq uplifts (3) - 1 freq liftin (3) - 75 freq uplift (3) - 5 freq pluntin (4) - 7 freq liftan (4) - 3 freq plottin (4) - 9 freq luftin (4) - 2 freq pluffin (4) - 2 freq plartin (4) - 1 freq plantin (4) - 22 freq plowtin (4) - 2 freq aplift (4) - 1 freq plentin (4) - 1 freq splirtin (4) - 1 freq plettin (4) - 1 freq splittin (4) - 12 freq uglifyin (4) - 4 freq flittin (5) - 66 freq littin (5) - 10 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 - UPLFTN upliftin - 4 freq up-lightan - 1 freq |
UPLIFTIN |
| Time to execute Levenshtein function - 0.503509 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.883602 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.028217 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.086065 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.000911 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. |