inria-00099408, version 1
Using set constraints to generate distinguishing descriptions
7th International Workshop on Natural Language Understanding and Logic Programming - NLULP'02 (2002) 15 p
Résumé : The incremental algorithm introduced in DalRei95 for producing distinguishing descriptions does not always generate a minimal description. In this paper, I show that when generalised to sets of individuals and disjunctive properties, this approach might generate unnecessarily long and ambiguous and/or epistemically redundant descriptions. I then present an alternative, constraint-based algorithm and show that it builds on existing related algorithms in that (i) it produces minimal descriptions for sets of individuals using positive, negative and disjunctive properties, (ii) it straightforwardly generalises to n-ary relations and (iii) it is integrated with surface realisation.
- a – UNIVERSITE DE SARREBRUCK
- b – CNRS
- 1 :
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- Domaine : Informatique/Autre
- Mots-clés : constraints – text generation – referential expressions || contraintes – génération automatique de textes – expressions référentielles
- Référence interne : A02-R-459 || amoia02a
- Commentaire : Colloque avec actes et comité de lecture. internationale.
- inria-00099408, version 1
- http://hal.inria.fr/inria-00099408
- oai:hal.inria.fr:inria-00099408
- Contributeur :
- Soumis le : Mardi 26 Septembre 2006, 09:01:52
- Dernière modification le : Jeudi 28 Septembre 2006, 15:22:46




Exporter