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.
展开▼
机译：我们提出了一种用于在开放域中生成引用表达式的算法。现有算法在语义级别工作，并假设属性分类的可用性，这对于限制域仅是可行的。我们在实现级别的替代工作，依赖于Word-Net同义词和反义词，并在文献中引用的示例和改进结果的例子上给出了等效结果，以便先前接近无法处理的示例。我们认为，我们的是允许逐步融入关系的第一算法。我们使用Penn Wall Street Journal TreeBank的引用表达式提出了一种新的语料库评估。
展开▼
