Event matching using the transitive closure of dependency relations

Abstract

This paper describes a novel event-matching strategy using features obtained from the transitive closure of dependency relations. The method yields a model capable of matching events with an F-measure of 66.5%. © 2008 Association for Computational Linguistics.