Theoretical and empirical comparisons of approximate string matching algorithms

1992/01/01 by William I. Chang, Jordan Lampe · 1 voice · 2 citations
Computer Science · #Algorithms and Data Compression #Natural Language Processing Techniques #Network Packet Processing and Optimization

paper · doi:10.1007/3-540-56024-6_14

crossref issued 1992/01/01 · crossref published 1992/01/01 · crossref published-print 1992/01/01 · openalex publication_date 1992/01/01 · crossref published-online 2005/06/04 · crossref created 2012/02/26 · crossref deposited 2021/04/28 · openalex created_date 2025/10/10 · crossref indexed 2026/06/01 · openalex updated_date 2026/07/29

Citations

• Fast Algorithms for Finding Nearest Common Ancestors

Cited by

• A guided tour to approximate string matching
• Finding approximate palindromes in strings

Discussions

• So Gonzalo Navarro used 'diagonal transition' in his '01 ASM survey. Some digging by him now found that it (first???) appears in Chang & Lampe '92. In fact, the 'transition' is not between adjacent d [bsky, 1 points, 0 comments]