Printing Hierarchical Structure with Numbering and Indentation

NLP | Creating Shallow Tree

Last Updated : 26 Feb, 2019

Prerequisite: Flattening Deep Tree We have flattened a Deep Tree by only keeping the lowest level subtrees. But here we can keep the highest level subtrees instead. Code #1 : Lets' understand shallow_tree()

Python3 1==

from nltk.tree import Tree

def shallow_tree(tree):
        children = []
        
    for t in tree:
        if t.height() < 3:
            children.extend(t.pos())
    else:
        children.append(Tree(t.label(), t.pos()))
        
    return Tree(tree.label(), children)

Code #2 : Evaluating

Python3 1==

from transforms import shallow_tree
from nltk.corpus import treebank
 
print ("Deep Tree : \n", treebank.parsed_sents()[0])

print ("\nShallow Tree : \n", shallow_tree(treebank.parsed_sents()[0]) )

Output :

Deep Tree : 
 (S
  (NP-SBJ
    (NP (NNP Pierre) (NNP Vinken))
    (,, )
    (ADJP (NP (CD 61) (NNS years)) (JJ old))
    (,, ))
  (VP
    (MD will)
    (VP
      (VB join)
      (NP (DT the) (NN board))
      (PP-CLR (IN as) (NP (DT a) (JJ nonexecutive) (NN director)))
      (NP-TMP (NNP Nov.) (CD 29))))
  (. .))

Shallow Tree :
Tree('S', [Tree('NP-SBJ', [('Pierre', 'NNP'), ('Vinken', 'NNP'), (', ', ', '), 
('61', 'CD'), ('years', 'NNS'), ('old', 'JJ'), (', ', ', ')]),
Tree('VP', [('will', 'MD'), ('join', 'VB'), ('the', 'DT'), ('board', 'NN'), 
('as', 'IN'), ('a', 'DT'), ('nonexecutive', 'JJ'), ('director', 'NN'), 
('Nov.', 'NNP'), ('29', 'CD')]), ('.', '.')])

How it works ?

shallow_tree() function creates new child trees by iterating over each of the top-level subtrees.
The subtree is replaced by a list of its part-of-speech tagged children, if the height() of a subtree is less than 3.
If children of a tree are the part-of-speech tagged leaves, the All other subtrees are replaced by a new Tree.
Thus, eliminates all the nested subtrees while still retaining the top-level subtrees.

Code #3 : height

Python3 1==

print ("height of tree : ", 
       treebank.parsed_sents()[0].height())

print ("\nheight of shallow tree : ", 
       shallow_tree(treebank.parsed_sents()[0]).height())

Output :

height of tree : 7

height of shallow tree :3

Printing Hierarchical Structure with Numbering and Indentation

mohit gupta_omg :)

Improve

Article Tags :

Practice Tags :

Similar Reads

NLP | Flattening Deep Tree

Some of the corpora that we use are often deep trees of nested phrases. But working on such deep trees is a tedious job for training the chunker. As IOB tag parsing is not designed for nested chunks. So, in order to use these trees for chunker training, we must flatten them. Well, POS (part of Speec

NLP | Chunk Tree to Text and Chaining Chunk Transformation

We can convert a tree or subtree back to a sentence or chunk string. To understand how to do it - the code below uses the first tree of the treebank_chunk corpus.Â Code #1: Joining the words in a tree with space.Â Python3 # Loading library from nltk.corpus import treebank_chunk # tree tree = treeban

Construct a special tree from given preorder traversal

Given an array pre[] that represents the Preorder traversal of a special binary tree where every node has either 0 or 2 children. One more array preLN[] is given which has only two possible values â€˜Lâ€™ and â€˜Nâ€™. The value â€˜Lâ€™ in preLN[] indicates that the corresponding node in Binary Tree is a leaf no

Creating a tree with Left-Child Right-Sibling Representation

Left-Child Right-Sibling Representation is a different representation of an n-ary tree where instead of holding a reference to each and every child node, a node holds just two references, first a reference to its first child, and the other to its immediate next sibling. This new transformation not o

Printing Hierarchical Structure with Numbering and Indentation

Consider the below diagram , which shows a sort of hierarchical organization for a company . Electronics R'Us has four departments namely R&D , Sales, Purchasing , Manufacturing . Sales is subsequently divide into Domestic and International categories and so on . We need to generate an output wh

Level Ancestor Problem

The level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a given node at a given depth from the root of the tree. Here depth of any node in a tree is the number of edges on the shortest path from the root of the tree to

Custom Tree Problem

You are given a set of links, e.g. a ---> b b ---> c b ---> d a ---> e Print the tree that would form when each pair of these links that has the same character as start and end point is joined together. You have to maintain fidelity w.r.t. the height of nodes, i.e. nodes at height n from

Introduction to Link-Cut Tree

Link Cut Trees (LCT) is a data structure that allows for efficient dynamic maintenance of trees. It is a type of self-adjusting data structure that allows for efficient manipulation of trees, such as link and cut operations, find-root, and access. The implementation of an LCT typically consists of a

B-Tree Insert without aggressive splitting

B-Tree Insert without aggressive splittingThis algorithm for insertion takes an entry, finds the leaf node where it belongs, and inserts it there. We recursively insert the entry by calling the insert algorithm on the appropriate child node. This procedure results in going down to the leaf node wher

Print N-ary tree graphically

Given an N-ary tree, the task is to print the N-ary tree graphically.Graphical Representation of Tree: A representation of tree in which the root is printed in a line and the children nodes are printed in subsequent lines with some amount of indentation. Examples: Input: 0 / | \ / | \ 1 2 3 / \ / |