A Minimum Distance Error-Correcting Parser for Context-Free Languages
From MaRDI portal
Publication:5652221
Cited in
(24)- Visibly Pushdown Transducers for Approximate Validation of Streaming XML
- Syntactic error repair using repair patterns
- Approximate matching between a context-free grammar and a finite-state automaton
- Incremental parsing in language-based editors: user needs and how to meet them
- Approximately matching context-free languages
- Edit distance neighbourhoods of input-driven pushdown automata
- Input-driven pushdown automata for edit distance neighborhood
- The intractability of computing the Hamming distance
- Edit distance neighbourhoods of input-driven pushdown automata
- A note on some tree similarity measures
- If the current clique algorithms are optimal, so is Valiant's parser
- The utilization of fuzzy sets in the recognition of imperfect strings
- Weak inverse neighborhoods of languages
- A scheme for lr(k) parsing with error recovery part iii: error correction
- How hard is computing the edit distance?
- Edit distance for pushdown automata
- Fundamental methodological issues of syntactic pattern recognition
- String editing under pattern constraints
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- Weighted edit distance computation: strings, trees, and Dyck
- Hierarchic syntax error repair for LR grammars
- How hard is to compute the edit distance
- Technical analysis for portofolio trading by syntactic pattern recognition
- Regular algebra applied to language problems
This page was built for publication: A Minimum Distance Error-Correcting Parser for Context-Free Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652221)
