The whole sentence is rooted at a designated special symbol ROOT, thus the dependency graph for a sentence is constrained to be a rooted, directed tree.
for prefix, we directly use the last LSTM hidden vector in prefix to represent it, which equals to subtract a zero embedding.