Abstract
This paper presents a Conceptual Graph (cg) framework to the Generation of Referring Expressions (gre). Employing Conceptual Graphs as the underlying formalism allows a new rigorous, semantically rich, approach to gre: the intended referent is indentified by a combination of facts that can be deduced in its presence but not if it would be absent. Since cgs allow a substantial generalisation of the GRE problem, we show how the resulting formalism can be used by a gre algorithm that refers uniquely to objects in the scene.
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
Chein, M., Mugnier, M.-L.: Conceptual graphs: Fundamental notions. Revue d’Intelligence Artificielle 6(4), 365 (1992)
Croitoru, M., Compatangelo, E.: A combinatorial approach to conceptual graph projection checking. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, Springer, Heidelberg (2004)
Croitoru, M., van Deemter, K.: A Conceptual Graph approach for the generation of referring expressions. In: Proc. of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007 (to appear)
Dale, R., Haddock, N.: Generating referring expressions containing relations. In: EACL-91. Procs. of the 5th Conference of the European Chapter of the ACL (1991)
Dale, R., Reiter, E.: Computational Interpretations of the Gricean Maximes in the Generation of Referring Expressions. Cognitive Science 18, 233–263 (1995)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. In: Belz, A., Evans, R., Piwek, P. (eds.) INLG 2004. LNCS (LNAI), vol. 3123, pp. 70–79. Springer, Heidelberg (2004)
Krahmer, E., van Erk, S., Verleg, A.: Graph-based Generation of Referring Expressions. Computational Linguistics 29(1), 53–72, 2003 (to appear)
Sowa, J.F.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, London, UK (1984)
van Deemter, K.: Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm. Computational Linguistics 28(1), 37–52 (2002)
van Deemter, K., Krahmer, E.: Graphs and Booleans: on the generation of referring expressions. In: Computing Meaning, Studies in Linguistics and Philosophy, vol. 3, Kluwer, Dordrecht (in press)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Croitoru, M., van Deemter, K. (2007). An Inferential Approach to the Generation of Referring Expressions. In: Priss, U., Polovina, S., Hill, R. (eds) Conceptual Structures: Knowledge Architectures for Smart Applications. ICCS 2007. Lecture Notes in Computer Science(), vol 4604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73681-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-73681-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73680-6
Online ISBN: 978-3-540-73681-3
eBook Packages: Computer ScienceComputer Science (R0)