Efficient Stacked Dependency Parsing by Forest Reranking

@article{Hayashi2013EfficientSD,
  title={Efficient Stacked Dependency Parsing by Forest Reranking},
  author={Katsuhiko Hayashi and Shuhei Kondo and Yuji Matsumoto},
  journal={TACL},
  year={2013},
  volume={1},
  pages={139-150}
}
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… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS
16 Citations
35 References
Similar Papers

Similar Papers

Loading similar papers…