Enforcing Consistency on Coreference Sets
Manfred Klenner · Zurich Open Repository and Archive (University of Zurich) · 2007
We show that intra-sentential binding constraints can act as global constraints that -via transitivity -enforce consistency on coreference sets.This yields about 5 % increase in performance.In our model, the probabilities of a baseline classi er for coreference resolution are used as weights in an optimization model.The underlying integer linear programming (ILP) speci cation is straightforward -binding constraints give rise to (local) exclusiveness of markables, transitivity propagates these restrictions and enforces the re-computation of coreference sets.