This paper proposes an evaluation scheme to measure the performance of a system that detects hierarchical event structure for event coreference resolution. We show that each system output is represented as a forest of unordered trees, and introduce the notion of conceptual event hierarchy to simplify the evaluation process. We enu-merate the desiderata for a similarity met-ric to measure the system performance. We examine three metrics along with the desiderata, and show that metrics extended from MUC and BLANC are more ade-quate than a metric based on Simple Tree Matching.
Event coreference resolution aims to determine and cluster event mentions that refer to the same rea...
This paper presents a method to compute metrics that predict maintainability of a system with respe...
In past years, there has been substantial work on the problem of entity coreference resolution where...
In the task of event coreference resolution, recent work has shown the need to perform not only full...
Event Coreference is an important module in the event extraction task, which has been shown to be d...
A simple conceptual model is employed to investigate events, and break the task of coreference resol...
In past years, there has been substantial work on the problem of entity coreference resolution where...
Motivated by the recent successful application of span-based models to entity-based information extr...
The task of event coreference resolution plays a critical role in many natural language pro-cessing ...
Event coreference is an important task for full text analysis. However, previous work uses a variety...
Methods that measure compatibility between mention pairs are currently the dominant approach to core...
Events and their coreference offer use-ful semantic and discourse resources. We show that the semant...
<p>Performance Comparison with Existing Event Detection Methods (Precision, Recall, F-measure).</p
This thesis entitled A Performance Analysis Framework for Coreference Resolution Algorithms, focuses...
: This paper presents a notation for extracting complex performance measurements of parallel softwar...
Event coreference resolution aims to determine and cluster event mentions that refer to the same rea...
This paper presents a method to compute metrics that predict maintainability of a system with respe...
In past years, there has been substantial work on the problem of entity coreference resolution where...
In the task of event coreference resolution, recent work has shown the need to perform not only full...
Event Coreference is an important module in the event extraction task, which has been shown to be d...
A simple conceptual model is employed to investigate events, and break the task of coreference resol...
In past years, there has been substantial work on the problem of entity coreference resolution where...
Motivated by the recent successful application of span-based models to entity-based information extr...
The task of event coreference resolution plays a critical role in many natural language pro-cessing ...
Event coreference is an important task for full text analysis. However, previous work uses a variety...
Methods that measure compatibility between mention pairs are currently the dominant approach to core...
Events and their coreference offer use-ful semantic and discourse resources. We show that the semant...
<p>Performance Comparison with Existing Event Detection Methods (Precision, Recall, F-measure).</p
This thesis entitled A Performance Analysis Framework for Coreference Resolution Algorithms, focuses...
: This paper presents a notation for extracting complex performance measurements of parallel softwar...
Event coreference resolution aims to determine and cluster event mentions that refer to the same rea...
This paper presents a method to compute metrics that predict maintainability of a system with respe...
In past years, there has been substantial work on the problem of entity coreference resolution where...