Efficient error-correcting parsing for (attributed and stochastic) tree grammars
From MaRDI portal
Publication:1837542
DOI10.1016/0020-0255(82)90040-8zbMath0507.68057MaRDI QIDQ1837542
Publication date: 1982
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(82)90040-8
expansive tree grammar; handprinted-character recognition; maximum-likelihood error-correcting parser; minimum-distance error-correcting parser
Related Items
Cites Work
- Unnamed Item
- A faster algorithm computing string edit distances
- Syntactic methods in pattern recognition
- Parallel parsing of tree languages for syntactic pattern recognition
- Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
- A Pattern Deformational Model and Bayes Error-Correcting Recognition System
- Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns
- Error-Correcting Tree Automata for Syntactic Pattern Recognition