Frank Reichartz
ABSTRACT
An important step for understanding the semantic content of text is the extraction of semantic relations between entities in natural language documents. Automatic extraction techniques have to be able to identify different versions of the same relation which usually may be expressed in a great variety of ways. Therefore these techniques benefit from taking into account many syntactic and semantic features, especially parse trees generated by automatic sentence parsers. Typed dependency parse trees are edge and node labeled parse trees whose labels and topology contains valuable semantic clues. This information can be exploited for relation extraction by the use of kernels over structured data for classification. In this paper we present new tree kernels for relation extraction over typed dependency parse trees. On a public benchmark data set we are able to demonstrate a significant improvement in terms of relation extraction quality of our new kernels over other state-of-the-art kernels.
Supplemental Material
- M. Banko, M. Cafarella, S. Soderland, M. Broadhead, and O. Etzioni. Open information extraction from the web. In Proceedings IJCAI '07, pages 2670--2676, 2007. Google Scholar
Digital Library
- M. Banko and O. Etzioni. The tradeoffs between open and traditional relation extraction. In Proceedings of ACL-08: HLT, pages 28--36, 2008.Google Scholar
- S. Blohm and P. Cimiano. Scaling up pattern induction for web relation extraction through frequent itemset mining. In Proceedings KI 2008 WS on Ontology-Based IE Systems, 2008.Google Scholar
- R. R. Bouckaert and E. Frank. Evaluating the replicability of significance tests for comparing learning algorithms. In Proc. PAKDD 2004, Sydney, Australia, pages 3--12, 2004.Google ScholarCross Ref
- M. Bundschus, M. Dejori, M. Stetter, V. Tresp, and H.-P. Kriegel. Extraction of semantic biomedical relations from text using conditional random fields. BMC Bioinformatics, 9, 2008.Google Scholar
- R. C. Bunescu and R. J. Mooney. A shortest path dependency kernel for relation extraction. In Proceedings EMNLP '05, 2005. Google ScholarDigital Library
- A. Culotta and J. Sorensen. Dependency tree kernels for relation extraction. In Proceedings ACL '04, 2004. Google ScholarDigital Library
- M.-C. de Marneffe, B. MacCartney, and C. D. Manning. Generating typed dependency parses from phrase structure parses. In 5th International Conference on Language Resources and Evaluation (LREC 2006), pages 449--454., 2006.Google Scholar
- M. C. de Marneffe and C. D. Manning. The Stanford typed dependencies representation. In Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation, 2008. Google ScholarDigital Library
- S. Harabagiu, C. A. Bejan, and P. Morarescu. Shallow semantics for relation extraction. In Proceedings IJCAI '05, 2005. Google ScholarDigital Library
- D. Haussler. Convolution kernels on discrete structures. Technical report, University of California at Santa Cruz, 1999.Google Scholar
- M. Hearst. Automatic acquisition of hyponyms from large text corpora. In Proceedings COLING-92, 1992. Google ScholarDigital Library
- T. Horvath, G. Paass, F. Reichartz, and S. Wrobel. A logic-based approach to relation extraction from texts. In ILP '09, 2009. Google ScholarDigital Library
- T. Joachims. Text categorization with support vector machines: learning with many relevant features. In Proceedings ECML '98, 1998. Google ScholarDigital Library
- D. Jurafsky and J. H. Martin. Speech and Language Processing. Pearson Education Inc., 2nd edition, 2009. Google ScholarDigital Library
- D. Klein and C. D. Manning. Accurate unlexicalized parsing. In Proceedings ACL '03, 2003. Google ScholarDigital Library
- D. Klein and C. D. Manning. Corpus-based induction of syntactic structure: Models of dependency and constituency. In Proceedings ACL '04, 2004. Google ScholarDigital Library
- H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, and C. Watkins. Text classification using string kernels. JMLR, (2):419--444, 2002. Google ScholarDigital Library
- A. Mitchell. ACE-2 Version 1.0; corpus LDC2003T11. Linguistic Data Consortium, Philadelphia. http://www.ldc.upenn.edu, 2003.Google Scholar
- A. Moschitti. Efficient convolution kernels for dependency and constituent syntactic trees. In Proceedings ECML '06, 2006. Google ScholarDigital Library
- D. Nadeau and S. Sekine. A survey of named entity recognition and classification. Lingvisticae Investigationes, 30, 2007.Google Scholar
- T.-V. T. Nguyen, A. Moschitti, and G. Riccardi. Convolution kernels on constituent, dependency and sequential structures for relation extraction. In Proceedings EMNLP '09, pages 1378--1387, 2009. Google ScholarDigital Library
- G. Paaß and F. Reichartz. Exploiting semantic constraints for estimating supersenses with crfs. In Proceedings SDM '09, 2009.Google Scholar
- F. Reichartz, H. Korte, and G. Paass. Composite kernels for relation extraction. In Proceedings ACL '09, 2009. Google ScholarDigital Library
- F. Reichartz, H. Korte, and G. Paass. Dependency tree kernels for relation extraction from natural language text. In Proceedings ECML PKDD '09, 2009.Google ScholarCross Ref
- J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004. Google ScholarDigital Library
- V. Vapnik. The Nature of Statistical Learning Theory. Springer, New York, 1995. Google ScholarDigital Library
- D. Zelenko, C. Aone, and A. Richardella. Kernel methods for relation extraction. J. Mach. Learn. Res., 3:1083--1106, 2003. Google ScholarDigital Library
- M. Zhang, G. Zhou, and A. Aw. Exploring syntactic structured features over parse trees for relation extraction using kernel methods. Inf. Process. Manage., 44(2):687--701, 2008. Google ScholarDigital Library
Index Terms
- Semantic relation extraction with kernels over typed dependency trees
Recommendations
Exploring syntactic structured features over parse trees for relation extraction using kernel methods
Extracting semantic relationships between entities from text documents is challenging in information extraction and important for deep information processing and management. This paper proposes to use the convolution kernel over parse trees together ...
A Relation-Oriented Method for Joint Entity and Relation Extraction Based on Neural Network
EITCE '21: Proceedings of the 2021 5th International Conference on Electronic Information Technology and Computer EngineeringEntity and relation extraction is a basic task of information extraction in natural language processing. At present, Entity and relation extraction based on artificial intelligence has been widely studied, but most methods adopt the idea of identifying ...
Evolutional Dependency Parse Trees for Biological Relation Extraction
BIBE '11: Proceedings of the 2011 IEEE 11th International Conference on Bioinformatics and BioengineeringDue to the rapid growth in biological technology, the development of high-quality information extraction systems is needed and still remains a challenge. Several recently proposed approaches to biological relation extraction are based on machine ...
Comments