The output is then used for the next and final step (3) of constructing the prop-erty tree.
we construct a fully connected directed graph G = {V, E} with the entities as nodes V , and edges E representing the part-of relation with the respective classifier scores as weights.