We propose a novel search-based approach for greedy coreference resolution, where the mentions are processed in order and added to previous coreference clusters.
our work is orthogonal to this line of work, but domain constraints and rules can be incorporated into our model as done in .