'Starting with the ``root`` node, build a dependency tree using the NLTK
``Tree`` constructor. Dependency labels are omitted.'

def tree(self):

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