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.

• Type: Conference
• Year: 2008
• Where: COLING
• Authors: Kenji Sagae, Jun-ichi Tsujii
• Keywords: COLING 2008, Computational Linguistics, Dependency Parsing Approaches, Dependency Parsing Frameworks, Parsing