, w n , we compute hidden states h t and cell states c t in the forward LSTM for 1 < t ≤ n: where σ is the logistic sigmoid, • is the componentwise product, and x t denotes a learned word embedding for w t .
instead of computing the full recursion, we reuse the existing latent states of the children and compute s global (e) with an incremental forward pass over a single recursive unit in the neural network.