Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 21 November 2019

Abstract and Keywords

This chapter offers a survey of computational research on Referring Expression Generation (reg). The main body of the text comes from an article that was published in the journal Computational Linguistics in 2012; the preamble places the survey in the context of later developments. The survey introduces the reg problem and describes early work in this area, discussing what basic assumptions lie behind it, and showing how its remit has widened over the years. It discusses some computational frameworks underlying reg, and demonstrate a recent trend that seeks to link reg algorithms with well-established Knowledge Representation techniques. Considerable attention is given to recent efforts at evaluating reg algorithms and the lessons that they allow us to learn. The chapter concludes with a discussion of what we still see as important aspects of the way forward in this area of computational research, focusing particularly on referring in larger and more realistic settings.

Keywords: computational linguistics, referring expression generation, knowledge representation, REG algorithms, language production, recursion, machine learning, evaluation of algorithms

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.