Abstract
Coordination in natural language (as in “Tom and Jerry”, “John built but Mary painted the cupboard”, “publish or perish”) is one of the most difficult computational linguistic problems. Not only can it affect any type of constituent, but it often involves “guessing” material left implicit. We introduce a CHR methodology for extending a user’s grammar not including coordination with a metagrammatical treatment of same category coordination. Our methodology relies on the input grammar describing its semantics compositionally. It involves reifying grammar symbols into arguments of a generic symbol constituent, and adding three more rules to the user’s grammar. These three rules can coordinate practically any kind of constituent while reconstructing any missing material at the appropriate point. With respect to previous work, this is powerfully laconic as well as surprisingly minimal in the transformations and overhead required.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdennadher, S., Schtz, H.: CHR: A Flexible Query Language. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS, vol. 1495, p. 1. Springer, Heidelberg (1998)
Balsa, J., Dahl, V., Pereira Lopes, J.G.: Datalog Grammars for Abductive Syntactic Error Diagnosis and Repair. In: Proceedings of the Natural Language Understanding and Logic Programming Workshop, Lisbon (1995)
Bès, G., Blache, P.: Propriétés et analyse d’un langage. In: Proceedings of TALN 1999 (1999)
Bès, G., Blache, P., Hagège, C.: The 5P Paradigm. Research report, GRIL/LPL (1999)
Blache, P., Azulay, D.-O.: Parsing ill-formed inputs with constraint graphs. In: Gelbukh, A. (ed.) CICLing 2002. LNCS, vol. 2276, pp. 220–229. Springer, Heidelberg (2002)
Christiansen, H., Dahl, V.: Logic Grammars for Diagnosis and Repair. In: Proceedings of 14th IEEE International Conference on Tools with Artificial Intelligence, Washington D.C, pp. 307–314 (2002)
Christiansen, H.: Logical Grammars Based on Constraint Handling Rules(Poster abstract). In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, p. 481. Springer, Heidelberg (2002)
Christiansen, H.: Abductive Language Interpretation as Bottom-up Deduction. In: Wintner, S. (ed.) Proc. NLULP 2002, Natural Language Understanding and Logic Programming, Copenhagen, Denmark, pp. 33–48 (2002)
Christiansen, H.: CHR as Grammar Formalism, a First Report. In: Sixth Annual Workshop of the ERCIM Working Group on Constraints, Prague (2001)
Dahl, V., Blache, P.: Directly Executable Constraint Based Grammars. In: Proc. Journees Francophones de Programmation en Logique avec Contraintes, Angers, France (2004)
Dahl, V.: On Implicit Meanings. In: Sadri, F., Kakas, T. (eds.) Computational Logic: from Logic Programming into the Future. Springer, Heidelberg (2002)
Dahl, V., Tarau, P., Li, R.: Assumption Grammars for Processing Natural Language. In: Fourteenth International Conference on Logic Programming, pp. 256–270. MIT Press, Cambridge (1997)
Dahl, V., McCord, M.: Treating Coordination in Logic Grammars. American Journal of Computational Linguistics 9, 69–91 (1983)
Darlymple, M., Shieber, S., Pereira, F.: Ellipsis and Higher-Order Unification. Linguistics and Philosophy 14(4), 399–452 (1991)
Fruhwirth, T.W.: Theory and Practice of Constraint Handling Rules. Journal of Logic Programming 37, 95–138 (1998)
Haugeneder, H.: A Computational Model for Processing Coordinate Structures: Parsing Coordination will-out Grammatical Specification. In: ECAI 1992, pp. 513–517 (1992)
Kakas, A.C., Michael, A., Mourlas, C.: ACLP: Abductive Constraint Logic Programming. The Journal of Logic Programming 44, 129–177 (2000)
Kehler, A., Shieber, S.: Anaphoric Dependencies in Ellipsis. Computational Linguistics 23(3) (1997)
Milward, D.: Non-Constituent Coordination: Theory and Practice. In: Proceedings of COLING 1994, Kyoto, Japan, pp. 935–941 (1994)
Park, J.C., Cho, H.J.: Informed Parsing for Coordination with Combinatory Categorial Grammar. In: COLING 2000, pp. 593–599 (2000)
Steedman, M.: Gapping as Constituent Coordination. Linguistics and Philosophy (1990)
Voll, K., Yeh, T., Dahl, V.: An Assumptive Logic Programming Methodology for Parsing. International Journal on Artificial Intelligence Tools (2001)
Woods, W.: An Experimental Parsing System for Translation Network Grammars. In: Rustin, R. (ed.) Natural Language Processing, pp. 145–149. Algorithmic Press, New York (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aguilar-Solis, D., Dahl, V. (2004). Coordination Revisited – A Constraint Handling Rule Approach. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-30498-2_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23806-5
Online ISBN: 978-3-540-30498-2
eBook Packages: Springer Book Archive