Furthermore, each node can have at most three parent nodes, created by transitions RArc, LArc and Reduce, respectively.
similarly, we train a binary classifier for deciding whether or not to create a reentrant edge after a Reduce: in this case we use word and POs embeddings for the two nodes being connected and their parent as well as dependency label embeddings for the arcs between them.