Three partition refinement algorithms
SIAM Journal on Computing
Modal logic
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: boolean extensions of the incremental algorithm
Computational Linguistics
Graph-based generation of referring expressions
Computational Linguistics
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
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
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
Cooking up referring expressions
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
INLG '00 Proceedings of the first international conference on Natural language generation - Volume 14
Referring expression generation through attribute-based heuristics
ENLG '09 Proceedings of the 12th European Workshop on Natural Language Generation
Algorithms for generating referring expressions: do they do what people do?
INLG '06 Proceedings of the Fourth International Natural Language Generation Conference
Building a semantically transparent corpus for the generation of referring expressions
INLG '06 Proceedings of the Fourth International Natural Language Generation Conference
Referring expressions as formulas of description logic
INLG '08 Proceedings of the Fifth International Natural Language Generation Conference
An incremental bisimulation algorithm
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
| Hi-index | 0.00 |
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output of the content determination phase (i.e., when the relevant features of the object to be referred are selected). Many different logics can be used for this and we argue that, for a particular application, the actual choice shall constitute a compromise between expressive power (how many objects can be distinguished), computational complexity (how difficult it is to determine the content) and realizability (how often will the selected content be realized to an idiomatic expression). We show that well-known results from the area of computational logic can then be transferred to GRE. Moreover, our approach is orthogonal to previous proposals and we illustrate this by generalizing well-known content-determination algorithms to make them parametric on the logic employed.