Parallel parsing for unification grammars

Authors:
Andrew Haas
Affiliations:
BBN Labs Inc., Cambridge, Massachusetts
Venue:
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Year:
1987

Citing 2
Cited 1

An Improved Context-Free Recognizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
Using restriction to extend parsing algorithms for complex-feature-based formalisms

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics

A parallel parser for spoken natural language

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

The parsing problem for arbitrary unification grammars is unsolvable We present a class of unification grammars for whcih the parsing problem is solvable and a parallel parsing algorithm for this class of grammars.