Logical Form Equivalence: the case of referring expressions generation

Kees van Deemter, Magnus Halldorsson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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
Pages1-8
Number of pages8
Volume8
DOIs
Publication statusPublished - 2001

Fingerprint

equivalence
sentences

Keywords

  • Referring Expressions
  • Reference to sets
  • Fast algorithms.

Cite this

van Deemter, K., & Halldorsson, M. (2001). Logical Form Equivalence: the case of referring expressions generation. In Proceedings of the 8th European workshop on Natural Language Generation (Vol. 8, pp. 1-8). Stroudsburg: Association for Computational Linguistics. https://doi.org/10.3115/1117840.1117844

Logical Form Equivalence : the case of referring expressions generation. / van Deemter, Kees; Halldorsson, Magnus.

Proceedings of the 8th European workshop on Natural Language Generation . Vol. 8 Stroudsburg : Association for Computational Linguistics, 2001. p. 1-8.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

van Deemter, K & Halldorsson, M 2001, Logical Form Equivalence: the case of referring expressions generation. in Proceedings of the 8th European workshop on Natural Language Generation . vol. 8, Association for Computational Linguistics, Stroudsburg, pp. 1-8. https://doi.org/10.3115/1117840.1117844
van Deemter K, Halldorsson M. Logical Form Equivalence: the case of referring expressions generation. In Proceedings of the 8th European workshop on Natural Language Generation . Vol. 8. Stroudsburg: Association for Computational Linguistics. 2001. p. 1-8 https://doi.org/10.3115/1117840.1117844
van Deemter, Kees ; Halldorsson, Magnus. / Logical Form Equivalence : the case of referring expressions generation. Proceedings of the 8th European workshop on Natural Language Generation . Vol. 8 Stroudsburg : Association for Computational Linguistics, 2001. pp. 1-8
@inproceedings{8f84d525876246bca5b60f1995c64487,
title = "Logical Form Equivalence: the case of referring expressions generation",
abstract = "We examine the principle of co-extensivity which underlies current algorithms forthe 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.",
keywords = "Referring Expressions, Reference to sets, Fast algorithms.",
author = "{van Deemter}, Kees and Magnus Halldorsson",
year = "2001",
doi = "10.3115/1117840.1117844",
language = "English",
volume = "8",
pages = "1--8",
booktitle = "Proceedings of the 8th European workshop on Natural Language Generation",
publisher = "Association for Computational Linguistics",

}

TY - GEN

T1 - Logical Form Equivalence

T2 - the case of referring expressions generation

AU - van Deemter, Kees

AU - Halldorsson, Magnus

PY - 2001

Y1 - 2001

N2 - We examine the principle of co-extensivity which underlies current algorithms forthe 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.

AB - We examine the principle of co-extensivity which underlies current algorithms forthe 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.

KW - Referring Expressions

KW - Reference to sets

KW - Fast algorithms.

U2 - 10.3115/1117840.1117844

DO - 10.3115/1117840.1117844

M3 - Conference contribution

VL - 8

SP - 1

EP - 8

BT - Proceedings of the 8th European workshop on Natural Language Generation

PB - Association for Computational Linguistics

CY - Stroudsburg

ER -