Event matching using the transitive closure of dependency relations

Daniel M. Bikel; Vittorio Castelli

doi:10.3115/1557690.1557729

ACL 2008

Conference paper

15 Jun 2008

Event matching using the transitive closure of dependency relations

View publication

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.

Conference paper