dependencygraph.py 文件源码

def tree(self):
        """
        Starting with the ``root`` node, build a dependency tree using the NLTK
        ``Tree`` constructor. Dependency labels are omitted.
        """
        node = self.root

        word = node['word']
        deps = chain.from_iterable(node['deps'].values())
        return Tree(word, [self._tree(dep) for dep in deps])