Stack-based Multi-layer Attention for Transition-based Dependency Parsing

2017-09-01 · EMNLP 2017 9 · Zhirui Zhang, Shujie Liu, Mu Li, Ming Zhou, Enhong Chen

Although sequence-to-sequence (seq2seq) network has achieved significant success in many NLP tasks such as machine translation and text summarization, simply applying this approach to transition-based dependency parsing cannot yield a comparable performance gain as in other state-of-the-art methods, such as stack-LSTM and head selection. In this paper, we propose a stack-based multi-layer attention model for seq2seq learning to better leverage structural linguistics information. In our method, two binary vectors are used to track the decoding stack in transition-based parsing, and multi-layer attention is introduced to capture multiple word dependencies in partial trees. We conduct experiments on PTB and CTB datasets, and the results show that our proposed model achieves state-of-the-art accuracy and significant improvement in labeled precision with respect to the baseline seq2seq model.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Dependency ParsingLanguage ModelingLanguage Modelling Machine Translation Text SummarizationTransition-Based Dependency ParsingTranslation

Methods 이 논문이 사용한 방법론

Sigmoid Activation 설명 없음

Tanh Activation 설명 없음

LSTM An LSTM is a type of recurrent neural network that addresses the vanishing gradient problem in vanilla…

Seq2Seq Seq2Seq, or Sequence To Sequence, is a model used in sequence prediction tasks, such as language modelling and machine translation. The idea is to use one…

Transition-based Parsing with Stack-Transformers

2020-10-20 · Findings of the Association for Computational Linguistics 2020 · Ramon Fernandez Astudillo, Miguel Ballesteros, Tahira Naseem, Austin Blodgett 외

Modeling the parser state is key to good performance in transition-based parsing. Recurrent Neural Networks considerably improved the performance of transition-based systems by modelling the global state, e.g. stack-LSTM…

Abstract Meaning Representation AMR Parsing

Stack-Pointer Networks for Dependency Parsing

2018-05-03 · ACL 2018 7 · Xuezhe Ma, Zecong Hu, Jingzhou Liu, Nanyun Peng 외

We introduce a novel architecture for dependency parsing: \emph{stack-pointer networks} (\textbf{\textsc{StackPtr}}). Combining pointer networks~\citep{vinyals2015pointer} with an internal stack, the proposed model first…

Dependency Parsing Sentence

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

2015-05-29 · IJCNLP 2015 7 · Chris Dyer, Miguel Ballesteros, Wang Ling, Austin Matthews 외

We propose a technique for learning representations of parser states in transition-based dependency parsers. Our primary innovation is a new control structure for sequence-to-sequence neural networks---the stack LSTM. Li…

Dependency Parsing Transition-Based Dependency Parsing

Arc-Standard Spinal Parsing with Stack-LSTMs

2017-09-01 · WS 2017 9 · Miguel Ballesteros, Xavier Carreras

We present a neural transition-based parser for spinal trees, a dependency representation of constituent trees. The parser uses Stack-LSTMs that compose constituent nodes with dependency-based derivations. In experiments…

ARC

Left-to-Right Dependency Parsing with Pointer Networks

2019-06-01 · NAACL 2019 6 · Daniel Fern{\'a}ndez-Gonz{\'a}lez, Carlos G{\'o}mez-Rodr{\'\i}guez

We propose a novel transition-based algorithm that straightforwardly parses sentences from left to right by building n attachments, with n being the length of the input sentence. Similarly to the recent stack-pointer par…