Figure 3: Recurrent tree communication model.
given a constituent tree, for each constituent node j, the initial state h ′ j is obtained using a tree-LSTM: where h ′ j is the hidden state of the node j, c ′ j is the cell state of node j, left(j) denote the left child of node j, right(j) denotes the right child of node j.