Referring Expressions as Formulas of Description Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Referring Expressions as Formulas of Description Logic

Abstract

In this paper, we propose to reinterpret the problem of generating referring expressions (GRE) as the problem of computing a formula in a description logic that is only satisfied by the referent. This view offers a new unifying perspective under which existing GRE algorithms can be compared. We also show that by applying existing algorithms for computing simulation classes in description logic, we can obtain extremely efficient algorithms for relational referring expressions without any danger of running into infinite regress.
No file

Dates and versions

inria-00323841 , version 1 (23-09-2008)

Identifiers

  • HAL Id : inria-00323841 , version 1

Cite

Carlos Areces, Alexander Koller, Kristina Striegnitz. Referring Expressions as Formulas of Description Logic. Fifth International Natural Language Generation Conference - INLG 2008, Jun 2008, Salt Fork, United States. ⟨inria-00323841⟩
55 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More