Large Margin Classification Using the Perceptron Algorithm
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Question answering passage retrieval using dependency relations
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Exploring correlation of dependency relation paths for answer extraction
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Quasi-synchronous grammars: alignment by soft projection of syntactic dependencies
StatMT '06 Proceedings of the Workshop on Statistical Machine Translation
Identifying types of claims in online customer reviews
NAACL-Short '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers
Divisible transition systems and multiplanar dependency parsing
Computational Linguistics
| Hi-index | 0.00 |
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%.