| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upliftit (0) - 8 freq upluftit (1) - 1 freq upliftin (1) - 4 freq uplichtit (2) - 1 freq uplifts (2) - 1 freq uplifted (2) - 3 freq splintit (2) - 1 freq uplift (2) - 5 freq uplifting (2) - 1 freq liftit (2) - 134 freq pleatit (3) - 3 freq pluffit (3) - 1 freq plantit (3) - 35 freq upclairtit (3) - 1 freq unitit (3) - 29 freq liftet (3) - 17 freq flittit (3) - 44 freq 'flittit (3) - 1 freq pintit (3) - 14 freq liltit (3) - 2 freq plichtit (3) - 3 freq luftit (3) - 7 freq paintit (3) - 22 freq enlistit (3) - 1 freq glintit (3) - 1 freq |
upliftit (0) - 8 freq upluftit (1) - 1 freq upliftin (2) - 4 freq liftit (3) - 134 freq uplift (3) - 5 freq uplifted (3) - 3 freq uplifts (3) - 1 freq plotit (4) - 3 freq aplift (4) - 1 freq pluntit (4) - 3 freq liftet (4) - 17 freq luftit (4) - 7 freq lifitit (4) - 2 freq splintit (4) - 1 freq uplichtit (4) - 1 freq pleatit (4) - 3 freq uplifting (4) - 1 freq plantit (4) - 35 freq pluffit (4) - 1 freq siftit (5) - 1 freq driftit (5) - 9 freq hiftit (5) - 1 freq splurtit (5) - 1 freq shiftit (5) - 33 freq plinkit (5) - 2 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 |
UPLIFTIT |
| Time to execute Levenshtein function - 0.187734 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.328390 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.027212 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.037587 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.000858 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. |