Greedy Transition-Based Dependency Parsing with Stack LSTMs.

We introduce a greedy transition-based parser that learns to represent parser states using recurrent neural networks. Our primary innovation that enables us to do this efficiently is a new control structure for sequential neural networks-the stack long short-term memory unit LSTM. Like the conventional stack data structures used in transition-based parsers, elements can be pushed to or popped from the top of the stack in constant time, but, in addition, an LSTM maintains a continuous space embedding of the stack contents. Our model captures three facets of the parser's state: i unbounded look-ahead into the buffer of incoming words, ii the complete history of transition actions taken by the parser, and iii the complete contents of the stack of partially built tree fragments, including their internal structures. In addition, we compare two different word representations: i standard word vectors based on look-up tables and ii character-based models of words. Although standard word embedding models work well in all languages, the character-based models improve the handling of out-of-vocabulary words, particularly in morphologically rich languages. Finally, we discuss the use of dynamic oracles in training the parser. During training, dynamic oracles alternate between sampling parser states from the training data and from the model as it is being learned, making the model more robust to the kinds of errors that will be made at test time. Training our model with dynamic oracles yields a linear-time greedy parser with very competitive performance.