Daniel M. Bikel, Vittorio Castelli
ACL 2008
Conference paper
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.
Related
Vittorio Castelli, Luis Alfonso Lastras-Montaño
IEEE Trans. Inf. Theory
Yuan-Chi Chang, Lawrence Bergman, et al.
SIGMOD Record (ACM Special Interest Group on Management of Data)
Conference paper
Finding what matters in questions
Xiaoqiang Luo, Hema Raghavan, et al.
NAACL-HLT 2013