A novel look-ahead optimization strategy for trie-based approximate string matching
From MaRDI portal
Publication:851727
DOI10.1007/s10044-006-0036-8zbMath1423.68397OpenAlexW2047848293WikidataQ60327964 ScholiaQ60327964MaRDI QIDQ851727
Publication date: 22 November 2006
Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10044-006-0036-8
pruningapproximate string matchingbranch-and-bound techniquesnoisy syntactic recognition using triestrie-based syntactic pattern recognition
Pattern recognition, speech recognition (68T10) Data structures (68P05) Algorithms on strings (68W32)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A faster algorithm computing string edit distances
- Algorithms for approximate string matching
- Recognition of Noisy Subsequences Using Constrained Edit Distances
- A linear space algorithm for computing maximal common subsequences
- A fast algorithm for computing longest common subsequences
- Order- n correction for regular languages
- The String-to-String Correction Problem
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices