Combining (second-order) graph-based and headed span-based projective dependency parsing

08/12/2021 ∙ by Songlin Yang, et al. ∙ 0

Graph-based methods are popular in dependency parsing for decades. Recently, <cit.> propose a headed span-based method. Both of them score all possible trees and globally find the highest-scoring tree. In this paper, we combine these two kinds of methods, designing several dynamic programming algorithms for joint inference. Experiments show the effectiveness of our proposed methods[Our code is publicly available at <https://github.com/sustcsonglin/span-based-dependency-parsing>.].

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

Code Repositories

span-based-dependency-parsing

Source code of "Headed Span-Based Projective Dependency Parsing" and "Combining (second-order) graph-based and headed span-based projective dependency parsing


view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.