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

page 1

page 2

page 3

page 4

research
08/10/2021

Headed Span-Based Projective Dependency Parsing

We propose a headed span-based method for projective dependency parsing....
research
05/17/2021

Dependency Parsing as MRC-based Span-Span Prediction

Higher-order methods for dependency parsing can partially but not fully ...
research
05/16/2017

A Novel Neural Network Model for Joint POS Tagging and Graph-based Dependency Parsing

We present a novel neural network model that learns POS tagging and grap...
research
06/15/2021

Maximum Spanning Trees Are Invariant to Temperature Scaling in Graph-based Dependency Parsing

Modern graph-based syntactic dependency parsers operate by predicting, f...
research
03/02/2017

Lock-Free Parallel Perceptron for Graph-based Dependency Parsing

Dependency parsing is an important NLP task. A popular approach for depe...
research
10/28/2020

Second-Order Unsupervised Neural Dependency Parsing

Most of the unsupervised dependency parsers are based on first-order pro...
research
03/30/2022

Span Classification with Structured Information for Disfluency Detection in Spoken Utterances

Existing approaches in disfluency detection focus on solving a token-lev...

Please sign up or login with your details

Forgot password? Click here to reset