PTB graph parsing with tree approximation

3Citations
Citations of this article
96Readers
Mendeley users who have this article in their library.

Abstract

The Penn Treebank (PTB) represents syntactic structures as graphs due to nonlocal dependencies. This paper proposes a method that approximates PTB graph-structured representations by trees. By our approximation method, we can reduce nonlocal dependency identification and constituency parsing into single tree-based parsing. An experimental result demonstrates that our approximation method with an off-the-shelf tree-based constituency parser significantly outperforms the previous methods in nonlocal dependency identification.

Cite

CITATION STYLE

APA

Kato, Y., & Matsubara, S. (2020). PTB graph parsing with tree approximation. In ACL 2019 - 57th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (pp. 5344–5349). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/p19-1530

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free