Greedy, Joint Syntactic-Semantic Parsing with Stack LSTMs

By Swabha Swayamdipta, Miguel Ballesteros, Chris Dyer, Noah A. Smith. 2016

63 citations recorded by the source corpus.

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.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Graham Neubig
  2. Luke S. Zettlemoyer
  3. Noah A. Smith
  4. Mohit Bansal
  5. Yoav Goldberg
  6. Yejin Choi
  7. Percy Liang
  8. Christopher D. Manning

In Computer Vision and Pattern Recognition

  1. Luke S. Zettlemoyer
  2. Graham Neubig
  3. Noah A. Smith
  4. Mohit Bansal
  5. Michael Lewis
  6. Hannaneh Hajishirzi
  7. Jianfeng Gao
  8. Yoav Goldberg

Citations in the corpus