The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Generating referring expressions: boolean extensions of the incremental algorithm
Computational Linguistics
Graph-based generation of referring expressions
Computational Linguistics
Generating referring expressions involving relations
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Cooking up referring expressions
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A best-first search algorithm for generating referring expressions
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 2
Generating minimal definite descriptions
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Conceptual coherence in the generation of referring expressions
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
A conceptual graph approach to the generation of referring expressions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Algorithms for generating referring expressions: do they do what people do?
INLG '06 Proceedings of the Fourth International Natural Language Generation Conference
| Hi-index | 0.00 |
Many studies in natural language processing are concerned with how to generate definite descriptions that evoke a discourse entity already introduced in the context. A solution to this problem has been initially proposed by Dale (1989) in terms of distinguishing descriptions and distinguishable entities. In this paper, we give a formal definition of the terms "distinguishable entity" in non trivial cases and we show that its properties lead us to the definition of a distance between entities. Then, we give a polynomial algorithm to compute distinguishing descriptions.