Joint Extraction of Entities and Relations for Chinese Text of Tea
Pages 146 - 152
Abstract
In view of the problems of polysemy and overlapping relations of Chinese tea text. In this paper, we present a joint model BERT-LCM-Tea for extraction of entities and relations, which combines the Bidirectional Encoder Representations from Transformers (BERT) and the last character matching (LCM) algorithm. This model uses BERT to fine-tuning character embedding through contextual information, the problem of polysemy is solved and the performance of entity recognition of Chinese tea text is improved. In addition, the model uses last character matching algorithm, the problem of overlapping relations is solved and the accuracy of relation extraction of Chinese tea text is improved. The experimental results show that BERT-LCM-Tea F1 score to 86.8% in entity recognition task and F1 score to 77.1% in relation extraction task, which is higher than the currently popular Bi-RNN-CRF, Bi-LSTM-CRF and Bi-GRU-CRF. Thus, the BERT-LCM-Tea is more suitable for the entity recognition and relation extraction of Chinese tea text, and provides a basis for future research on the construction of tea knowledge graph.
References
[1]
LiuQiao, LiYang, DuanHong, 2016. Knowledge graph construction techniques. J. Journal of computer research and development. 53, 3 (2016), 582–600.
[2]
Haihong E, Zhang Wenjing, Xiao Siqi, 2019. Survey of Entity Relationship Extraction Based on Deep Learning. J. Journal of Software. 30, 6 (2019), 1793–1818.
[3]
Miwa, Makoto, Yutaka Sasaki. 2014. Modeling joint entity and relation extraction with table representation. Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (Doha, Qatar, Oct 25-29, 2014) . Association for Computational Linguistics, 1858-1869.
[4]
Peters M E, Neumann M, Iyyer M, 2018. Deep contextualized word representations. The 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (New Orleans, Louisiana, Jun 1-6, 2018) . Association for Computational Linguistics, 2227-2237.
[5]
Zheng S, Wang F, Bao H, 2017. Joint Extraction of Entities and Relations Based on a Novel Tagging Scheme. Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Vancouver, Canada, Jul 30 - Aug 4, 2017) . Association for Computational Linguistics, 1227-1236.
[6]
Devlin J, Chang M, Lee K, 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics (Minneapolis, Minnesota, Jun 2-7, 2019) . Association for Computational Linguistics, 4171-4186.
[7]
Mao Lang, Zhao Chuangang. 2015. On Clustering-based Forestry Pest and Diseases Entity Extraction. J. Computer Applications and Software. 32, 3 (2015), 37-40.
[8]
Zhai Sheping, Duan Hongyu, Li Zhaozhao. 2019. Knowledge Graph Entity Extraction Based On BiLSTM-CRF. J. Computer Applications and Software. 36, 5 (2019), 269-274.
[9]
Hochreiter S, Schmidhuber J. 1997. Long short-term memory. J. Neural computation. 9, 8 (1997), 1735-1780.
[10]
Lafferty J, Mccallum A, Pereira F, 2001. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data. international conference on machine learning (San Francisco, Jun, 2001) . ACM, 282-289.
[11]
Li X, Wei X H, Jia L, 2017. Recognition of crops, diseases and pesticides named entities in Chinese based in conditional random fields. J. Trans. Chin. Soc. Agric. 48, (2017), 178-185.
[12]
Bryan Rink, Sanda Harabagiu. 2010. Utd: Classifying semantic relations by combining lexical and semantic resources. Proceedings of the 5th International Workshop on Semantic Evaluation (Uppsala, Sweden, Jul 15-16, 2010) . Association for Computational Linguistics, 256-259.
[13]
Zeng D, Liu K, Lai S, 2014. Relation classification via convolutional deep neural network. the 25th International Conference on Computational Linguistics (Dublin, Ireland, Aug 23-29, 2014) . Association for Computational Linguistics, 2335-2344.
[14]
Wu Yuemin, Ding Ganggui, Hu Bin. 2019. Extracting Relationship of Agricultural Financial Texts with Attention Mechanism. J. Data Analysis and Knowledge Discovery. 3, 5 (2019), 86-92.
[15]
Bekoulis, Giannis, 2018. Joint entity recognition and relation extraction as a multi-head selection problem. J. Expert Systems with Applications. 114, (2018), 34–45.
[16]
Shen Liyan, Jiang Haiyan, Hu Bin, 2020. A study on joint entity recognition and relation extraction for rice diseases pests weeds and drugs. J. Journal of Nanjing Agricultural University. http://kns.cnki.net/kcms/detail/32.1148.s.20200515.1647.002.html.
[17]
Vaswani A, Shazeer N, Parmar N, 2017. Attention is All you Need. the 31st International Conference on Neural Information Processing Systems (Long Beach, CA, USA, Dec, 2017) . ACM, 6000-6010.
[18]
Chung J, Gulcehre C, Cho K, 2014. Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint. https://arxiv.org/abs/1412.3555.
[19]
Liu Chunla, Mei Xu, Peilin Liu, 2011. Path Analysis on the Development and Cultivation of the Tea Industry in China. J. Resources Science. 33, 12 (2011), 2376-2385.
Recommendations
An Empirical Study on Joint Entities-relations Extraction of Chinese Text Based on BERT
ICMLC '20: Proceedings of the 2020 12th International Conference on Machine Learning and ComputingJoint Entities-relations extraction (JERE), which can solve the error propagation problem in piped-line extraction, uses a single model to combine the two tasks by different strategies. The neural network-based methods for the joint extraction show ...
Named Entity Recognition and Relation Extraction: State-of-the-Art
With the advent of Web 2.0, there exist many online platforms that result in massive textual-data production. With ever-increasing textual data at hand, it is of immense importance to extract information nuggets from this data. One approach towards ...
Joint extraction of Chinese entitys and relations based on hierarchical labeling
ICAIIS 2021: 2021 2nd International Conference on Artificial Intelligence and Information SystemsEntitys and relations triples are the basic information units that make up the knowledge graph, and represent some simple and specific information. This paper proposes a hierarchical annotation model based on BERT to jointly extract entity relation ...
Comments
Information & Contributors
Information
Published In
December 2020
266 pages
ISBN:9781450388559
DOI:10.1145/3446999
Copyright © 2020 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 09 April 2021
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICIT 2020
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 43Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format