A meta-algorithm for the generation of referring expressions

Authors:
Emiel Krahmer;Sebastiaan van Erk;André Verleg
Affiliations:
Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands
Venue:
EWNLG '01 Proceedings of the 8th European workshop on Natural Language Generation - Volume 8
Year:
2001

Citing 8
Cited 4

Planning english referring expressions

Artificial Intelligence - Lecture notes in computer science 178
Centering: a framework for modeling the local coherence of discourse

Computational Linguistics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Generating referring expressions involving relations

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
An algorithm for generating referential descriptions with flexible interfaces

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
The computational complexity of avoiding conversational implicatures

ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
The order of prenominal adjectives in natural language generation

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Generating vague descriptions

INLG '00 Proceedings of the first international conference on Natural language generation - Volume 14

Generating referring expressions: boolean extensions of the incremental algorithm

Computational Linguistics
Graph-based generation of referring expressions

Computational Linguistics
Generating minimal definite descriptions

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Generating references to parts of recursively structured objects

INLG '06 Proceedings of the Fourth International Natural Language Generation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new approach to the generation of referring expressions. We propose to formalize a scene as a labeled directed graph and describe content selection as a subgraph construction problem. Cost functions are used to guide the search process and to give preference to some solutions over others. The resulting graph algorithm can be seen as a meta-algorithm in the sense that defining cost functions in different ways allows us to mimic --- and even improve--- a number of well-known algorithms.