Before revision:  Given a set of input terms, we assign a score for the likelihood that each pair of terms forms a parent-child relation . To produce a tree from pairwise parent-child edge scores, we treat this as a graph optimization problem and output the maximum spanning tree  .
After revision:  Given a set of input terms, we assign a score for the likelihood that each pair of terms forms a parent-child relation scores. The tree reconciliation module treats the task as a graph optimization problem and output the maximum spanning tree .