Browse > Natural Language Processing > Dependency Parsing > Transition-Based Dependency Parsing

Transition-Based Dependency Parsing

7 papers with code · Natural Language Processing
Subtask of Dependency Parsing

Leaderboards

TREND DATASET BEST METHOD PAPER TITLE PAPER CODE COMPARE

Greatest papers with code

Transition-Based Dependency Parsing with Stack Long Short-Term Memory

IJCNLP 2015 elikip/bist-parser

We propose a technique for learning representations of parser states in transition-based dependency parsers.

TRANSITION-BASED DEPENDENCY PARSING

Distilling Knowledge for Search-based Structured Prediction

ACL 2018 Oneplus/twpipe

Many natural language processing tasks can be modeled into structured prediction and solved as a search problem.

MACHINE TRANSLATION STRUCTURED PREDICTION TRANSITION-BASED DEPENDENCY PARSING

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

EMNLP 2017 tzshi/dp-parser-emnlp17

We first present a minimal feature set for transition-based dependency parsing, continuing a recent trend started by Kiperwasser and Goldberg (2016a) and Cross and Huang (2016a) of using bi-directional LSTM features.

TRANSITION-BASED DEPENDENCY PARSING

Efficient Structured Inference for Transition-Based Parsing with Neural Networks and Error States

TACL 2016 sagae/nndep

Transition-based approaches based on local classification are attractive for dependency parsing due to their simplicity and speed, despite producing results slightly below the state-of-the-art.

FEATURE ENGINEERING STRUCTURED PREDICTION TRANSITION-BASED DEPENDENCY PARSING WORD EMBEDDINGS

Bidirectional Transition-Based Dependency Parsing

AAAI 2019 yuanyunzhe/bi-trans-parser

Traditionally, a transitionbased dependency parser processes an input sentence and predicts a sequence of parsing actions in a left-to-right manner.

TRANSITION-BASED DEPENDENCY PARSING