The combination is relative simple and its correctness can be measured with the final representation of the non-terminal node (Socher et al., 2013a).
for dependency parsing, all combinations of the head h and its children c i (0 < i ≤ K) are important to measure the correctness of the subtree.