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.
Type de document :
Communication dans un congrès
Fifth International Natural Language Generation Conference - INLG 2008, Jun 2008, Salt Fork, United States. 2008
Liste complète des métadonnées

https://hal.inria.fr/inria-00323841
Contributeur : Areces Carlos <>
Soumis le : mardi 23 septembre 2008 - 12:38:21
Dernière modification le : jeudi 11 janvier 2018 - 06:21:35

Identifiants

  • HAL Id : inria-00323841, version 1

Collections

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. 2008. 〈inria-00323841〉

Partager

Métriques

Consultations de la notice

151