The conditional probability p(ly|x) is decomposed as: in which (ly 1 , ly 2 , ..., ly M ) are words or dependency labels.
the hidden state s j at time step j is computed as follows: and the next token ly j , which may be a word or dependency label, will be generated as follows: In this paper, dependencies are defined as the dependency labels which are achieved from the Stanford Dependency Parser (Chen and Manning, 2014).