On "redundancy" in selecting attributes for generating referring expressions

Coling 2008 - 22nd International Conference on Computational Linguistics, Proceedings of the Conference

Volumn 1, Issue , 2008, Pages 115-118

  Spanger, Philipp ^a   Kurosawa, Takehiro ^a   Takenobu, Tokunaga ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE SELECTION; COGNITIVE THEORY; EFFICIENT ALGORITHM; GENERATING REFERRING EXPRESSIONS; INCREMENTAL ALGORITHM; SIMPLE LEARNING ALGORITHMS;

COMPUTATIONAL LINGUISTICS; LEARNING ALGORITHMS; REDUNDANCY;

COMPUTATIONAL EFFICIENCY;

EID: 80053404902     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Belz, Anja and Albert Gatt. 2007. The attribute selection for GRE challenge: Overview and evaluation results. In Proceedings of the MT Summit XI Workshop Using Corpora for Natural Language Generation: Language Generation and Machine Translation (UCNLG+MT), pages 75-83.
2. Dale, Robert, and Ehud Reiter. 1995. Computational interpretation of the gricean maxims in the generation of referring expressions. Cognitive Science, 19(2):233-263.
3. van Deemter, Kees. 2007. TUNA: Towards a unified algorithm for the generation of referring expressions - Final Report -. http://www.csd.abdn.ac.uk/ research/tuna/pubs/TUNA-final-report.pdf.
4. Viethen, Jette and Robert Dale. 2006. Algorithms for generating referring expressions: Do they do what people do? In Proceedings of the Fourth International Natural Language Generation Conference, pages 63-70.