The Open UniversitySkip to content

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.

Google Scholar: Look up in Google Scholar


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.

Item Type: Conference or Workshop Item
Copyright Holders: 2004 The Authors
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Knowledge Media Institute (KMi)
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Related URLs:
Item ID: 58874
Depositing User: Advaith Siddharthan
Date Deposited: 30 Jan 2019 16:11
Last Modified: 29 Mar 2019 11:13
Share this page:

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU