A shortest path dependency kernel for relation extraction

ABSTRACT

We present a novel approach to relation extraction, based on the observation that the information required to assert a relationship between two named entities in the same sentence is typically captured by the shortest path between the two entities in the dependency graph. Experiments on extracting top-level relations from the ACE (Automated Content Extraction) newspaper corpus show that the new shortest path dependency kernel outperforms a recent approach based on dependency tree kernels.

REFERENCES

• 1: Richard Campbell, Using linguistic principles to recover empty categories, Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, p.645-es, July 21-26, 2004, Barcelona, Spain [doi>10.3115/1218955.1219037]
• 2: Michael Collins, Three generative, lexicalised models for statistical parsing, Proceedings of the 35th annual meeting on Association for Computational Linguistics, p.16-23, July 07-12, 1997, Madrid, Spain
• 3: Nello Cristianini , John Shawe-Taylor, An introduction to support Vector Machines: and other kernel-based learning methods, Cambridge University Press, New York, NY, 1999
• 4: Aron Culotta , Jeffrey Sorensen, Dependency tree kernels for relation extraction, Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, p.423-es, July 21-26, 2004, Barcelona, Spain [doi>10.3115/1218955.1219009]
• 5: Ralph Grishman. 1995. Message Understanding Conference 6. http://cs.nyu.edu/cs/faculty/grishman/muc6.html.
• 6: Julia Hockenmaier , Mark Steedman, Generative models for statistical parsing with Combinatory Categorial Grammar, Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, July 07-12, 2002, Philadelphia, Pennsylvania [doi>10.3115/1073083.1073139]
• 7: Roger Levy , Christopher D. Manning, Deep dependencies from context-free statistical parsers: correcting the surface dependency approximation, Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, p.327-es, July 21-26, 2004, Barcelona, Spain [doi>10.3115/1218955.1218997]
• 8: NIST. 2000. ACE - Automatic Content Extraction. http://www.nist.gov/speech/tests/ace.
• 9: Soumya Ray and Mark Craven. 2001. Representing sentence structure in hidden Markov models for information extraction. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-2001), pages 1273--1279, Seattle, WA.
• 10: Bradley L. Richards and Raymond J. Mooney. 1992. Learning relations by pathfinding. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pages 50--55, San Jose, CA, July.
• 11: D. Roth and W. Yih. 2004. A linear programming formulation for global inference in natural language tasks. In Proceedings of the Annual Conference on Computational Natural Language Learning (CoNLL), pages 1--8, Boston, MA.
• 12: Mark Steedman, The syntactic process, MIT Press, Cambridge, MA, 2000
• 13: Vladimir N. Vapnik. 1998. Statistical Learning Theory. John Wiley & Sons.
• 14: Dmitry Zelenko , Chinatsu Aone , Anthony Richardella, Kernel methods for relation extraction, The Journal of Machine Learning Research, 3, 3/1/2003