For Y 's parse tree T , instead of directly modeling the tree itself, we predict a parsing action sequence A which can map Y to T .
at top level our SD-NMT model can be formulated as where Two recurrent neural networks, Word-RNN and Action-RNN, are used to model generation processes of translation sequence Y and parsing action sequence A respectively.