Event Matching Using the Transitive Closure of Dependency Relations

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%.

• Type: Conference
• Year: 2008
• Where: ACL
• Authors: Daniel M. Bikel, Vittorio Castelli
• Keywords: ACL 2008, Computational Linguistics, Dependency Relations, Paper, Transitive Closure