Tree-Adjoining Language Parsing in O(n^6 ) Time
From MaRDI portal
Publication:4895833
Recommendations
Cited in
(18)- Tabulation of automata for tree-adjoining languages
- An NC algorithm for recognizing tree adjoining languages
- Parallel parsing of tree adjoining grammars on the connection machine
- Implementation and Application of Automata
- scientific article; zbMATH DE number 3843161 (Why is no real title available?)
- scientific article; zbMATH DE number 1974076 (Why is no real title available?)
- Bilexical grammars and their cubic-time parsing algorithms
- TAL recognition in O(M(n^2)) time
- Clique-based lower bounds for parsing tree-adjoining grammars
- Tree parsing for tree-adjoining machine translation
- Linearity and nondeletion on monadic context-free tree grammars
- Enhancing practical TAG parsing efficiency by capturing redundancy
- TuLiPA -- parsing extensions of TAG with range concatenation grammars
- On parsing coupled-context-free languages
- An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
- LR(k)-coupled-context-free grammars
- Linear algorithm for lexicographic enumeration of CFG parse trees
- scientific article; zbMATH DE number 777296 (Why is no real title available?)
This page was built for publication: Tree-Adjoining Language Parsing in $O(n^6 )$ Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895833)
