Matchcode Optimization:Exact
Exact
Specifics
Determines whether two values are identical.
Summary
Two values are compared against each other and determined to be a match if they are exactly the same.
Returns
Returns a match if two values are exactly the same.
Example Matchcode Component
Example Data
STRING1 STRING2 RESULT Johnson Jhnsn Unique Smith Smith Match Beaumarchais Bumarchay Unique Deanardo Dinardio Unique
| Performance | |||||
|---|---|---|---|---|---|
| Slower | Faster | ||||
| Matches | |||||
| More Matches | Greater Accuracy | ||||
Recommended Usage
Hybrid deduper, where a single incoming record can quickly be evaluated independently against each record in an existing large master database.
Batch processes where NGRAM is set on a single non-first matchcode component.
Databases created with abbreviations or similar word substitutions.
Multi word field data where a trailing word does not appear in every record in the expected group or data contains acceptable variations of one of the keywords.
Not Recommended For
Databases where the number of errors with relation to the string length result is a small number of common substrings.
Gather/scatter, survivorship, or record consolidation of sensitive data.
Quantifiable data or records with proprietary keywords not associated in our knowledgebase tables.
Do Not Use With
UTF-8 data. This algorithm was ported to MatchUp with the assumption that a character equals one byte, and therefore results may not be accurate if the data contains multi-byte characters.