As shown in Section 2, the search space of the coreference problem can be represented by the Bell tree.
the search problem reduces to creating the Bell tree while keeping track of path scores and picking the top-N best paths.