Abstract
We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and negations. The focus of this paper is on generating referring expressions involving positive and negated relations. We describe rule-based overgeneration of referring expressions based on the notion of ‘extension’, and show how to constrain the search space by interleaving logical form generation with realization and expressing preferences by means of costs. Our chart-based framework allows us to develop a search-based solution to the problem of ‘recursive’ relations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bangalore, S., Rambow, O.: Exploiting a probabilistic hierarchical model for generation. In: Proceedings of COLING 2000 (2000)
Dale, R., Haddock, N.: Generating referring expressions involving relations. In: Proceedings of EACL 1991 (1991)
Dale, R., Reiter, E.: Computational interpretations of the gricean maxims in the generation of referring expressions. Cognitive Science 19, 233–263 (1995)
Friedman-Hill, E.: JESS - the Java Expert System Shell, Version 6.x. Sandia National Laboratories (2004)
Gardent, C.: Generating minimal definite descriptions. In: Proceedings of ACL 2002 (2002)
Green, N., Carenini, G., Moore, J.: A principled representation of attributive descriptions for generating integrated text and information graphics presentations. In: Proceedings of IWNLG 1998 (1998)
Horacek, H.: A best-first search algorithm for generating referring expression. In: Proceedings of EACL 2003 (2003)(research notes)
Kay, M.: Chart generation. In: Proceedings of ACL1996 (1996)
Krahmer, E., Verleg, A., van Erk, S.: Graph-based generation of referring expressions. Computational Linguistics 29(1), 53–72 (2003)
Langkilde, I., Knight, K.: Generation that exploits corpus-based statistical knowledge. In: Proceedings of COLING/ACL 1998 (1998)
Pearl, J.: Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley, Reading (1984)
Stone, M., Doran, C.: Sentence planning as description using Tree-Adjoining Grammar. In: Proceedings of ACL 1997 (1997)
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. Kluwer Academic Publishers, Dordrecht (to appear)
Varges, S., Mellish, C.: Instance-based natural language generation. In: Proceedings of NAAC 2001 (2001)
Wilcock, G., Matsumoto, Y.: Reversible delayed lexical choice in a bidirectional framework. In: COLING 1996(1996)
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
Varges, S. (2004). Overgenerating Referring Expressions Involving Relations and Booleans. In: Belz, A., Evans, R., Piwek, P. (eds) Natural Language Generation. INLG 2004. Lecture Notes in Computer Science(), vol 3123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27823-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-27823-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22340-5
Online ISBN: 978-3-540-27823-8
eBook Packages: Springer Book Archive