Abstract
We present an implementation of the notion of modularity and composition applied to unification based grammars. Monolithic unification grammars can be decomposed into sub-grammars with well defined interfaces. Sub-grammars are applied in a sequential manner at runtime, allowing incremental development and testing of large coverage grammars. The modular approach to grammar development leads us away from the traditional view of parsing a string of input symbols as the recognition of some start symbol, and towards a richer and more flexible view where inputs and outputs share the same structural properties.- Anthology ID:
- 2000.iwpt-1.27
- 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:
- 278–290
- Language:
- URL:
- https://aclanthology.org/2000.iwpt-1.27
- DOI:
- Cite (ACL):
- Rémi Zajac and Jan Amtrup. 2000. Modular Unification-based Parsers. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 278–290, Trento, Italy. Association for Computational Linguistics.
- Cite (Informal):
- Modular Unification-based Parsers (Zajac & Amtrup, IWPT 2000)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-4/2000.iwpt-1.27.pdf