BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Unbounded Dependency Recovery for Parser Evaluation - Laura Rimell
 \, Computer Laboratory\, University of Cambridge
DTSTART:20090710T114500Z
DTEND:20090710T123000Z
UID:TALK19056@talks.cam.ac.uk
CONTACT:Laura Rimell
DESCRIPTION:We introduce a new parser evaluation corpus containing around 
 700 sentences annotated with unbounded dependencies\, from seven different
  grammatical constructions. We run a series of off-the-shelf parsers on th
 e corpus to evaluate how well state-of-the-art parsing technology is able 
 to recover such dependencies. The overall results range from 25% accuracy 
 to 59%. These low scores call into question the validity of using Parseval
  scores as a general measure of parsing capability. We discuss the importa
 nce of parsers being able to recover unbounded dependencies\, given their 
 relatively low frequency in corpora. We also analyse the various errors ma
 de on these constructions by one of the more successful parsers.
LOCATION:SW01\, Computer Laboratory
END:VEVENT
END:VCALENDAR