A mention-synchronous coreference resolution algorithm based on the Bell tree 论文

2004引用 220
Natural Language Processing TechniquesAdvanced Text Analysis TechniquesAlgorithms and Data Compression

详细信息

发表日期
2004-01-01
发表年份
2004

关键词

Natural Language Processing TechniquesAdvanced Text Analysis TechniquesAlgorithms and Data Compression

摘要

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.