Then we traverse this tree in a Depthfirst pre-order traversal, which is the search tree in which tree is traversed from its left subtree to right subtree recursively until current node is empty, to create output with a linearized tree structure to train the model.
for each rooted subtree, governors and dependency labels of the sentence are predicted first, and their information will be used to predict the next dependent words.