DeepAI AI Chat
Log In Sign Up

Greedy, Joint Syntactic-Semantic Parsing with Stack LSTMs

06/29/2016
by   Swabha Swayamdipta, et al.
Universitat Pompeu Fabra
Carnegie Mellon University
University of Washington
0

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 algorithm has linear time, including feature extraction. On the CoNLL 2008--9 English shared tasks, we obtain the best published parsing performance among models that jointly learn syntax and semantics.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/24/2017

AMR Parsing using Stack-LSTMs

We present a transition-based AMR parser that directly generates AMR par...
10/11/2016

Keystroke dynamics as signal for shallow syntactic parsing

Keystroke dynamics have been extensively used in psycholinguistic and wr...
11/19/2014

Type-Driven Incremental Semantic Parsing with Polymorphism

Semantic parsing has made significant progress, but most current semanti...
01/21/2016

Syntax-Semantics Interaction Parsing Strategies. Inside SYNTAGMA

This paper discusses SYNTAGMA, a rule based NLP system addressing the tr...
05/29/2015

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

We propose a technique for learning representations of parser states in ...
03/21/2016

Stack-propagation: Improved Representation Learning for Syntax

Traditional syntax models typically leverage part-of-speech (POS) inform...
12/22/2014

Joint RNN-Based Greedy Parsing and Word Composition

This paper introduces a greedy parser based on neural networks, which le...