Hybrid Oracle: Making Use of Ambiguity in Transition-based Chinese Dependency Parsing

11/28/2017
by   Xuancheng Ren, et al.
0

In the training of transition-based dependency parsers, an oracle is used to predict a transition sequence for a sentence and its gold tree. However, the transition system may exhibit ambiguity, that is, there can be multiple correct transition sequences that form the gold tree. We propose to make use of the property in the training of neural dependency parsers, and present the Hybrid Oracle. The new oracle gives all the correct transitions for a parsing state, which are used in the cross entropy loss function to provide better supervisory signal. It is also used to generate different transition sequences for a sentence to better explore the training data and improve the generalization ability of the parser. Evaluations show that the parsers trained using the hybrid oracle outperform the parsers using the traditional oracle in Chinese dependency parsing. We provide analysis from a linguistic view.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2012

Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing

We present a novel technique to remove spurious ambiguity from transitio...
research
05/14/2018

A Dynamic Oracle for Linear-Time 2-Planar Dependency Parsing

We propose an efficient dynamic oracle for training the 2-Planar transit...
research
04/17/2018

Monte Carlo Syntax Marginals for Exploring and Using Dependency Parses

Dependency parsing research, which has made significant gains in recent ...
research
05/03/2022

Inducing and Using Alignments for Transition-based AMR Parsing

Transition-based parsers for Abstract Meaning Representation (AMR) rely ...
research
06/19/2015

Structured Training for Neural Network Transition-Based Parsing

We present structured perceptron training for neural network transition-...
research
08/30/2017

Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set

We first present a minimal feature set for transition-based dependency p...
research
04/21/2018

Faster Shift-Reduce Constituent Parsing with a Non-Binary, Bottom-Up Strategy

We propose a novel non-binary shift-reduce algorithm for constituent par...

Please sign up or login with your details

Forgot password? Click here to reset