| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upcomin (0) - 3 freq upcommin (1) - 1 freq upcoming (1) - 3 freq upcome (2) - 2 freq oncomin (2) - 4 freq comin (2) - 1056 freq becomin (2) - 45 freq 'comin (2) - 3 freq incomin (2) - 6 freq upcomes (2) - 1 freq phonin (3) - 22 freq upgiein (3) - 1 freq supposin (3) - 14 freq comim (3) - 1 freq comins (3) - 4 freq uploadin (3) - 1 freq uncoil (3) - 2 freq komin (3) - 1 freq upain (3) - 1 freq soomin (3) - 7 freq upcum (3) - 2 freq provin (3) - 3 freq uncorkin (3) - 1 freq eomin (3) - 1 freq commin (3) - 8 freq |
upcomin (0) - 3 freq upcoming (2) - 3 freq upcommin (2) - 1 freq 'comin (3) - 3 freq upcomes (3) - 1 freq becomin (3) - 45 freq incomin (3) - 6 freq upcome (3) - 2 freq oncomin (3) - 4 freq comin (3) - 1056 freq cumin (4) - 70 freq plumin (4) - 1 freq becoman (4) - 2 freq upcum (4) - 2 freq cimin (4) - 1 freq comyn (4) - 3 freq coman (4) - 41 freq becumin (4) - 1 freq incoman (4) - 1 freq poemin (4) - 1 freq 'coman (4) - 1 freq camin (4) - 4 freq upcumm (4) - 1 freq ootcomin (4) - 1 freq comon (4) - 1 freq |
SoundEx code - U125 up-biggin - 1 freq upcounty - 1 freq upcome - 2 freq upgiein - 1 freq upheezin - 2 freq upbiggin - 14 freq upgaun - 2 freq ups-an-douns - 1 freq upgeen - 1 freq upcumm - 1 freq upgyangin - 1 freq upcum - 2 freq upcomes - 1 freq upcommin - 1 freq ufqqzmie - 1 freq upgmlvtpq - 1 freq upcomin - 3 freq uofgenglishlang - 4 freq upcoming - 3 freq |
MetaPhone code - UPKMN upcommin - 1 freq upcomin - 3 freq |
UPCOMIN |
| Time to execute Levenshtein function - 0.242891 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.442560 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.059192 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.037542 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.000771 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. |