Planning english referring expressions
Artificial Intelligence - Lecture notes in computer science 178
Attention, intentions, and the structure of discourse
Computational Linguistics
Generating referring expressions: boolean extensions of the incremental algorithm
Computational Linguistics
Generating referring expressions in a domain of objects and processes (language representation)
Generating referring expressions in a domain of objects and processes (language representation)
The computational complexity of avoiding conversational implicatures
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Using aggregation for selecting content when generating referring expressions
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on 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
A meta-algorithm for the generation of referring expressions
EWNLG '01 Proceedings of the 8th European workshop on Natural Language Generation - Volume 8
INLG '00 Proceedings of the first international conference on Natural language generation - Volume 14
INLG '00 Proceedings of the first international conference on Natural language generation - Volume 14
Generating Referring Expressions that Involve Gradable Properties
Computational Linguistics
Generating Responses to Formally Flawed Problem-Solving Statements
Proceedings of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work
Using spatial reference frames to generate grounded textual summaries of georeferenced data
INLG '08 Proceedings of the Fifth International Natural Language Generation Conference
| Hi-index | 0.00 |
Algorithms that generate expressions to identify a referent are mostly tailored towards objects which are in some sense conceived as holistic entities, describing them in terms of their properties and relations to other objects. This approach may prove not fully adequate when referring to components of structured objects, specifically for abstract objects in formal domains, where scope and relative positions are essential features. In this paper, we adapt the standard Dale and Reiter algorithm to specifics of such references as observed in a corpus about mathematical proofs. Extensions incorporated include an incremental specialization of property values for metonymic references, local and global positions reflecting group formations and implicature-based scope preferences to justify unique identification of the intended referent. The approach is primarily relevant for domains where abstract formal objects are prominent, but some of its features are also useful to extend the expressive repertoire of reference generation algorithms in other domains.