| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| co-design (0) - 4 freq design (3) - 36 freq consign (3) - 1 freq cohesion (3) - 8 freq roadsign (3) - 1 freq covemin (4) - 1 freq codes (4) - 4 freq foreign (4) - 69 freq collision (4) - 5 freq collusion (4) - 1 freq coursin (4) - 1 freq clydeside (4) - 4 freq composin (4) - 3 freq roadsigns (4) - 2 freq condemn (4) - 19 freq resign (4) - 2 freq road-signs (4) - 1 freq concession (4) - 2 freq designs (4) - 9 freq co-exist (4) - 1 freq creesin (4) - 1 freq orderin (4) - 10 freq cowdlin (4) - 1 freq cowerin (4) - 5 freq condeetion (4) - 5 freq |
co-design (0) - 4 freq design (5) - 36 freq roadsign (5) - 1 freq consign (5) - 1 freq condeeshun (6) - 2 freq cohesion (6) - 8 freq comission (7) - 1 freq co-bidin (7) - 1 freq confession (7) - 10 freq collegian (7) - 1 freq consigns (7) - 1 freq codlin (7) - 3 freq design' (7) - 1 freq codeine (7) - 1 freq cadgin (7) - 2 freq condescend (7) - 3 freq coddlin (7) - 1 freq comedian (7) - 5 freq condition (7) - 36 freq coorsin (7) - 2 freq designt (7) - 1 freq deign (7) - 1 freq condeition (7) - 3 freq cardigan (7) - 18 freq cartesian (7) - 1 freq |
SoundEx code - C322 catches - 34 freq catechism - 5 freq cottages - 30 freq catche's - 1 freq co-design - 4 freq catecheezin - 1 freq catechisms - 2 freq cod-sweech - 1 freq catakehisdrink - 1 freq cduissiqx - 1 freq citycycling - 1 freq |
MetaPhone code - KTSN co-design - 4 freq cítizen - 1 freq kitson - 1 freq guidson - 4 freq |
CO-DESIGN |
| Time to execute Levenshtein function - 0.271630 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.407874 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.029127 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.038390 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.000951 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. |