Discovery of dependency tree patterns for relation extraction

PACLIC 23 - Proceedings of the 23rd Pacific Asia Conference on Language, Information and Computation

Volumn 2, Issue , 2009, Pages 851-858

  Xu, Hongzhi ^a   Hu, Changjian ^a   Shen, Guoyang ^a  

^a NEC Laboratories China   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY TREES; HIGH PRECISION; NAMED ENTITIES; RECALL RATE; RELATION EXTRACTION;

FORESTRY;

LEARNING ALGORITHMS;

EID: 84863875513     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (17)

1. Agichtein, E. and L. Gravano. 2000. Snowball: Extracting relations from large plain-text collections. In Proceedings of the fifth ACM conference on Digital libraries, pages 85-94, New York, NY, USA.
2. Brin, S. 1999. Extracting patterns and relations from the world wide web. In The World Wide Web and Databases, Lecture Notes in Computer Science, pages 172-183. Springer Berlin / Heidelberg.
3. Bundschus, M., M. Dejori, M. Stetter, V. Tresp, and H.-P. Kriegel. 2008. Extraction of semantic biomedical relations from text using conditional random fields. BMC Bioinformatics, 9(207).
4. Bunescu, R. and R. Mooney. 2005. A shortest path dependency kernel for relation extraction. In Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing (HLT/EMNLP), pages 724-731, Vancouver, October.
5. Bunescu, R. and R. Mooney. 2006. Subsequence kernels for relation extraction. In Y. Weiss, B. Schölkopf, and J. Platt, editors, Advances in Neural Information Processing Systems 18, pages 171-178. MIT Press, Cambridge, MA.
6. Chi, Y., S. Nijssen, R. R. Muntz, and J. N. Kok. 2005. Frequent subtree mining - an overview. Fundamenta Informaticae Special Issue on Graph and Tree Mining, 66(1/2/2005):161-198.
7. Chi, Y., Y. Xia, Y. Yang, and R. R. Muntz. 2005. Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Transactions on Knowledge and Data Engineering, 17(2):190-202.
8. Cortes, C. and V. Vapnik. 1995. Support vector networks. Machine Learning, 20(3):273-297.
9. Culotta, A., A. McCallum, and J. Betz. 2006. Integrating probabilistic extraction models and data mining to discover relations and patterns in text. In Proceedings of the Human Language Technology Conference of the North American Chapter of the ACL, pages 296-303, June.
10. Culotta, A. and J. Sorensen. 2004. Dependency tree kernels for relation extraction. In 21th International Conference on Computational Linguistics.
11. Dat, N., Y. Matsuo, and M. Ishizuka. 2007. Relation extraction from wikipedia using subtree mining. In Proceedings of 22nd Conference on Artificial Intelligence (AAAI), pages 1414-1420.
12. Kambhatla, N. 2004. Combining lexical, syntactic and semantic features with maximum entropy models for extracting relations. In 21th International Conference on Computational Linguistics.
13. Kilpelainen, P. 1992. Tree Matching Problems with Applications to Structured Text Databases. PhD thesis, Department of Computer Science, University of Helsinki, Helsinki, Finland.
14. Klein, D. and C. D. Manning. 2003. Accurate unlexicalized parsing. In Proceedings of the 41st Meeting of the Association for Computational Linguistics, pages 423-430.
15. Lin, D. and P. Pantel. 2001. Discovery of inference rules for question answering. In Natural Language Engineering, volume 7, pages 343-360. Cambridge University Press.
16. Tatikonda, S., S. Parthasarathy, and T. Kurc. 2006. Trips and tides: New algorithms for tree mining. In Proceedings of the Conference on Information and Knowledge Management(CIKM), volume 5, pages 455-464, Arlington, Virginia, USA.
17. Zelenko, D., C. Aone, and A. Richardella. 2002. Kernel methods for relation extraction. In Proceedings of the Conference on Empirical Methods on Natural Language Processing(EMNLP), pages 71-78, Philadelphia.