Given head lexicon vectors for nodes, the Tree LSTM of  can be extended by leveraging x t in calculating the corresponding c t .
x t is used to estimate the input (i t ), output 1 In this paper, we work on binary trees only, which is a common form for CKY and shift-reduce parsing.