def get_output(self, tree): logits = [] try: self.get_output_recursive(tree, logits) except Exception as e: display_tree(tree) raise e return tf.concat(0, logits)
def display_tree(t, lvl=0): prefix = ''.join(['>']*lvl) if t.word is not None: print("%s%s %s" % (prefix, t.label, t.word)) else: print("%s%s -" % (prefix, t.label)) # if t.left is None or t.right is None: # raise Exception("Tree node has no word but left and right child are None") if t.left: display_tree(t.left, lvl + 1) if t.right: display_tree(t.right, lvl + 1)