Generating minimal definite descriptions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Generating minimal definite descriptions


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.
Fichier principal
Vignette du fichier
A02-R-460.pdf (116.28 Ko) Télécharger le fichier

Dates and versions

inria-00099410 , version 1 (26-09-2006)


  • HAL Id : inria-00099410 , version 1


Claire Gardent. Generating minimal definite descriptions. 40th Annual Meeting of the Association for Computational Linguistic - ACL'02, Jul 2002, Philadelphia, USA, 8 p. ⟨inria-00099410⟩
47 View
133 Download


Gmail Facebook Twitter LinkedIn More