Referring Expressions as Formulas of Description Logic

C. Areces, A. Koller, and K. Striegnitz. Referring Expressions as Formulas of Description Logic. In Proceedings of the 5th International Natural Language Generation, Salt Fork, OH, USA, 2008.

Download

[pdf] 

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 algo- rithms 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 rela- tional referring expressions without any dan- ger of running into infinite regress.

BibTeX

@InProceedings{Areces2008b,
  author =       "C. Areces and A. Koller and K. Striegnitz",
  booktitle =    "Proceedings of the 5th International Natural Language
                 Generation",
  title =        "Referring Expressions as Formulas of Description
                 Logic",
  year =         "2008",
  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 algo- rithms 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 rela- tional referring
                 expressions without any dan- ger of running into
                 infinite regress.",
  address =      "Salt Fork, OH, USA",
}