Abstract
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that during parsing some of the computation associated with different structures is duplicated. This paper explores ways in which the grammar can be precompiled into finite state automata so that some of this shared structure results in shared computation at run-time.- Anthology ID:
- 1997.iwpt-1.11
- Volume:
- Proceedings of the Fifth International Workshop on Parsing Technologies
- Month:
- September 17-20
- Year:
- 1997
- Address:
- Boston/Cambridge, Massachusetts, USA
- Editors:
- Anton Nijholt, Robert C. Berwick, Harry C. Bunt, Bob Carpenter, Eva Hajicova, Mark Johnson, Aravind Joshi, Ronald Kaplan, Martin Kay, Bernard Lang, Alon Lavie, Makoto Nagao, Mark Steedman, Masaru Tomita, K. Vijay-Shanker, David Weir, Kent Wittenburg, Mats Wiren
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 66–76
- Language:
- URL:
- https://aclanthology.org/1997.iwpt-1.11
- DOI:
- Cite (ACL):
- Roger Evans and David Weir. 1997. Automaton-based Parsing for Lexicalised Grammars. In Proceedings of the Fifth International Workshop on Parsing Technologies, pages 66–76, Boston/Cambridge, Massachusetts, USA. Association for Computational Linguistics.
- Cite (Informal):
- Automaton-based Parsing for Lexicalised Grammars (Evans & Weir, IWPT 1997)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-4/1997.iwpt-1.11.pdf