Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Transition-Based Dependency Parsing with Stack Long Short-Term Memory   We propose a technique for learning representations of parser states in
transition-based dependency parsers. Our primary innovation is a new control
structure for sequence-to-sequence neural networks---the stack LSTM. Like the
conventional stack data structures used in transition-based parsing, 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.
This lets us formulate an efficient parsing model that captures three facets of
a parser's state: (i) unbounded look-ahead into the buffer of incoming words,
(ii) the complete history of actions taken by the parser, and (iii) the
complete contents of the stack of partially built tree fragments, including
their internal structures. Standard backpropagation techniques are used for
training and yield state-of-the-art parsing performance.

31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
13
The categories of this paper are: quant-ph
33
The categories of this paper are: plasm-ph
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
7
The categories of this paper are: hep-th
2
The categories of this paper are: math
17
The categories of this paper are: q-fin
12
The categories of this paper are: nucl-th
25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th
3
The categories of this paper are: physics
5
The categories of this paper are: gr-qc
15
The categories of this paper are: nucl-ex