Abstract
We describe an extension of Earley’s algorithm which computes the decoration of a shared forest in a generic domain. At tribute computations are defined by a morphism from leftmost derivations to the generic domain, which leaves the computations independent from (even if guided by) the parsing strategy. The approach is illustrated by the example of a definite clause grammar, seen as CF-grammars decorated by attributes.- Anthology ID:
- 1997.iwpt-1.23
- 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:
- 199–209
- Language:
- URL:
- https://aclanthology.org/1997.iwpt-1.23
- DOI:
- Cite (ACL):
- Frederic Tendeau. 1997. An Earley Algorithm for Generic Attribute Augmented Grammars and Applications. In Proceedings of the Fifth International Workshop on Parsing Technologies, pages 199–209, Boston/Cambridge, Massachusetts, USA. Association for Computational Linguistics.
- Cite (Informal):
- An Earley Algorithm for Generic Attribute Augmented Grammars and Applications (Tendeau, IWPT 1997)
- PDF:
- https://preview.aclanthology.org/corrections-2024-07/1997.iwpt-1.23.pdf