Logical Form Equivalence: the case of referring expressions generation

Kees van Deemter, Magnus Halldorsson

Research output: Chapter in Book/Report/Conference proceedingPublished conference contribution


We examine the principle of co-extensivity which underlies current algorithms for
the generation of referring expressions, and investigate to what extent the principle allows these algorithms to be generalized. The discussion focusses on the generation of complex Boolean descriptions and sentence aggregation.
Original languageEnglish
Title of host publicationProceedings of the 8th European workshop on Natural Language Generation
Place of PublicationStroudsburg
PublisherAssociation for Computational Linguistics
Number of pages8
Publication statusPublished - 2001


  • Referring Expressions
  • Reference to sets
  • Fast algorithms.


Dive into the research topics of 'Logical Form Equivalence: the case of referring expressions generation'. Together they form a unique fingerprint.

Cite this