A Mention-Synchronous Coreference Resolution Algorithm Based On the Bell Tree

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 Automatic Content Extraction (ACE) data will be reported. We also train a coreference system using the MUC6 data and competitive results are obtained.

• Type: Conference
• Year: 2004
• Where: ACL
• Authors: Xiaoqiang Luo, Abraham Ittycheriah, Hongyan Jing, Nanda Kambhatla, Salim Roukos
• Keywords: ACL 2004, ACL 2007, Bell Tree, Coreference Resolution, Coreference Resolution Problem