A Comparative Evaluation of Name-Matching Algorithms

Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management systems. The naming conventions peculiar to legal cases limit the effectiveness of generic approximate string-matching algorithms in this task. This paper proposes a three-stage framework for name matching, identifies how each stage in the framework addresses the naming variations that typically arise in legal cases, describes several alternative approaches to each stage, and evaluates the performance of various combinations of the alternatives on a representative collection of names drawn from a United States District Court case management system. The best tradeoff between accuracy and efficiency in this collection was achieved by algorithms that standardize capitalization, spacing, and ion; filter redundant terms; index using an abstraction function that is both order-insensitive and tolerant of small numbers of...

• Type: Conference
• Year: 2003
• Where: ICAIL
• Authors: Karl Branting
• Keywords: Approximate String-matching Algorithms, ICAIL 2003, Legal Cases, United States District Court