3University of Chicago (Edward H. Levi Hall 5801 South Ellis Avenue Chicago, Illinois 60637 - United States)
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.
https://hal.inria.fr/inria-00323841 Contributor : Areces CarlosConnect in order to contact the contributor Submitted on : Tuesday, September 23, 2008 - 12:38:21 PM Last modification on : Friday, February 4, 2022 - 3:33:13 AM
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⟩