2004 DependencyTreeKernelsForRelationExtraction

• (Culotta & Sorensen, 2004) ⇒ Aron Culotta, and Jeffrey S. Sorensen. (2004). “Dependency Tree Kernels for Relation Extraction.” In: Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL 2004). doi:10.3115/1218955.1219009

Subject Headings: Relation Recognition from Text Algorithm, ACE Benchmark Task, Tree Kernel.

Cited By

• ~315 http://scholar.google.com/ …

2007

• (Banko et al., 2007) ⇒ Michele Banko, Michael J. Cafarella, Stephen Soderland, Matt Broadhead, and Oren Etzioni. (2007). “Open Information Extraction from the Web.” In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2007).

2006

• (Zhang et al., 2006) ⇒ M. Zhang, J. Zhang, and J. Su. (2006). “Exploring Syntactic Features for Relation Extraction using a Convolution Tree Kernel.” In: Proceedings of HLT-2006.
  • QUOTE: Culotta and Sorensen (2004) generalize this kernel to estimate similarity between dependency trees. One may note that their tree kernel requires the matchable nodes must be at the same depth counting from the root node. This is a strong constraint on the matching of syntax so it is not surprising that the model has good precision but very low recall on the ACE corpus (Zhao and Grishman, 2005). In addition, according to the top-down node matching mechanism of the kernel, once a node is not matchable with any node in the same layer in another tree, all the sub-trees below this node are discarded even if some of them are matchable to their counterparts in another tree.
• (Culotta et al., 2006) ⇒ Aron Culotta, Andrew McCallum, and Jonathan Betz. (2006). “Integrating Probabilistic Extraction Models and Data Mining to Discover Relations and Patterns in Text.” In: Proceedings of HLT-NAACL Conference (HLT-NAACL 2006). doi:10.3115/1220835.1220873

2005

• (Zhao & Grishman, 2005) ⇒ S. Zhao and Ralph Grishman. (2005). “Extracting Relations with Integrated Information Using Kernel Methods.” In: Proceedings of or ACL-2005.
  • QUOTE: Culotta and Sorensen (2004) described a slightly generalized version of this kernel based on dependency trees. Since their kernel is a recursive match from the root of a dependency tree down to the leaves where the entity nodes reside, a successful match of two relation examples requires their entity nodes to be at the same depth of the tree. This is a strong constraint on the matching of syntax so it is not surprising that the model has good precision but very low recall. In their solution a bag-of-words kernel was used to compensate for this problem. In our approach, more flexible kernels are used to capture regularization in syntax, and more levels of syntactic information are considered.

Quotes

Abstract

We extend previous work on tree kernels to estimate the similarity between the dependency trees of sentences. Using this kernel within a Support Vector Machine, we detect and classify relations between entities in the Automatic Content Extraction (ACE) corpus of news articles. We examine the utility of different features such as Wordnet hypernyms, parts of speech, and entity types, and find that the dependency tree kernel achieves a 20% F1 improvement over a “bag-of-words” kernel.

References

• (Agichtein and Gravano, 2000) ⇒ Eugene Agichtein and L. Gravano. (2000). “Snowball: Extracting Relations from Large Plain-Text Collections.” In: Proceedings of the 5th ACM International Conference on Digital Libraries (DL-2000).
• (Brin, 1998) ⇒ Sergey Brin. (1998). “Extracting Patterns and Relations from the World Wide Web.” In: Proceedings of the EDBT 1998 Workshop on the Web and Databases (WebDB 1998).
• (Collins and Duffy, 2001) ⇒ Michael Collins and N. Duffy. (2001). “Convolution Kernels for Natural Language.” In: Proceedings of NIPS-2001.
• (Cortes and Vapnik) ⇒ C. Cortes and Vladimir N. Vapnik. (1995). “Support Vector Networks.” Machine Learning, 20(3).
• N. Cristianini and John Shawe-Taylor. (2000). An introduction to support vector machines. Cambridge University Press.
• (Cumby and Roth, 2003) ⇒ C. M. Cumby and Dan Roth. (2003). “On Kernel Methods for Relational Learning.” In: Proceedings of ICML-2003.
• K. Fukunaga. (1990). Introduction to Statistical Pattern Recognition. Academic Press, second edition.
• (Haussler, 1999) ⇒ D. Haussler. (1999). “Convolution Kernels on Discrete Structures.” Technical Report UCSC-CLR-99-10, University of California at Santa Cruz.
• Thorsten Joachims, Nello Cristianini, and John Shawe-Taylor. (2001). Composite kernels for hypertext categorisation. In Carla E. Brodley and Andrea Danyluk, editors, Proceedings of ICML-01, 18th International Conference on Machine Learning, pages 250–257, Williams College, US. Morgan Kaufmann Publishers, San Francisco, US.
• Huma Lodhi, John Shawe-Taylor, Nello Cristianini, and Christopher J. C. H. Watkins. (2000). Text classification using string kernels. In NIPS, pages 563–569.
• Andrew McCallum and Ben Wellner. (2003). Toward conditional models of identity uncertainty with application to proper noun coreference. In IJCAI Workshop on Information Integration on the Web.
• (MillerFRW, 2000) ⇒ S. Miller, H. Fox, L. Ramshaw, and R. Weischedel. (2000). “A novel use of statistical parsing to extract information from text.” In: Proceedings of NAACL-2000.
• H. Pasula, B. Marthi, B. Milch, S. Russell, and I. Shpitser. (2002). Identity uncertainty and citation matching.
• Dan Roth and Wen-tau Yih. (2002). Probabilistic reasoning for entity and relation recognition. In 19th International Conference on Computational Linguistics.
• (Scott & Matwin, 1999) ⇒ Sam Scott, and Stan Matwin. (1999). “Feature Engineering for Text Classification.” In: Proceedings of 16th International Conference on Machine Learning (ICML 1999).
• Erik F. Tjong Kim Sang and Fien De Meulder. (2003). Introduction to the CoNLL-2003 shared task: Language-independent named entity recognition. In Walter Daelemans and Miles Osborne, editors, Proceedings of CoNLL-2003, pages 142–147. Edmonton, Canada.
• Vladimir N. Vapnik. (1998). Statistical Learning Theory. Whiley, Chichester, GB.
• (ZelenkoAR, 2003) ⇒ D. Zelenko, C. Aone, and A. Richardella. (2003). “Kernel Methods for Relation Extraction.” In: Journal of Machine Learning Research.

---

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2004 DependencyTreeKernelsForRelationExtraction	Aron Culotta Jeffrey S. Sorensen			Dependency Tree Kernels for Relation Extraction		Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics	http://www.cs.umass.edu/~culotta/pubs/culotta04dependency.pdf	10.3115/1218955.1219009		2004