treeBinarizer.py 文件源码

def leftBinarize(tr):
    children = []
    for child in tr:
        children.append(child)

    tmpNode = children[0] 
    i = 1
    while i < len(children) - 1:
        tmpNode2 = nltk.Tree("(X)")
        tmpNode2.append(tmpNode)
        tmpNode2.append(children[i])
        tmpNode = tmpNode2
        i += 1

    while len(tr) > 1:
        tr.pop(0)

    tr.insert(0, tmpNode)