| | |
Summary: Reverse Revision and Linear Tree Combination for Dependency Parsing
Giuseppe Attardi
Dipartimento di Informatica
Universit`a di Pisa
Pisa, Italy
attardi@di.unipi.it
Felice Dell'Orletta
Dipartimento di Informatica
Universit`a di Pisa
Pisa, Italy
felice.dellorletta@di.unipi.it
1 Introduction
Deterministic transition-based Shift/Reduce depen-
dency parsers make often mistakes in the analysis of
long span dependencies (McDonald & Nivre, 2007).
Titov and Henderson (2007) address this accuracy
drop by using a beam search instead of a greedy al-
gorithm for predicting the next parser transition.
We propose a parsing method that allows reduc-
ing several of these errors, although maintaining a
|
