Compiling Typed Attribute-Value Logic Grammars

Bob Carpenter


Abstract
The unification-based approach to processing attribute-value logic grammars, similar to Prolog interpretation, has become the standard. We propose an alternative, embodied in the Attribute-Logic Engine (ALE) (Carpenter 1993) , based on the Warren Abstract Machine (WAM) approach to compiling Prolog (Aït-Kaci 1991). Phrase structure grammars with procedural attachments, similar to Definite Clause Grammars (DCG) (Pereira — Warren 1980), are specified using a typed version of Rounds-Kasper logic (Carpenter 1992). We argue for the benefits of a strong and total version of typing in terms of both clarity and efficiency. Finally, we discuss the compilation of grammars into a few efficient low-level instructions for the basic feature structure operations.
Anthology ID:
1993.iwpt-1.5
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:
39–48
Language:
URL:
https://aclanthology.org/1993.iwpt-1.5
DOI:
Bibkey:
Cite (ACL):
Bob Carpenter. 1993. Compiling Typed Attribute-Value Logic Grammars. In Proceedings of the Third International Workshop on Parsing Technologies, pages 39–48, Tilburg, Netherlands and Durbuy, Belgium. Association for Computational Linguistics.
Cite (Informal):
Compiling Typed Attribute-Value Logic Grammars (Carpenter, IWPT 1993)
Copy Citation:
PDF:
https://aclanthology.org/1993.iwpt-1.5.pdf