Combining MST Algorithm and Deterministic Algorithm for Chinese Dependency Parsing

We present a mentod to combine the maximum spanning tree(MST) algorithm and the deterministic algorithmfor Chinese dependency parssing.We introduce the results and the dependency degree of Nivre parser into MST parser.Our system achieves the accuracy of 86.49% using 10-fold cross-validation on the Penn Chinese Treebank Corpus,which is a significant improvmentin the parsing accuracy.