paper-with-me

홈 › Papers

AMR Parsing using Stack-LSTMs

2017-07-24 · EMNLP 2017 9 · Miguel Ballesteros, Yaser Al-Onaizan

We present a transition-based AMR parser that directly generates AMR parses from plain text. We use Stack-LSTMs to represent our parser state and make decisions greedily. In our experiments, we show that our parser achieves very competitive scores on English using only AMR training data. Adding additional information, such as POS tags and dependency trees, improves the results further.

📄 PDF Abstract BibTeX arXiv:1707.07755

Code (0)

등록된 구현이 없습니다.

Tasks

AMR ParsingPOS

Similar Papers 제목 키워드 기반

Transition-based DRS Parsing Using Stack-LSTMs

2019-05-01 · WS 2019 5 · Kilian Evang

We present our submission to the IWCS 2019 shared task on semantic parsing, a transition-based parser that uses explicit word-meaning pairings, but no explicit representation of syntax. Parsing decisions are made based o…

DRS ParsingSemantic 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

Greedy, Joint Syntactic-Semantic Parsing with Stack LSTMs

2016-06-29 · CONLL 2016 8 · Swabha Swayamdipta, Miguel Ballesteros, Chris Dyer, Noah A. Smith

We present a transition-based parser that jointly produces syntactic and semantic dependencies. It learns a representation of the entire algorithm state, using stack long short-term memories. Our greedy inference algorit…

Semantic Parsing

IBM Research at the CoNLL 2018 Shared Task on Multilingual Parsing

2018-10-01 · CONLL 2018 10 · Hui Wan, Tahira Naseem, Young-suk Lee, Vittorio Castelli 외

This paper presents the IBM Research AI submission to the CoNLL 2018 Shared Task on Parsing Universal Dependencies. Our system implements a new joint transition-based parser, based on the Stack-LSTM framework and the Arc…

ARCDependency ParsingMorphological TaggingPart-Of-Speech Tagging+2

Tree-Stack LSTM in Transition Based Dependency Parsing

2018-10-01 · CONLL 2018 10 · {\"O}mer K{\i}rnap, Erenay Dayan{\i}k, Deniz Yuret

We introduce tree-stack LSTM to model state of a transition based parser with recurrent neural networks. Tree-stack LSTM does not use any parse tree based or hand-crafted features, yet performs better than models with th…

Dependency ParsingLemmatizationMorphological AnalysisMorphological Tagging+2