| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uptick (0) - 1 freq spick (2) - 95 freq upteuk (2) - 1 freq 'stick (2) - 4 freq uptakk (2) - 5 freq uptak (2) - 14 freq pick (2) - 290 freq unstick (2) - 1 freq 'pick (2) - 2 freq stick (2) - 372 freq optics (2) - 2 freq uptill (2) - 1 freq attick (2) - 1 freq tick (2) - 69 freq prick (2) - 70 freq uptuik (2) - 1 freq gumpick (3) - 1 freq stink (3) - 52 freq uptaen (3) - 1 freq uztipf (3) - 2 freq epic (3) - 20 freq nuptial (3) - 8 freq saick (3) - 1 freq picks (3) - 26 freq olick (3) - 1 freq |
uptick (0) - 1 freq optics (3) - 2 freq tick (3) - 69 freq uptuik (3) - 1 freq stick (3) - 372 freq prick (3) - 70 freq attick (3) - 1 freq uptakk (3) - 5 freq upteuk (3) - 1 freq uptak (3) - 14 freq pick (3) - 290 freq attack (4) - 80 freq pcik (4) - 1 freq sutck (4) - 1 freq exotick (4) - 1 freq peck (4) - 20 freq pack (4) - 114 freq teeick (4) - 2 freq teck (4) - 1 freq deteck (4) - 1 freq i'tuck (4) - 5 freq pluck (4) - 11 freq tack (4) - 43 freq patrick (4) - 32 freq ticky (4) - 2 freq |
SoundEx code - U132 uptak - 14 freq uphauds - 8 freq uptake - 4 freq uptight - 3 freq uptuik - 1 freq uptakk - 5 freq upteuk - 1 freq uptick - 1 freq up-the-skirt - 1 freq uibtx - 1 freq ufodgayvuo - 1 freq |
MetaPhone code - UPTK uptak - 14 freq uptake - 4 freq uptuik - 1 freq uptakk - 5 freq upteuk - 1 freq uptick - 1 freq |
UPTICK |
| Time to execute Levenshtein function - 0.191581 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.334814 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.031345 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.047632 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.001177 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. |