mst2conll.py

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

#! /usr/bin/python

import sys;

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

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

for line in f:

    if len(line.strip()) == 0:
        w = wrds.split(); p = pos.split(); l = labs.split(); pa = par.split();
        cnt = 1;
        for t in w:
            print str(cnt) + "\t" + t + "\t" + t + "\t" + p[cnt-1] + "\t" + p[cnt-1] + "\t_\t" + pa[cnt-1] + "\t" + l[cnt-1];
            cnt += 1;
        print "";
        wrds = ""; pos = ""; labs = ""; par = "";
    elif len(wrds) == 0:
        wrds = line;
    elif len(pos) == 0:
        pos = line;
    elif len(labs) == 0:
        labs = line;
    else:
        par = line;

f.close();