Parallel parsing of tree adjoining grammars on the connection machine

DOI10.1007/BF01379313zbMath0776.68077OpenAlexW1968335340MaRDI QIDQ685085

David S. L. Wei, Michael A. Palis

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

zbMATH Keywords

natural language processingtree adjoining grammarsconnection machineparallel parsing

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42) Natural language processing (68T50) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Routing, merging, and sorting on parallel models of computation
• Tree-size bounded alternation
• Upper bounds on recognition of a hierarchy of non-context-free languages
• Tree adjunct grammars
• 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

This page was built for publication: Parallel parsing of tree adjoining grammars on the connection machine