The search starts at the root, and a partitioning of the NPs is incrementally constructed as we move down the tree.
based on the coreference decisions it has made in the first i−1 levels of the tree, the algorithm determines at the ith level whether the ith NP should start a new cluster, or to which preceding cluster it should be assigned.