An approximate string-matching algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words
- Fast parallel and serial approximate string matching
- Fast string matching in stationary ergodic sources
- The String-to-String Correction Problem
Cited in
(14)- Average-case analysis of approximate trie search
- Multiple approximate string matching
- Fast string matching in stationary ergodic sources
- Combinatorial Pattern Matching
- Red flag algorithms for Brazilian electronic invoices: outlier detection and price risk classification
- A novel look-ahead optimization strategy for trie-based approximate string matching
- Multiple filtration and approximate pattern matching
- A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
- A high-speed dynamic full-text search method by using memory management
- Fast approximate search in large dictionaries
- An integer linear programming approach for approximate string comparison
- An analysis of the Karp-Rabin string matching algorithm
- Simple Optimal String Matching Algorithm
- Approximate String Matching: A Simpler Faster Algorithm
This page was built for publication: An approximate string-matching algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190457)