A implementation with easy-first parsing, with explanations 4
Tree LSTMs are conceptually straightforward extension of RNN-LSTMs. Here’s what we need:

A parser (takes in a sentence and outputs the parse tree structure).


Stanford Core NLP/your own parser



Given the parse tree structure which implicitly contains how the word units should be progressively combined, convert this into a series of instructions which explicitly describes how the nodes should be combined.


Write a RNN that takes in a series of instructions on how to combine a list of inputs.