Presentations (Communicative Events)

Generating Referring Expressions in Open Domains

Siddharthan, Advaith; Copestake, Ann

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 Word-Net 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.


  • thumnail for siddharthan_copestake_04.pdf siddharthan_copestake_04.pdf application/pdf 154 KB Download File

More About This Work

Academic Units
Computer Science
42th Meeting of the Association for Computational Linguistics Annual Conference (ACL 2004)
Published Here
May 31, 2013