Generating Anaphora for Simplifying Text

Advaith Siddharthan, Ann Copestake

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


We present an algorithm for generating referring expressions in open domains. Existing algorithms assume a classification of adjectives which is possible only for restricted domains. Our alternative relies on WordNet synonym and antonym sets and gives equivalent results on the examples cited in the literature and improved results in other cases that prior approaches cannot handle. We believe that it is also the first algorithm that allows for the incremental incorporation of relations. We perform an evaluation on a text-simplification task on Wall Street Journal data.
Original languageEnglish
Title of host publicationProceedings of the 4th Discourse Anaphora and Anaphor Resolution Colloquium (DAARC'02)
Place of PublicationLisbon, Portugal
PublisherEdições Colibri
Number of pages6
ISBN (Print)972-772-350-0
Publication statusPublished - 2002
Event4th Discourse Anaphora and Anaphor Resolution Colloquium (DAARC'02) - Lisbon, Portugal
Duration: 18 Sept 200220 Sept 2002


Conference4th Discourse Anaphora and Anaphor Resolution Colloquium (DAARC'02)

Cite this