Shift-Reduce Dependency DAG Parsing

13 years 7 months ago
Shift-Reduce Dependency DAG Parsing
Most data-driven dependency parsing approaches assume that sentence structure is represented as trees. Although trees have several desirable properties from both computational and linguistic perspectives, the structure of linguistic phenomena that goes beyond shallow syntax often cannot be fully captured by tree representations. We present a parsing approach that is nearly as simple as current data-driven transition-based dependency parsing frameworks, but outputs directed acyclic graphs (DAGs). We demonstrate the benefits of DAG parsing in two experiments where its advantages over dependency tree parsing can be clearly observed: predicate-argument analysis of English and syntactic analysis of Danish with a representation that includes long-distance dependencies and anaphoric reference links.
Kenji Sagae, Jun-ichi Tsujii
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Authors Kenji Sagae, Jun-ichi Tsujii
Comments (0)