Tree-Adjoining Language Parsing in O(n^6 ) Time
From MaRDI portal
Publication:4895833
DOI10.1137/S009753979326009XzbMATH Open0855.68055MaRDI QIDQ4895833FDOQ4895833
Authors: Sanguthevar Rajasekaran 
Publication date: 9 December 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Natural language processing (68T50)
Cited In (18)
- Implementation and Application of Automata
- An NC algorithm for recognizing tree adjoining languages
- Parallel parsing of tree adjoining grammars on the connection machine
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Linear algorithm for lexicographic enumeration of CFG parse trees
- Tabulation of automata for tree-adjoining languages
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)
