Verifying binding constraints for anaphor resolution
Algorithmic approaches to anaphor resolution are known to benefit substantially from syntactic disjoint reference filters. Typically, however, there is a considerable gap between the scope of the formal model of grammar employed for deriving referential evidence and its implementation. While accounting for many subtleties of language, such formal models at most partially address the algorithmic aspects of referential processing. This paper investigates the issue of implementing syntactic disjoint reference for robust anaphor resolution. An algorithmic account of binding condition verification will be developed that, on one hand, captures the theoretical subtleties, and, on the other hand, exhibits computational efficiency and fulfils the robustness requirements. Taking as input the potentially fragmentary parses of a robust state-of-the-art parser, the practical performance of this algorithm will be evaluated with respect to the task of anaphor resolution and shown to be nearly optimal.