| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uscn (0) - 61 freq usan (1) - 4 freq usin (1) - 97 freq usc (1) - 1 freq used (2) - 682 freq uun (2) - 1 freq uses (2) - 47 freq ksc (2) - 1 freq sco (2) - 13 freq usbf (2) - 14 freq sc (2) - 14 freq usb (2) - 2 freq sce (2) - 3 freq use (2) - 466 freq ubun (2) - 1 freq usli (2) - 1 freq usa (2) - 52 freq scc (2) - 1 freq sin (2) - 676 freq ycn (2) - 1 freq cn (2) - 2 freq usp (2) - 1 freq ssc (2) - 7 freq mustn (2) - 2 freq hsun (2) - 2 freq |
uscn (0) - 61 freq scan (2) - 23 freq usan (2) - 4 freq sicn (2) - 1 freq usc (2) - 1 freq usin (2) - 97 freq scen (2) - 1 freq tacn (3) - 2 freq san (3) - 46 freq isn (3) - 20 freq osc (3) - 3 freq isxcn (3) - 1 freq sct (3) - 1 freq gicn (3) - 1 freq tuscan (3) - 3 freq sch (3) - 4 freq lecn (3) - 1 freq sun (3) - 727 freq susan (3) - 20 freq secin (3) - 1 freq scl (3) - 1 freq sci (3) - 1 freq uncan (3) - 57 freq useco (3) - 1 freq ecn (3) - 2 freq |
SoundEx code - U250 usin - 97 freq ugsome - 65 freq uggin - 3 freq uisin - 105 freq uggsome - 7 freq uckin - 1 freq uissin - 1 freq uisein - 9 freq usin' - 1 freq usan - 4 freq uissan - 3 freq uscn - 61 freq uisin' - 1 freq -ukin - 1 freq uizin - 12 freq ugsumm - 1 freq ugsum - 2 freq usain - 1 freq uszxn - 1 freq uwxjm - 1 freq uzn - 1 freq |
MetaPhone code - USKN uscn - 61 freq |
USCN |
| Time to execute Levenshtein function - 0.209483 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.363184 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.028018 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.037990 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.001084 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. |