Generating Referring Expressions in Open Domains

Siddharthan, Advaith and Copestake, Ann (2004). Generating Referring Expressions in Open Domains. In: Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, ACL, Stroudsburg PA, p. 407.

URL: http://www.aclweb.org/anthology/P04-1052

Abstract

We present an algorithm for generating referring expressions in open domains. Existing algorithms work at the semantic level and assume the availability of a classification for attributes, which is only feasible for restricted domains. Our alternative works at the realisation level, relies on WordNet synonym and antonym sets, and gives equivalent results on the examples cited in the literature and improved results for examples that prior approaches cannot handle. We believe that ours is also the first algorithm that allows for the incremental incorporation of relations. We present a novel corpus-evaluation using referring expressions from the Penn Wall Street Journal Treebank.

Viewing alternatives

Item Actions

Export

You can export this page using these formats

About

• Item ORO ID
• 58874
• Item Type
• Conference or Workshop Item
• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Knowledge Media Institute (KMi)
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
• Copyright Holders
• © 2004 The Authors
• Related URLs
• • http://www.aclweb.org/anthology/P/P04/(Other)
• Depositing User
• Advaith Siddharthan