Greedy, Joint Syntactic-Semantic Parsing with Stack LSTMs

06/29/2016
by   Swabha Swayamdipta, et al.
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

Please sign up or login with your details

Forgot password? Click here to reset