keyboard_arrow_up
Event Coreference Resolution using Mincut based Graph Clustering

Authors

Sangeetha.S and Michael Arock, National Institute of technology, India

Abstract

To extract participants of an event instance, it is necessary to identify all the sentences that describe the event instance. The set of all sentences referring to the same event instance are said to be corefering each other. Our proposed approach formulates the event coreference resolution as a graph based clustering model. It identifies the corefering sentences using minimum cut (mincut) based on similarity score between each pair of sentences at various levels such as trigger word similarity, time stamp similarity, entity similarity and semantic similarity. It achieves good B-Cubed F-measure score with some loss in recall.

Keywords

Event coreference resolution, ACE event.

Full Text  Volume 2, Number 4