Efficient Stacked Dependency Parsing by Forest Reranking
This paper proposes a discriminative forest reranking algorithm for dependency parsing that can be seen as a form of efficient stacked parsing. A dynamic programming shift-reduce parser produces a packed derivation forest which is then scored by a discriminative reranker, using the 1-best tree output by the shift-reduce parser as guide features in addition to third-order graph-based features. To improve efficiency and accuracy, this paper also proposes a novel shift-reduce parser that eliminates the spurious ambiguity of arc-standard transition systems. Testing on the English Penn Treebank data, forest reranking gave a state-of-the-art unlabeled dependency accuracy of 93.12.
Code (0)
등록된 구현이 없습니다.
Tasks
ARCDependency ParsingRerankingSimilar Papers 제목 키워드 기반
A Search-Based Dynamic Reranking Model for Dependency Parsing
K-Best Spanning Tree Dependency Parsing With Verb Valency Lexicon Reranking
A Reranking Approach for Dependency Parsing with Variable-sized Subtree Features
Unsupervised Dependency Parsing: Let's Use Supervised Parsers
We present a self-training approach to unsupervised dependency parsing that reuses existing supervised and unsupervised parsing algorithms. Our approach, called `iterated reranking' (IR), starts with dependency trees gen…
Dependency ParsingRerankingUnsupervised Dependency Parsing