Generating Referring Expressions in Open Domains

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.

• Type: Conference
• Year: 2004
• Where: ACL
• Authors: Advaith Siddharthan, Ann A. Copestake
• Keywords: ACL 2004, ACL 2007, Algorithm, Open Domains, We Believe