An approximate string-matching algorithm

DOI10.1016/0304-3975(92)90138-6zbMath0747.68022OpenAlexW2023843553MaRDI QIDQ1190457

Jong Yong Kim, John Shawe-Taylor

Publication date: 26 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90138-6

zbMATH Keywords

trie\(n\)-gramsapproximate string-matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (5)

Multiple filtration and approximate pattern matching ⋮ Fast Approximate Search in Large Dictionaries ⋮ Red flag algorithms for Brazilian electronic invoices: outlier detection and price risk classification ⋮ A high-speed dynamic full-text search method by using memory management ⋮ Fast String Matching in Stationary Ergodic Sources

Cites Work

• Unnamed Item
• Fast String Matching in Stationary Ergodic Sources
• A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words
• Fast parallel and serial approximate string matching
• The String-to-String Correction Problem

This page was built for publication: An approximate string-matching algorithm