| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| code-mixin (0) - 1 freq coal-minin (3) - 1 freq covemin (4) - 1 freq code-driftin (4) - 1 freq cake-makin (4) - 2 freq co-bidin (4) - 1 freq couerin (5) - 1 freq crexin (5) - 2 freq collidin (5) - 1 freq leemitin (5) - 1 freq non-livin (5) - 1 freq cleikin (5) - 4 freq coemmaan (5) - 1 freq comprisin (5) - 2 freq condamnin (5) - 1 freq beamiin (5) - 1 freq code-switchin (5) - 5 freq codlin (5) - 3 freq committin (5) - 2 freq bohemian (5) - 2 freq coaxin (5) - 5 freq score-in (5) - 2 freq deprivin (5) - 1 freq deridin (5) - 1 freq comin (5) - 1056 freq |
code-mixin (0) - 1 freq coal-minin (5) - 1 freq cake-makin (6) - 2 freq con-man (7) - 1 freq co-bidin (7) - 1 freq covemin (7) - 1 freq cie-men (7) - 1 freq coddlin (8) - 1 freq comedian (8) - 4 freq commadin (8) - 1 freq lodesman (8) - 2 freq admirin (8) - 22 freq clood-man (8) - 1 freq bodmin (8) - 1 freq consumin (8) - 3 freq com-comin (8) - 1 freq commutin (8) - 1 freq corinmain (8) - 2 freq collie-foxin (8) - 1 freq mixin (8) - 13 freq coddin (8) - 2 freq codeine (8) - 1 freq de-juicin (8) - 1 freq communin (8) - 1 freq byde-in (8) - 1 freq |
SoundEx code - C352 cuttins - 5 freq cadence - 2 freq cotton-candy - 1 freq cautions - 1 freq cutting - 16 freq caithness - 23 freq cadences - 1 freq chutneys - 1 freq cuidnac - 1 freq cutteen's - 1 freq cuithins - 1 freq cadenced - 1 freq catmoget - 2 freq couthieness - 2 freq cuttin's - 1 freq cuttance - 7 freq code-mixin - 1 freq caithnessian - 1 freq coating - 1 freq cheitting - 1 freq couthiness - 1 freq cdancer - 12 freq coding - 1 freq codonas - 1 freq cuttings - 1 freq cathymcrorie - 4 freq caithnessorg - 1 freq cdms - 1 freq caithnessfootie - 5 freq cheating - 1 freq |
MetaPhone code - KTMKSN code-mixin - 1 freq |
CODE-MIXIN |
| Time to execute Levenshtein function - 0.221245 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.358288 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.027689 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.037643 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.000752 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. |