Guides and Oracles for Linear-Time Parsing

Martin Kay


Abstract
If chart parsing is taken to include the process of reading out solutions one by one, then it has exponential complexity. The stratagem of separating read-out from chart construction can also be applied to other kinds of parser, in particular, to left-comer parsers that use early composition. When a limit is placed on the size of the stack in such a parser, it becomes context-free equivalent. However, it is not practical to profit directly from this observation because of the large state sets that are involved in otherwise ordinary situations. It may be possible to overcome these problems by means of a guide constructed from a weakened version of the initial grammar.
Anthology ID:
2000.iwpt-1.3
Volume:
Proceedings of the Sixth International Workshop on Parsing Technologies
Month:
February 23-25
Year:
2000
Address:
Trento, Italy
Editors:
Alberto Lavelli, John Carroll, Robert C. Berwick, Harry C. Bunt, Bob Carpenter, John Carroll, Ken Church, Mark Johnson, Aravind Joshi, Ronald Kaplan, Martin Kay, Bernard Lang, Alon Lavie, Anton Nijholt, Christer Samuelsson, Mark Steedman, Oliviero Stock, Hozumi Tanaka, Masaru Tomita, Hans Uszkoreit, K. Vijay-Shanker, David Weir, Mats Wiren
Venue:
IWPT
SIG:
SIGPARSE
Publisher:
Association for Computational Linguistics
Note:
Pages:
6–10
Language:
URL:
https://aclanthology.org/2000.iwpt-1.3
DOI:
Bibkey:
Cite (ACL):
Martin Kay. 2000. Guides and Oracles for Linear-Time Parsing. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 6–10, Trento, Italy. Association for Computational Linguistics.
Cite (Informal):
Guides and Oracles for Linear-Time Parsing (Kay, IWPT 2000)
Copy Citation:
PDF:
https://aclanthology.org/2000.iwpt-1.3.pdf