Parallel parsing of tree adjoining grammars on the connection machine
From MaRDI portal
Publication:685085
Recommendations
Cites work
- scientific article; zbMATH DE number 3926247 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
- Routing, merging, and sorting on parallel models of computation
- Speed of Recognition of Context-Free Languages by Array Automata
- Tight bounds for oblivious routing in the hypercube
- Tree adjunct grammars
- Tree-size bounded alternation
- Upper bounds on recognition of a hierarchy of non-context-free languages
Cited in
(9)- An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
- Clique-based lower bounds for parsing tree-adjoining grammars
- D-LTAG system: Discourse parsing with a lexicalized tree-adjoining grammar
- scientific article; zbMATH DE number 1974076 (Why is no real title available?)
- An NC algorithm for recognizing tree adjoining languages
- Parallel parsing on the connection machine
- TAL recognition in \(O(M(n^2))\) time
- Enhancing practical TAG parsing efficiency by capturing redundancy
- scientific article; zbMATH DE number 3843161 (Why is no real title available?)
This page was built for publication: Parallel parsing of tree adjoining grammars on the connection machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685085)