Graph-Based Decoding for Event Sequencing and Coreference Resolution
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Disambiguating Reference in Visually Grounded Dialogues through Joint Modeling of Textual and Multimodal Semantic Structures
Long-context Non-factoid Question Answering in Indic Languages
RAKG:Document-level Retrieval Augmented Knowledge Graph Construction
LegalCore: A Dataset for Legal Documents Event Coreference Resolution
The Role of Natural Language Processing Tasks in Automatic Literary Character Network Construction
IdentifyMe: A Challenging Long-Context Mention Resolution Benchmark for LLMs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.