Reducing Complexity in A Systemic Parser

Michael O’Donnell


Abstract
Parsing with a large systemic grammar brings one face-to-face with the problem of unification with disjunctive descriptions. This paper outlines some techniques which we employed in a systemic parser to reduce the average-case complexity of such unification.
Anthology ID:
1993.iwpt-1.17
Volume:
Proceedings of the Third International Workshop on Parsing Technologies
Month:
August 10-13
Year:
1993
Address:
Tilburg, Netherlands and Durbuy, Belgium
Editors:
Harry Bunt, Robert Berwick, Ken Church, Aravind Joshi, Ronald Kaplan, Martin Kay, Bernard Lang, Makoto Nagao, Anton Nijholt, Mark Steedman, Henry Thompson, Masaru Tomita, K. Vijay-Shanker, Yorick Wilks, Kent Wittenburg
Venue:
IWPT
SIG:
SIGPARSE
Publisher:
Association for Computational Linguistics
Note:
Pages:
203–218
Language:
URL:
https://aclanthology.org/1993.iwpt-1.17
DOI:
Bibkey:
Cite (ACL):
Michael O’Donnell. 1993. Reducing Complexity in A Systemic Parser. In Proceedings of the Third International Workshop on Parsing Technologies, pages 203–218, Tilburg, Netherlands and Durbuy, Belgium. Association for Computational Linguistics.
Cite (Informal):
Reducing Complexity in A Systemic Parser (O’Donnell, IWPT 1993)
Copy Citation:
PDF:
https://aclanthology.org/1993.iwpt-1.17.pdf