Breadth-first search strategies for trie-based syntactic pattern recognition

DOI10.1007/s10044-006-0032-zzbMath1423.68400OpenAlexW2054767096WikidataQ60327930 ScholiaQ60327930MaRDI QIDQ2383946

Ghada Badr, B. John Oommen

Publication date: 20 September 2007

Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10044-006-0032-z

zbMATH Keywords

approximate string matchingnoisy syntactic recognition using triestrie-based syntactic pattern recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Data structures (68P05)

Related Items

Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Constrained string editing
• A faster algorithm computing string edit distances
• Fast string correction with Levenshtein automata
• Fast approximate matching of words against a dictionary
• Dictionary matching and indexing with errors and don't cares
• Algorithms for approximate string matching
• Recognition of Noisy Subsequences Using Constrained Edit Distances
• A Method for the Correction of Garbled Words Based on the Levenshtein Metric
• Order- n correction for regular languages
• The String-to-String Correction Problem
• Structural, Syntactic, and Statistical Pattern Recognition
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm