BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Bare-Bones Dependency Parsing - A Case for Occam's Razor? - Joakim
  Nivre\, Uppsala University
DTSTART:20110406T130000Z
DTEND:20110406T140000Z
UID:TALK30499@talks.cam.ac.uk
CONTACT:Thomas Lippincott
DESCRIPTION:The notion of dependency has come to play an increasingly cent
 ral role in natural language parsing in recent years. On the one hand\, le
 xical dependencies have been incorporated in statistical models for a vari
 ety of syntactic representations. On the other hand\, dependency relations
  extracted from such representations have been exploited in many practical
  applications. Given these developments\, it is not surprising that there 
 has also been a growing interest in parsing models that map sentences dire
 ctly to dependency trees\, an approach that may be called "bare-bones depe
 ndency parsing" to distinguish it from parsing methods where dependencies 
 are embedded into or extracted from other types of syntactic representatio
 ns. In this talk\, I will survey recent advances in bare-bones dependency 
 parsing\, covering all major approaches but focusing on transition-based m
 ethods for highly efficient parsing. I will specifically address the quest
 ion of how such systems can handle long-distance dependencies and other ph
 enomena that have been argued to require richer representations\, and I wi
 ll discuss recent work that attempts to evaluate bare-bones dependency par
 sers in relation to other methods for producing dependency trees.
LOCATION:FW26\, Computer Laboratory
END:VEVENT
END:VCALENDAR