treeBinarizer.py 文件源码

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

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

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

    tr.append(tmpNode)