Paper: A Mention-Synchronous Coreference Resolution Algorithm Based On The Bell Tree

ACL ID P04-1018
Title A Mention-Synchronous Coreference Resolution Algorithm Based On The Bell Tree
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 2004
Authors

This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the best path from the root of the Bell tree to the leaf nodes. A Maximum Entropy model is used to rank these paths. The coreference performance on the 2002 and 2003 Auto- matic Content Extraction (ACE) data will be reported. We also train a coreference system using the MUC6 data and competitive results are obtained.