Generating referring expressions: Boolean extensions of the incremental algorithm

Kees van Deemter

doi:10.1162/089120102317341765

Generating referring expressions: Boolean extensions of the incremental algorithm

2002-03-01

47

OA

AI

K

Kees van Deemter *

DOI：10.1162/089120102317341765

原文链接

查看原文

摘要

En 中文

This paper brings a logical perspective to the generation of referring expressions, addressing the incompleteness of existing algorithms in this area. After studying references to individual objects, we discuss references to sets, including Boolean descriptions that make use of negated and disjoined properties. To guarantee that a distinguishing description is generated whenever such descriptions exist, the paper proposes generalizations and extensions of the Incremental Algorithm of Dale and Reiter (1995).

Generating referring expressions: Boolean extensions of the incremental algorithm

摘要

AI总结

期刊

机构

引用论文