BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A Tale of Two Parsers: investigating and combining graph-based and
  transition-based dependency parsing using beam-search - Yue Zhang\, Unive
 rsity of Oxford
DTSTART:20090227T120000Z
DTEND:20090227T130000Z
UID:TALK16609@talks.cam.ac.uk
CONTACT:Johanna Geiss
DESCRIPTION:Graph-based and transition-based approaches to dependency pars
 ing adopt very different views of the problem\, each view having its own s
 trengths and limitations. We study both approaches under the framework of 
 beam-search. By developing a graph-based and a transition-based dependency
  parser\, we show that a beam-search decoder is a competitive choice for b
 oth methods. More importantly\, we propose a beam-search-based parser that
  combines both graph-based and transition-based parsing into a single syst
 em for training and decoding\, showing that it outperforms both the pure g
 raph-based and the pure transition-based parsers. Testing on the English a
 nd Chinese Penn Treebank data\, the combined system gave state-of-the-art 
 accuracies of 92.1% and 86.2%\, respectively. \nAuthors: Yue Zhang and Ste
 phen Clark
LOCATION:SW01\, Computer Laboratory
END:VEVENT
END:VCALENDAR