| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upmerkat (0) - 1 freq upmarket (2) - 1 freq merkat (2) - 6 freq unmerkit (2) - 2 freq uppercut (3) - 1 freq perkit (3) - 3 freq temerat (3) - 1 freq unmarkt (3) - 1 freq mereat (3) - 1 freq merket (3) - 7 freq merkt (3) - 5 freq merkit (3) - 32 freq unmarkit (3) - 1 freq i'merket (3) - 1 freq mercat (3) - 67 freq €˜mercat (3) - 1 freq upbeat (3) - 4 freq upmakkit (3) - 3 freq upmairket (3) - 1 freq remerkit (3) - 2 freq smirkan (4) - 1 freq unwarkit (4) - 1 freq utteran (4) - 1 freq mirkit (4) - 1 freq sperkin (4) - 1 freq |
upmerkat (0) - 1 freq upmarket (2) - 1 freq unmerkit (3) - 2 freq upmairket (3) - 1 freq merkat (3) - 6 freq i'merket (4) - 1 freq unmarkit (4) - 1 freq upmakkit (4) - 3 freq merkt (4) - 5 freq remerkit (4) - 2 freq merkit (4) - 32 freq perkit (4) - 3 freq unmarkt (4) - 1 freq merket (4) - 7 freq remarkit (5) - 5 freq parket (5) - 3 freq markit (5) - 18 freq meerkit (5) - 1 freq remarkt (5) - 7 freq market (5) - 51 freq mirkit (5) - 1 freq smirkt (5) - 1 freq parkt (5) - 1 freq mereat (5) - 1 freq temerat (5) - 1 freq |
SoundEx code - U156 upmairket - 1 freq upmarket - 1 freq up-an-rinnin - 1 freq upmerkat - 1 freq up-in-arms - 1 freq |
MetaPhone code - UPMRKT upmairket - 1 freq upmarket - 1 freq upmerkat - 1 freq |
UPMERKAT |
| Time to execute Levenshtein function - 0.214463 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.383559 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.029293 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.040572 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.000875 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. |