We find that using a recursive model with a memory cell improves results by 1.12 F-score, and thus we settle for the TreeLSTM composition function.
the initial configuration consists of a buffer filled with words and an empty stackpresented as the axiom in Figure 1.