Our hypergraph can be represented as a n × m incidence matrix with entries is the number of times v i ∈ e j occurs in the corpus.
as in any tree structure, each leaf node has a defined path from the root node to itself.