SOTAVerified

PTB Graph Parsing with Tree Approximation

2019-07-01ACL 2019Code Available0· sign in to hype

Yoshihide Kato, Shigeki Matsubara

Code Available — Be the first to reproduce this paper.

Reproduce

Code

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.

Tasks

Reproductions