For the backward span level LSTM, we do it the same way just in reversed order.
we decrease the computational complexity of computing the semantic representations for all possible span pairs which is the most time-consuming part of the original parsing process from O(n 4 ) to O(n 2 ).