Deterministic matching, also known as exact matching, relies on predefined rules and algorithms to parse and standardize data, ensuring that records are compared based on exact or standardized values. This approach uses defined patterns and rules to determine whether two records represent the same entity by matching key attributes exactly. Deterministic matching is precise and unambiguous, making it a common approach for high-certainty matching tasks, although it can be less flexible than probabilistic methods that allow for variations in data.

DAMA-DMBOK2 Guide: Chapter 10 -- Master and Reference Data Management

'Entity Resolution and Information Quality' by John R. Talburt