资源分类
》 资源 》论文》PTB Graph Parsing with Tree Approximation

PTB Graph Parsing with Tree Approximation

2019-09-18 | |  117 |   61 |   0 0 0
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 treebased 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.

上一篇：Multilingual Constituency Parsing with Self-Attention and Pre-Training

下一篇：Representing Schema Structure with Graph Neural Networks forText-to-SQL Parsing

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...