MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是 所有依存关系的得分的总和，从而依存分析的问题转化成如何寻找最高...

代码说明：

MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是 所有依存关系的得分的总和，从而依存分析的问题转化成如何寻找最高得分的依存树。-Spanning tree is the largest MSTParser theory-based discriminant Parser interdependence. Section 1 will be scored as interdependent tree are all interdependent relationship between the sum of the scores, thus the analysis of interdependence into question how to find the highest scoring tree interdependence.