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: 16 September 2019

Abstract and Keywords

Computational verb lexicons are key to supporting Natural Language Processing (NLP) systems goals for semantic interpretation. Verbs express the semantics of an event being described and relational information among participants, and they project syntactic structures encoding that information, all while displaying a rich range of semantic and syntactic behavior. Verb classifications organize verbs into groups sharing core semantic and syntactic properties. This chapter reviews one such lexical resource for English verbs, VerbNet, which identifies semantic roles and syntactic patterns characteristic of verbs in each class and makes explicit connections between the syntactic patterns and underlying semantic relations that can be inferred for all members of the class. The chapter includes a review of recent updates to the set of thematic roles and a description of the thematic role hierarchy. Ongoing efforts to provide a more empirical grounding of syntactic variations are described, as well as other areas for improvement.

Keywords: lexicon, syntax-semantics interface, semantic predicate, syntactic frame, diathesis alternation, thematic role, coercion, construction

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.