Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing

We introduce novel dynamic oracles for training two of the most accurate known shift-reduce algorithms for constituent parsing: the top-down and in-order transition-based parsers. In both cases, the dynamic oracles manage to notably increase their accuracy, in comparison to that obtained by performing classic static training. In addition, by improving the performance of the state-of-the-art in-order shift-reduce parser, we achieve the best accuracy to date (92.0 F1) obtained by a fully-supervised single-model greedy shift-reduce constituent parser on the WSJ benchmark.

READ FULL TEXT

page 1

page 2

page 3

page 4

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...
research
12/02/2016

Shift-Reduce Constituent Parsing with Neural Lookahead Features

Transition-based models can be fast and accurate for constituent parsing...
research
12/20/2016

Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles

Parsing accuracy using efficient greedy transition systems has improved ...
research
05/27/2020

Enriched In-Order Linearization for Faster Sequence-to-Sequence Constituent Parsing

Sequence-to-sequence constituent parsing requires a linearization to rep...
research
05/10/2017

A Minimal Span-Based Neural Constituency Parser

In this work, we present a minimal neural model for constituency parsing...
research
06/08/2018

Policy Gradient as a Proxy for Dynamic Oracles in Constituency Parsing

Dynamic oracles provide strong supervision for training constituency par...
research
10/21/2022

Shift-Reduce Task-Oriented Semantic Parsing with Stack-Transformers

Intelligent voice assistants, such as Apple Siri and Amazon Alexa, are w...

Please sign up or login with your details

Forgot password? Click here to reset