| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uppin (0) - 1 freq upain (1) - 1 freq nuppin (1) - 1 freq cuppin (1) - 6 freq suppin (1) - 9 freq wuppin (1) - 1 freq appin (1) - 2 freq oppin (1) - 4 freq gappin (2) - 2 freq up-pit (2) - 1 freq upwind (2) - 1 freq hopin (2) - 85 freq gypin (2) - 3 freq uplan (2) - 4 freq usin (2) - 97 freq sippin (2) - 7 freq heppin (2) - 1 freq upoan (2) - 7 freq alpin (2) - 7 freq jappin (2) - 1 freq whuppin (2) - 6 freq vapin (2) - 1 freq wuppid (2) - 1 freq uckin (2) - 1 freq rypin (2) - 5 freq |
uppin (0) - 1 freq appin (1) - 2 freq oppin (1) - 4 freq papin (2) - 2 freq yappin (2) - 8 freq oppen (2) - 31 freq pipin (2) - 8 freq yippin (2) - 1 freq appen (2) - 25 freq nuppin (2) - 1 freq upain (2) - 1 freq wuppin (2) - 1 freq cuppin (2) - 6 freq suppin (2) - 9 freq poopin (3) - 1 freq ropin (3) - 1 freq oppint (3) - 2 freq pumpin (3) - 19 freq uppt (3) - 1 freq pain (3) - 242 freq upn (3) - 1 freq yuppie (3) - 1 freq wuppen (3) - 1 freq dippin (3) - 10 freq spain (3) - 55 freq |
SoundEx code - U150 upon - 255 freq upoan - 7 freq up'n - 1 freq upun - 5 freq upain - 1 freq upo'm - 1 freq ubun - 1 freq uppin - 1 freq upn - 1 freq ubmo - 1 freq uapn - 1 freq |
MetaPhone code - UPN upon - 255 freq upoan - 7 freq up'n - 1 freq upun - 5 freq upain - 1 freq uppin - 1 freq upn - 1 freq uapn - 1 freq |
UPPIN |
| Time to execute Levenshtein function - 0.207483 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.370802 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.031816 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.040622 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.000906 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. |