Logical Form Equivalence: the case of referring expressions generation

Kees van Deemter; Magnus Halldorsson

doi:10.3115/1117840.1117844

Logical Form Equivalence: the case of referring expressions generation

Kees van Deemter, Magnus Halldorsson

Computing Science

Research output: Chapter in Book/Report/Conference proceeding › Published conference 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 language	English
Title of host publication	Proceedings of the 8th European workshop on Natural Language Generation
Place of Publication	Stroudsburg
Publisher	Association for Computational Linguistics
Pages	1-8
Number of pages	8
Volume	8
DOIs	https://doi.org/10.3115/1117840.1117844
Publication status	Published - 2001

Keywords

Referring Expressions
Reference to sets
Fast algorithms.

Access to Document

10.3115/1117840.1117844

http://www.csd.abdn.ac.uk/~kvdeemte/Hall.pdf

Cite this

@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 - Published 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 -

Logical Form Equivalence: the case of referring expressions generation

Abstract

Keywords

Access to Document

Fingerprint

Cite this