Pronominal Anaphora Resolution for Unrestricted Text
Anna Kupść, Teruko Mitamura, Benjamin Van Durme, Eric Nyberg · 2004
The paper presents an anaphora resolution algorithm for unrestricted text.In particular, we examine portability of a knowledge-based approach of (Mitamura et al., 2002), proposed for a domain-specific task.We obtain up to 70% accuracy on unrestricted text, which is a significant improvement (almost 20%) over a baseline we set for general text.As the overall results leave much room for improvement, we provide a detailed error analysis and investigate possible enhancements.