Data matching scenarios
- Grouping output data in separate flows according to the minimal distance computed in each record
- Matching customer data through multiple passes
- Matching entries using the Q-grams and Levenshtein algorithms
- Using a custom matching algorithm to match entries
- Using survivorship functions to merge two records and create a master record