A Minimum Distance Error-Correcting Parser for Context-Free Languages
From MaRDI portal
Publication:5652221
DOI10.1137/0201022zbMath0241.68038OpenAlexW2049216468WikidataQ56018897 ScholiaQ56018897MaRDI QIDQ5652221
Publication date: 1972
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0201022
Related Items
Incremental parsing in language-based editors: user needs and how to meet them ⋮ Edit Distance for Pushdown Automata ⋮ How hard is to compute the edit distance ⋮ If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser ⋮ Weak inverse neighborhoods of languages ⋮ Fundamental methodological issues of syntactic pattern recognition ⋮ A note on some tree similarity measures ⋮ Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product ⋮ Approximately matching context-free languages ⋮ Syntactic error repair using repair patterns ⋮ The intractability of computing the Hamming distance ⋮ Visibly Pushdown Transducers for Approximate Validation of Streaming XML ⋮ Input-driven pushdown automata for edit distance neighborhood ⋮ A scheme for lr(k) parsing with error recovery part iii: error correction ⋮ Edit distance neighbourhoods of input-driven pushdown automata ⋮ Edit distance neighbourhoods of input-driven pushdown automata ⋮ How hard is computing the edit distance? ⋮ The utilization of fuzzy sets in the recognition of imperfect strings ⋮ Technical analysis for portofolio trading by syntactic pattern recognition ⋮ Approximate matching between a context-free grammar and a finite-state automaton ⋮ Hierarchic syntax error repair for LR grammars ⋮ Regular algebra applied to language problems
