• Home
  • Extra seminar: Marco Kuhlmann - Cubic-Time Graph Parsing with a Simple Scoring Scheme

Extra seminar: Marco Kuhlmann - Cubic-Time Graph Parsing with a Simple Scoring Scheme

SEMINAR

We turn the Eisner algorithm for parsing to projective dependency trees into a cubic-time algorithm for parsing to a restricted class of directed graphs. To extend the algorithm into a data-driven parser, we combine it with an edge-factored feature model and online learning. We report and discuss results on the SemEval-2014 Task 8 data sets (Oepen et al., 2014).

Date: 2014-10-21 13:15 - 15:00

Location: EDIT room (3364), Chalmers Johanneberg

Permalink

add to Outlook/iCal

To the top

Page updated: 2014-10-14 13:16

Send as email
Print page
Show as pdf

X
Loading