Parallel parsing of tree adjoining grammars on the connection machine
From MaRDI portal
Publication:685085
DOI10.1007/BF01379313zbMATH Open0776.68077OpenAlexW1968335340MaRDI QIDQ685085FDOQ685085
Authors: Michael A. Palis, David S. L. Wei 
Publication date: 30 September 1993
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01379313
Recommendations
Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42) Distributed algorithms (68W15) Natural language processing (68T50)
Cites Work
- Title not available (Why is that?)
- Routing, merging, and sorting on parallel models of computation
- Tree adjunct grammars
- Upper bounds on recognition of a hierarchy of non-context-free languages
- Title not available (Why is that?)
- Tree-size bounded alternation
- Tight bounds for oblivious routing in the hypercube
- An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
- Speed of Recognition of Context-Free Languages by Array Automata
Cited In (8)
- An NC algorithm for recognizing tree adjoining languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- D-LTAG system: Discourse parsing with a lexicalized tree-adjoining grammar
- Parallel parsing on the connection machine
- Clique-based lower bounds for parsing tree-adjoining grammars
- Enhancing practical TAG parsing efficiency by capturing redundancy
- An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
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)
