基于图的事件排序和共指消解解码
Graph-Based Decoding for Event Sequencing and Coreference Resolution
摘要：
文本文档中的事件以复杂的方式相互关联。本文研究了两类关系：事件互指和事件排序。我们发现，流行的树状解码结构的自动事件共指是不适合事件排序。为此，我们提出了一个基于图的解码算法，适用于这两个任务。新的解码算法支持这两个任务的灵活功能集。从经验上讲，我们的事件共指系统在TAC-KBP 2015事件共指任务上实现了最先进的性能，我们的事件排序系统击败了强大的基于时间的，基于预言的基线。我们讨论了研究这些事件关系的挑战。
英文摘要：
Events in text documents are interrelated in complex ways. In this paper, we study two types of relation: Event Coreference and Event Sequencing. We show that the popular tree-like decoding structure for automated Event Coreference is not suitable for Event Sequencing. To this end, we propose a graph-based decoding algorithm that is applicable to both tasks. The new decoding algorithm supports flexible feature sets for both tasks. Empirically, our event coreference system has achieved state-of-the-art performance on the TAC-KBP 2015 event coreference task and our event sequencing system beats a strong temporal-based, oracle-informed baseline. We discuss the challenges of studying these event relations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
