Skip to main content

Simultaneously Learning Syntactic Dependency and Semantics Reasonability for Relation Extraction

  • Conference paper
  • First Online:
The International Conference on Image, Vision and Intelligent Systems (ICIVIS 2021)

Abstract

Relation extraction as an important Natural Language Processing (NLP) task is to identify relations between named entities in text. Recently, graph convolutional networks over dependency trees have been widely used to capture syntactic features and achieved attractive performance. However, most existing dependency-based approaches ignore the positive influence of the words outside the dependency trees, sometimes conveying rich and useful information on relation extraction. In this paper, we propose a novel model, Entity-aware Self-attention Contextualized GCN (ESC-GCN), which efficiently incorporates syntactic structure of input sentences and semantic context of sequences. To be specific, relative position self-attention obtains the overall semantic pairwise correlation related to word position, and contextualized graph convolutional networks capture rich intra-sentence dependencies between words by adequately pruning operations. In this way, our proposed model not only reduces the noisy impact from dependency trees but also obtains easily-ignored entity-related semantic representation. Extensive experiments demonstrate that our model achieves encouraging performance.

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 389.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 499.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 499.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Zeng, D., Liu, K., Lai, S., Zhou, G., Zhao, J.: Relation classification via convolutional deep neural network. In: International Conference on Computational Linguistics, pp. 2335–2344 (2014)

    Google Scholar 

  2. Zhang, D., Wang, D.: Relation classification via recurrent neural network. arXiv:1508.01006 (2015)

  3. Xu, Y., Mou, L., Li, G., Chen, Y., Peng, H., Jin, Z.: Classifying relations via long short term memory networks along shortest dependency paths. In: The Conference on Empirical Methods in Natural Language Processing. pp. 1785–1794 (2015)

    Google Scholar 

  4. Miwa, M., Bansal, M.: End-to-end relation extraction using lstms on sequences and tree structures. In: Annual Meeting of the Association for Computational Linguistics, pp. 1105–1116 (2016)

    Google Scholar 

  5. Zhang, Y., Zhong, V., Chen, D., Angeli, G., Manning, C.D.: Position-aware attention and supervised data improve slot filling. In: The Conference on Empirical Methods in Natural Language Processing, pp. 35–45 (2017)

    Google Scholar 

  6. Zhang, S., Zheng, D., Hu, X., Yang, M.: Bidirectional long short-term memory networks for relation classification. In: Pacific Asia Conference on Language, Information and Computation, pp. 73–78 (2015)

    Google Scholar 

  7. Liu, Y., Wei, F., Li, S., Ji, H., Zhou, M., Wang, H.: A dependency-based neural network for relation classification. In: Annual Meeting of the Association for Computational Linguistics, pp. 285–290 (2015)

    Google Scholar 

  8. Xu, Y., Jia, R., Mou, L., Li, G., Chen, Y., Lu, Y., Jin, Z.: Improved relation classification by deep recurrent neural networks with data augmentation. In: International Conference on Computational Linguistics (2016)

    Google Scholar 

  9. Peng, N., Poon, H., Quirk, C., Toutanova, K., Yih, W.t.: Cross-sentence n-ary relation extraction with graph lstms. In: Trans. Assoc. Comput. Linguist. 5, 101–115 (2017)

    Google Scholar 

  10. Song, L., Zhang, Y., Wang, Z., Gildea, D.: N-ary relation extraction using graph state lstm. In: The Conference on Empirical Methods in Natural Language Processing, pp. 2226–2235 (2018)

    Google Scholar 

  11. Zhang, Y., Qi, P., Manning, C.D.: Graph convolution over pruned dependency trees improves relation extraction. In: The Conference on Empirical Methods in Natural Language Processing, pp. 2205–2215 (2018)

    Google Scholar 

  12. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 5998–6008 (2017)

    Google Scholar 

  13. Verga, P., Strubell, E., McCallum, A.: Simultaneously self-attending to all mentions for full-abstract biological relation extraction. In: The Conference of the North American Chapter of the Association for Computational Linguistics, pp. 872–884 (2018)

    Google Scholar 

  14. Bilan, I., Roth, B.: Position-aware self-attention with relative positional encodings for slot filling. arXiv:1807.03052 (2018)

  15. Yu, B., Zhang, Z., Liu, T., Wang, B., Li, S., Li, Q.: Beyond word attention: using segment attention in neural relation extraction. In: International Joint Conference on Artificial Intelligence, pp. 5401–5407 (2019)

    Google Scholar 

  16. Shaw, P., Uszkoreit, J., Vaswani, A.: Self-attention with relative position representations. In: The Conference of the North American Chapter of the Association for Computational Linguistics, pp. 464–468 (2018)

    Google Scholar 

  17. Hendrickx, I., Kim, S.N., Kozareva, Z., Nakov, P., S´eaghdha, D.O., S.: Semeval-2010 task 8: multi-way classification of semantic relations between pairs of nominals. In: The International Workshop on Semantic Evaluation, pp. 33–38 (2019)

    Google Scholar 

  18. Nguyen, T.H., Grishman, R.: Relation extraction: perspective from convolutional neural networks. In: The Workshop on Vector Space Modeling for Natural Language Processing, pp. 39–48 (2015)

    Google Scholar 

  19. Tai, K.S., Socher, R., Manning, C.D.: Improved semantic representations from tree-structured long short-term memory networks. In: Annual Meeting of the Association for Computational Linguistics, pp. 1556–1566 (2015)

    Google Scholar 

  20. Wu, F., Zhang, T., Souza Jr, A.H.d., Fifty, C., Yu, T., Weinberger, K.Q.: Simplifying graph convolutional networks. In: International Conference on Machine Learning (2019)

    Google Scholar 

  21. Santos, C.N.d., Xiang, B., Zhou, B.: Classifying relations by ranking with convolutional neural networks. In: Annual Meeting of the Association for Computational Linguistics, pp. 626–634 (2015)

    Google Scholar 

  22. Zhou, P., Shi, W., Tian, J., Qi, Z., Li, B., Hao, H., Xu, B.: Attention-based bidirectional long short-term memory networks for relation classification. In: Annual Meeting of the Association for Computational Linguistics, pp. 207–212 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xin Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, X., Yin, N., Zhang, X., Bai, X., Luo, Z. (2022). Simultaneously Learning Syntactic Dependency and Semantics Reasonability for Relation Extraction. In: Yao, J., Xiao, Y., You, P., Sun, G. (eds) The International Conference on Image, Vision and Intelligent Systems (ICIVIS 2021). Lecture Notes in Electrical Engineering, vol 813. Springer, Singapore. https://doi.org/10.1007/978-981-16-6963-7_85

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-6963-7_85

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-6962-0

  • Online ISBN: 978-981-16-6963-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics