Event matching using the transitive closure of dependency relations

ACL-08: HLT - 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference

Volumn , Issue , 2008, Pages 145-148

  Bikel, Daniel M ^a   Castelli, Vittorio ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

DEPENDENCY RELATION; EVENT MATCHING; F MEASURE; TRANSITIVE CLOSURE;

PATTERN MATCHING;

EID: 84859887414     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1557690.1557729     Document Type: Conference Paper

References (7)

1. Giuseppe Attardi, Antonio Cisternino, Francesco Formica, Maria Simi, Alessandro Tommasi, Ellen M. Voorhees, and D. K. Harman. 2001. Selectively using relations to improve precision in question answering. In TREC-10, Gaithersburg, Maryland.
2. Hang Cui, Renxu Sun, Keya Li, Min-Yen Kan, and Tat- Seng Chua. 2005. Question answering passage retrieval using dependency relations. In SIGIR 2005, Salvador, Brazil, August.
3. Radu Florian, Hani Hassan, Abraham Ittycheriah, Hongyan Jing, Nanda Kambhatla, Xiaoqiang Luo, Nicholas Nicolov, and Salim Roukos. 2004. A statistical model for multilingual entity detection and tracking. In HLT-NAACL 2004, pages 1-8.
4. Yoav Freund and Robert E. Schapire. 1999. Large margin classification using the perceptron algorithm. Machine Learning, 37(3):277-296.
5. Dan Shen and Dietrich Klakow. 2006. Exploring correlation of dependency relation paths for answer extraction. In COLING-ACL 2006, Sydney, Australia.
6. David A. Smith and Jason Eisner. 2006. Quasisynchronous grammars: Alignment by soft projection of syntactic dependencies. In HLT-NAACL Workshop on Statistical Machine Translation, pages 23-30.
7. Mengqiu Wang, Noah A. Smith, and Teruko Mitamura. 2007. What is the Jeopardy model? a quasisynchronous grammar for QA. In EMNLP-CoNLL 2007, pages 22-32.