Which of the following is NOT ,1 characteristic of n deterministic matching algorithm?

Deterministic matching algorithms rely on exact matches between data fields to determine if records

are the same. These algorithms require high-quality data because any discrepancy, such as

typographical errors or variations in data entry, can prevent a match.

Characteristics of deterministic matching:

It has a discrete all or nothing outcome (C).

It matches exact character to character of one or more fields (D).

All identifiers being matched have equal weight (E).

Since deterministic matching is highly dependent on the quality of the data being matched, option B

is incorrect.

Reference:

DAMA-DMBOK: Data Management Body of Knowledge (2nd Edition), Chapter 11: Reference and

Master Data Management.

"Master Data Management and Data Governance" by Alex Berson and Larry Dubov.