Matchcode Optimization:Swap Matching: Difference between revisions
No edit summary |
No edit summary |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{MatchcodeOptimizationNav | |||
|MatchcodeOptimizationCollapse= | |||
}} | |||
*[[ | ==Swap Matching== | ||
===Specifics=== | |||
*[[MatchUp Object:Swap Matching Uses|Swap Matching Uses]] | |||
===Summary=== | |||
Swap matching is used to catch matches when two field values are flipped around. The most common occasion is catching the “John Smith” and “Smith John” records, or when the database contains multiple phone or email fields. | |||
===Returns=== | |||
A match if configured for ‘Both’ components or configured as ‘Either’ component matches where ‘Both’ is defined as a match when both values match before being flipped, or when both values match after the second record has its field values flipped. | |||
‘Either’ is defined as match when either of the two values match before being flipped, or when either of the two values match after the second record has its field values flipped. | |||
===Example Matchcode Usage 1=== | |||
:[[File:MCO_Algorithm_Swap_Half.png|link=]] | |||
===Example Data 1=== | |||
{{ExampleDataTableV1|STRING1|STRING2|RESULT | |||
|AdditionalRows= | |||
{{EDTRow|Green|John|Smith|Match Found}} | |||
{{EDTRow|Green|Smith|John|Match Found}} | |||
}} | |||
===Example Matchcode Usage 2=== | |||
:[[File:MCO_Algorithm_Swap_Full.png|link=]] | |||
===Examlpe Data 2=== | |||
{{ExampleDataTableV1|STRING1|STRING2|RESULT | |||
|AdditionalRows= | |||
{{EDTRow|Red|781-660-0004| |Match Found}} | |||
{{EDTRow|Red|781-640-7777|781-660-0004|Match Found}} | |||
}} | |||
{{MatchcodePerformance | |||
|Performance1= | |||
|Matches2= | |||
}} | |||
===Recommended Usage=== | |||
Hybrid deduper, where a single incoming record can quickly be evaluated independently against each record in an existing large master database. | |||
Small batch runs, or larger batch runs when higher listed matchcode components have efficiently grouped records by clustering and therefore reduced the number of records that need to have swapping attempted. | |||
===Not Recommended For=== | |||
Large or Enterprise level batch runs. Since the swapping must be evaluated for each record comparison, throughput will be very slow. Each swapping attempt takes a late speed hit similar to when using a fuzzy algorithm. | |||
[[Category:MatchUp Hub]] | |||
[[Category:Matchcode Optimization]] | |||
Latest revision as of 23:39, 21 September 2018
Swap Matching
Specifics
Summary
Swap matching is used to catch matches when two field values are flipped around. The most common occasion is catching the “John Smith” and “Smith John” records, or when the database contains multiple phone or email fields.
Returns
A match if configured for ‘Both’ components or configured as ‘Either’ component matches where ‘Both’ is defined as a match when both values match before being flipped, or when both values match after the second record has its field values flipped.
‘Either’ is defined as match when either of the two values match before being flipped, or when either of the two values match after the second record has its field values flipped.
Example Matchcode Usage 1
Example Data 1
STRING1 STRING2 RESULT John Smith Match Found Smith John Match Found
Example Matchcode Usage 2
Examlpe Data 2
STRING1 STRING2 RESULT 781-660-0004 Match Found 781-640-7777 781-660-0004 Match Found
| 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.
Small batch runs, or larger batch runs when higher listed matchcode components have efficiently grouped records by clustering and therefore reduced the number of records that need to have swapping attempted.
Not Recommended For
Large or Enterprise level batch runs. Since the swapping must be evaluated for each record comparison, throughput will be very slow. Each swapping attempt takes a late speed hit similar to when using a fuzzy algorithm.