Generating Referring Expressions in Open Domains

Advaith Siddharthan, Ann Copestake

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

Abstract

We present an algorithm for generating referring expressions in open domains. Existing algorithms work at the semantic level and assume the availability of a classication for attributes, which is only feasible for restricted domains. Our alternative works at the realisation level, relies on Word-Net synonym and antonym sets, and gives equivalent results on the examples cited in the literature and improved results for examples that prior approaches cannot handle. We believe that ours is also the first algorithm that allows for the incremental incorporation of relations. We present a novel corpus-evaluation using referring expressions from
the Penn Wall Street Journal Treebank.
Original languageEnglish
Title of host publicationProceedings of the 42nd Annual Meeting on Association for Computational Linguistics (ACL)
Place of PublicationBarcelona, Spain
Publication statusPublished - 2004
Event42nd Annual Meeting on Association for Computational Linguistics - Barcelona, Spain
Duration: 21 Jul 200426 Jul 2004

Conference

Conference42nd Annual Meeting on Association for Computational Linguistics
CountrySpain
CityBarcelona
Period21/07/0426/07/04

Fingerprint

Semantics
Availability

Cite this

Siddharthan, A., & Copestake, A. (2004). Generating Referring Expressions in Open Domains. In Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics (ACL) Barcelona, Spain .

Generating Referring Expressions in Open Domains. / Siddharthan, Advaith; Copestake, Ann.

Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics (ACL). Barcelona, Spain , 2004.

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

Siddharthan, A & Copestake, A 2004, Generating Referring Expressions in Open Domains. in Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics (ACL). Barcelona, Spain , 42nd Annual Meeting on Association for Computational Linguistics, Barcelona, Spain, 21/07/04.
Siddharthan A, Copestake A. Generating Referring Expressions in Open Domains. In Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics (ACL). Barcelona, Spain . 2004
Siddharthan, Advaith ; Copestake, Ann. / Generating Referring Expressions in Open Domains. Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics (ACL). Barcelona, Spain , 2004.
@inproceedings{ed196dbabaa54a2c8b549ace33674619,
title = "Generating Referring Expressions in Open Domains",
abstract = "We present an algorithm for generating referring expressions in open domains. Existing algorithms work at the semantic level and assume the availability of a classication for attributes, which is only feasible for restricted domains. Our alternative works at the realisation level, relies on Word-Net synonym and antonym sets, and gives equivalent results on the examples cited in the literature and improved results for examples that prior approaches cannot handle. We believe that ours is also the first algorithm that allows for the incremental incorporation of relations. We present a novel corpus-evaluation using referring expressions from the Penn Wall Street Journal Treebank.",
author = "Advaith Siddharthan and Ann Copestake",
note = "Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, 21-27 July, 2004, Barcelona, Spain",
year = "2004",
language = "English",
booktitle = "Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics (ACL)",

}

TY - GEN

T1 - Generating Referring Expressions in Open Domains

AU - Siddharthan, Advaith

AU - Copestake, Ann

N1 - Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, 21-27 July, 2004, Barcelona, Spain

PY - 2004

Y1 - 2004

N2 - We present an algorithm for generating referring expressions in open domains. Existing algorithms work at the semantic level and assume the availability of a classication for attributes, which is only feasible for restricted domains. Our alternative works at the realisation level, relies on Word-Net synonym and antonym sets, and gives equivalent results on the examples cited in the literature and improved results for examples that prior approaches cannot handle. We believe that ours is also the first algorithm that allows for the incremental incorporation of relations. We present a novel corpus-evaluation using referring expressions from the Penn Wall Street Journal Treebank.

AB - We present an algorithm for generating referring expressions in open domains. Existing algorithms work at the semantic level and assume the availability of a classication for attributes, which is only feasible for restricted domains. Our alternative works at the realisation level, relies on Word-Net synonym and antonym sets, and gives equivalent results on the examples cited in the literature and improved results for examples that prior approaches cannot handle. We believe that ours is also the first algorithm that allows for the incremental incorporation of relations. We present a novel corpus-evaluation using referring expressions from the Penn Wall Street Journal Treebank.

M3 - Conference contribution

BT - Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics (ACL)

CY - Barcelona, Spain

ER -