For each AMR graph, we generate a node sequence by depth-first traversal order.
given a representation sequence from r 1 to r n , the hidden forward and backward states of r i are defined as: where LSTM f is a forward LSTM and LSTM b is a backward LSTM.