会议专题

End-to-End Coreference Resolution via Hypergraph Partitioning

We describe a novel approach to coreference resolution which implements a global decision via hypergraph partitioning. In constrast to almost all previous approaches, we do not rely on separate classification and clustering steps, but perform coreference resolution globally in one step. Our hypergraph-based global model implemented within an endto- end coreference resolution system outperforms two strong baselines (Soon et al., 2001; Bengtson & Roth, 2008) using system mentions only.

Jie Cai Michael Strube

Natural Language Processing GroupHeidelberg Institute for Theoretical Studies gGmbH Natural Language Processing Group Heidelberg Institute for Theoretical Studies gGmbH

国际会议

The 23rd International Conference on Computational Linguistics(第23届国际计算语言学大会)

北京

英文

143-151

2010-08-01(万方平台首次上网日期,不代表论文的发表时间)