Extracting relations with integrated information using kernel methods

ABSTRACT

Entity relation detection is a form of information extraction that finds predefined relations between pairs of entities in text. This paper describes a relation detection approach that combines clues from different levels of syntactic processing using kernel methods. Information from three different levels of processing is considered: tokenization, sentence parsing and deep dependency analysis. Each source of information is represented by kernel functions. Then composite kernels are developed to integrate and extend individual kernels so that processing errors occurring at one level can be overcome by information from other levels. We present an evaluation of these methods on the 2004 ACE relation detection task, using Support Vector Machines, and show that each level of syntactic processing contributes useful information for this task. When evaluated on the official test data, our approach produced very competitive ACE value scores. We also compare the SVM with KNN on different kernels.

References

1. M. Collins and S. Miller. 1997. Semantic tagging using a probabilistic context free grammar. In Proceedings of the 6th Workshop on Very Large Corpora.
2. N. Cristianini and J. Shawe-Taylor. 2000. An introduction to support vector machines. Cambridge University Press.
3. A. Culotta and J. Sorensen. 2004. Dependency Tree Kernels for Relation Extraction. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics.
4. D. Gildea and M. Palmer. 2002. The Necessity of Parsing for Predicate Argument Recognition. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics.
5. N. Kambhatla. 2004. Combining Lexical, Syntactic, and Semantic Features with Maximum Entropy Models for Extracting Relations. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics.
6. P. Kingsbury and M. Palmer. 2002. From treebank to propbank. In Proceedings of the 3rd International Conference on Language Resources and Evaluation (LREC-2002).
7. C. D. Manning and H. Schutze 2002. Foundations of Statistical Natural Language Processing. The MIT Press, page 454--455.
8. A. Meyers, R. Grishman, M. Kosaka and S. Zhao. 2001. Covering Treebanks with GLARF. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics.
9. A. Meyers, R. Reeves, Catherine Macleod, Rachel Szekeley, Veronkia Zielinska, Brian Young, and R. Grishman. 2004. The Cross-Breeding of Dictionaries. In Proceedings of the 5th International Conference on Language Resources and Evaluation (LREC-2004).
10. S. Miller, H. Fox, L. Ramshaw, and R. Weischedel. 2000. A novel use of statistical parsing to extract information from text. In 6th Applied Natural Language Processing Conference.
11. K.-R. Müller, S. Mika, G. Ratsch, K. Tsuda and B. Scholkopf. 2001. An introduction to kernel-based learning algorithms, IEEE Trans. Neural Networks, 12, 2, pages 181--201.
12. V. N. Vapnik. 1998. Statistical Learning Theory. Wiley-Interscience Publication.
13. D. Zelenko, C. Aone and A. Richardella. 2003. Kernel methods for relation extraction. Journal of Machine Learning Research.
14. Shubin Zhao, Adam Meyers, Ralph Grishman. 2004. Discriminative Slot Detection Using Kernel Methods. In the Proceedings of the 20th International Conference on Computational Linguistics.

• Computing methodologies

  • Artificial intelligence

• Hardware

  • Power and energy

    • Power estimation and optimization