Skip to main content

End-to-End Relation Extraction Using Markov Logic Networks

  • Conference paper
  • First Online:
Computational Linguistics and Intelligent Text Processing (CICLing 2016)

Abstract

The task of end-to-end relation extraction consists of two sub-tasks: (i) identifying entity mentions along with their types and (ii) recognizing semantic relations among the entity mention pairs. It has been shown that for better performance, it is necessary to address these two sub-tasks jointly [13, 22]. We propose an approach for simultaneous extraction of entity mentions and relations in a sentence, by using inference in Markov Logic Networks (MLN) [21]. We learn three different classifiers: (i) local entity classifier, (ii) local relation classifier and (iii) “pipeline” relation classifier which uses predictions of the local entity classifier. Predictions of these classifiers may be inconsistent with each other. We represent these predictions along with some domain knowledge using weighted first-order logic rules in an MLN and perform joint inference over the MLN to obtain a global output with minimum inconsistencies. Experiments on the ACE (Automatic Content Extraction) 2004 dataset demonstrate that our approach of joint extraction using MLNs outperforms the baselines of individual classifiers. Our end-to-end relation extraction performance is better than 2 out of 3 previous results reported on the ACE 2004 dataset.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.ldc.upenn.edu/sites/www.ldc.upenn.edu/files/english-edt-v4.2.6.pdf.

  2. 2.

    https://www.ldc.upenn.edu/sites/www.ldc.upenn.edu/files/english-rdc-v4.3.2.PDF.

  3. 3.

    We consider the “head” extent of a mention defined by ACE standard as the entity mention so that all the valid entity mentions are always non-overlapping.

  4. 4.

    http://alchemy.cs.washington.edu/.

  5. 5.

    All the rules can’t be listed because of the space constraints.

  6. 6.

    We have not yet acquired a more recent ACE 2005 dataset.

References

  1. Bunescu, R.C., Mooney, R.J.: A shortest path dependency kernel for relation extraction. In: Proceedings of Conference on Human Language Technology and Empirical Methods in Natural Language Processing, pp. 724–731. ACL (2005)

    Google Scholar 

  2. Chan, Y.S., Roth, D.: Exploiting syntactico-semantic structures for relation extraction. In: Proceedings of 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, vol. 1, pp. 551–560. ACL (2011)

    Google Scholar 

  3. Doddington, G.R., Mitchell, A., Przybocki, M.A., Ramshaw, L.A., Strassel, S., Weischedel, R.M.: The Automatic Content Extraction (ACE) program-tasks, data, and evaluation. In: LREC, vol. 2, p. 1 (2004)

    Google Scholar 

  4. Florian, R., Jing, H., Kambhatla, N., Zitouni, I.: Factorizing complex models: a case study in mention detection. In: Proceedings of 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pp. 473–480. ACL (2006)

    Google Scholar 

  5. Florian, R., Pitrelli, J.F., Roukos, S., Zitouni, I.: Improving mention detection robustness to noisy input. In: Proceedings of 2010 Conference on Empirical Methods in Natural Language Processing, pp. 335–345. ACL (2010)

    Google Scholar 

  6. GuoDong, Z., Jian, S., Jie, Z., Min, Z.: Exploring various knowledge in relation extraction. In: Proceedings of 43rd Annual Meeting on Association for Computational Linguistics, pp. 427–434. Association for Computational Linguistics (2005)

    Google Scholar 

  7. Hearst, M.A.: Automatic acquisition of hyponyms from large text corpora. In: Proceedings of 14th Conference on Computational Linguistics, vol. 2, pp. 539–545. ACL (1992)

    Google Scholar 

  8. Heckmann, D., Frank, A., Arnold, M., Gietz, P., Roth, C.: Citation segmentation from sparse & noisy data: an unsupervised joint inference approach with Markov logic networks (2013)

    Google Scholar 

  9. Jain, D.: Knowledge engineering with Markov logic networks: a review. Evolv. Knowl. Theory Appl. 16 (2011)

    Google Scholar 

  10. Jiang, J., Zhai, C.: A systematic exploration of the feature space for relation extraction. In: HLT-NAACL, pp. 113–120 (2007)

    Google Scholar 

  11. Kate, R.J., Mooney, R.J.: Joint entity and relation extraction using card-pyramid parsing. In: Proceedings of 14th Conference on Computational Natural Language Learning, pp. 203–212. ACL (2010)

    Google Scholar 

  12. Lafferty, J., McCallum, A., Pereira, F.C.: Conditional random fields: probabilistic models for segmenting and labeling sequence data (2001)

    Google Scholar 

  13. Li, Q., Ji, H.: Incremental joint extraction of entity mentions and relations. In: ACL (2014)

    Google Scholar 

  14. Li, Q., Ji, H., Hong, Y., Li, S.: Constructing information networks using one single model. In: EMNLP (2014)

    Google Scholar 

  15. Lu, W., Roth, D.: Joint mention extraction and classification with mention hypergraphs. In: Proceedings of Conference on Empirical Methods in Natural Language Processing (EMNLP 2015) (2015)

    Google Scholar 

  16. Miwa, M., Bansal, M.: End-to-end relation extraction using LSTMs on sequences and tree structures. arXiv preprint arXiv:1601.00770 (2016)

  17. Miwa, M., Sasaki, Y.: Modeling joint entity and relation extraction with table representation. In: EMNLP, pp. 1858–1869 (2014)

    Google Scholar 

  18. Nadeau, D., Sekine, S.: A survey of named entity recognition and classification. Lingvisticae Investigationes 30(1), 3–26 (2007)

    Article  Google Scholar 

  19. Palshikar, G.K.: Techniques for named entity recognition. In: Bioinformatics: Concepts, Methodologies, Tools, and Applications, p. 400 (2013)

    Google Scholar 

  20. Qian, L., Zhou, G., Kong, F., Zhu, Q., Qian, P.: Exploiting constituent dependencies for tree kernel-based semantic relation extraction. In: Proceedings of 22nd International Conference on Computational Linguistics, vol. 1, pp. 697–704. ACL (2008)

    Google Scholar 

  21. Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62(1–2), 107–136 (2006)

    Article  Google Scholar 

  22. Roth, D., Yih, W.: A linear programming formulation for global inference in natural language tasks. In: CoNLL, pp. 1–8 (2004)

    Google Scholar 

  23. Roth, D., Yih, W.T.: Probabilistic reasoning for entity & relation recognition. In: Proceedings of 19th International Conference on Computational Linguistics, vol. 1, pp. 1–7. ACL (2002)

    Google Scholar 

  24. Roth, D., Yih, W.T.: Global inference for entity and relation identification via a linear programming formulation. In: Introduction to Statistical Relational Learning, pp. 553–580 (2007)

    Google Scholar 

  25. Singh, S., Riedel, S., Martin, B., Zheng, J., McCallum, A.: Joint inference of entities, relations, and coreference. In: Proceedings of 2013 Workshop on Automated Knowledge Base Construction, pp. 1–6. ACM (2013)

    Google Scholar 

  26. Singla, P., Domingos, P.: Lifted first-order belief propagation. In: AAAI, vol. 8, pp. 1094–1099 (2008)

    Google Scholar 

  27. Zhang, C., Hoffmann, R., Weld, D.S.: Ontological smoothing for relation extraction with minimal supervision. In: AAAI (2012)

    Google Scholar 

  28. Zhu, J., Nie, Z., Liu, X., Zhang, B., Wen, J.R.: StatSnowball: a statistical approach to extracting entity relationships. In: Proceedings of 18th International Conference on World Wide Web, pp. 101–110. ACM (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sachin Pawar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pawar, S., Bhattacharya, P., Palshikar, G.K. (2018). End-to-End Relation Extraction Using Markov Logic Networks. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2016. Lecture Notes in Computer Science(), vol 9624. Springer, Cham. https://doi.org/10.1007/978-3-319-75487-1_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75487-1_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75486-4

  • Online ISBN: 978-3-319-75487-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics