To generate each child, we create a node embedding \(e_t\)  computed the same way as the tree decoder by [1]}. We then generate the node's token by finding the most probable token out of the set of possibilities as follows:
\(t_t = \textbf {argmax softmax}(W_k e_t).\) 
