Record Matching via Finite State Automata
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Record matching is computationally intensive, often requiring quadratic complexity in time, which can be intractable as the number of records grows, due to existing methods that compare each record to every other record.
Innovation Solution
The method involves generating regular expressions for each record, combining them to create a combined finite state representation, and processing this representation to identify matches, reducing computational effort to linear complexity using a computer system with components like a regex generator, combiner, and state machine generator.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If each record is compared to every other record using traditional record matching methods, then matching accuracy is maintained, but computational time increases to quadratic complexity
Solution Approach 1:
The patent introduces a hashing function as an intermediary mechanism that transforms record comparison into a more efficient process. By converting record attributes into hash values and comparing these hashes rather than the full records, the system maintains matching accuracy while significantly reducing computational time complexity from quadratic to linear.
Solution Approach 2:
The patent replaces the mechanical system of direct record-by-record comparison with a computational system based on hashing and finite state representations. This substitution transforms the brute-force approach into an optimized algorithm that processes records through regular expression matching against combined finite state representations, achieving linear time complexity.
2Reliability
If traditional record matching methods are used, then matching reliability is maintained, but device complexity increases due to quadratic processing requirements
Solution Approach 1:
The patent segments the record matching process into distinct components: generating regular expressions from records, combining these expressions into a unified pattern, and using finite state representations to process matches. This segmentation allows each component to be optimized independently and reduces overall processing complexity while maintaining reliability.
Solution Approach 2:
The patent changes the fundamental parameters of the matching process by transforming record data into regular expressions and then into finite state representations. This parameter transformation enables the system to maintain matching reliability while reducing the computational resources required, as the finite state representation can be processed in linear time.
Data Source
AI summary
A system and method of record matching using regular expressions and finite state representations. In this manner, the time (or computational effort) involved in record matching is reduced.