conll2mst.py

MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是 所有依存关系的得分的总和

#! /usr/bin/python

import sys;

# Open File
f = open(sys.argv[1],'rt');

wrds = ""; pos = ""; labs = ""; par = "";

for line in f:
    
    sent = line.split();

    if len(sent) > 0:
        wrds += sent[1] + "\t";
        pos += sent[4] + "\t";
        labs += sent[7] + "\t";
        par += sent[6] + "\t";
    else:
        print wrds; wrds = "";
        print pos; pos = "";
        print labs; labs = "";
        print par; par = "";
        print "";

f.close();