HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Referring Expressions as Formulas of Description Logic

Carlos Areces 1 Alexander Koller 2 Kristina Striegnitz 3
1 TALARIS - Natural Language Processing: representation, inference and semantics
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 Programming Systems Lab [Saarland]
3 University of Chicago
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.
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/inria-00323841
Contributor : Areces Carlos Connect 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

Identifiers

  • HAL Id : inria-00323841, version 1

Collections

CNRS | INRIA | LORIA | UNIV-LORRAINE | INRIA2

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

52

 

Contact                    Legal Notice                    Personal Data