Heng Li
ABSTRACT
Keyword matching-based text structuring of gas station safety accident cases can automatically perform keyword extraction and store them in the database, and then the structured data can be subjected to multi-dimensional statistics, visual analysis, knowledge graph management and law mining. 516 cases of gas station safety accidents since 1981, which belong to unstructured electronic text data, were collected in four ways. Through the establishment of a keyword dictionary, 516 case texts were extracted and stored in a structured way using a progressive model of exact matching, phrase matching and intelligent matching+manual verification. The actual evaluation results show that the success rate of exact matching is 30% - 87%, the cumulative success rate of phrase matching is 70% - 100%, the cumulative matching rate of intelligent matching+manual verification is 91% - 100%, the overall matching effect is good, and the method is practical and useful.
- Yu Jie, Ji Bin, Liu Lei, Joint extraction method for Chinese medical events [J]. Computer Science, 2021,48 (11): 287-293Google Scholar
- Guo Weijie, Bao Xiao'an. Key Information Extraction Model of Unstructured Text in Knowledge Database [J]. Computer Simulation, 2021,38 (09): 357-360+394Google Scholar
- Wang Xiaoya.Text analysis of lung diseases based on BERT semantic embedding and its application [D]. Chengdu: University of Electronic Science and Technology of China, 2021. DOI: 10.27005/d.cnki.gdzku.2021.002173Google ScholarCross Ref
- Cao Wenkang.Research and Implementation of Fact based Case Big Data Query Technology [D]. Nanjing: Nanjing Normal University, 2021. DOI: 10.27,245/d.cnki.gnjsu.2021.001,053Google Scholar
- Zhu Chaoqun. Research on Chinese text summarization method based on improved TextRank [D]. Wuhan: Wuhan Research Institute of Posts and Telecommunications, 2021. DOI: 10.27386/d.cnki.gwyky.2021.000044Google ScholarCross Ref
- Li Bohan, Li Honglian. Research on Text Abstract Based on Multi task Learning [J]. Computer Knowledge and Technology, 2020,16 (31): 20-25+48. DOI: 10.14,004/j.cnki.ckt.2020.3561Google Scholar
- Li Yuman.Research on key information extraction for forestry texts [D]. Beijing: Beijing Forestry University, 2020. DOI: 10.26949/d.cnki.gblyu.2020.001040Google ScholarCross Ref
- Yu Simiao.A Study on the Classification of Collection Document Titles for Subject Word Matching [D]. Shenyang: Liaoning University of Engineering and Technology, 2020. DOI: 10.27210/d.cnki.glnju.2020.000256Google ScholarCross Ref
- Fan Xi.Research on Web System for Extracting Key Information from Patent Web Pages [D]. Beijing: Beijing University of Posts and Telecommunications, 2020. DOI: 10.26969/d.cnki.gbydu.2020.002054Google ScholarCross Ref
- Chen Zhibo, Li Yuman, Xu Fu, Feng Guoming, Shi Dongyu, Cui Xiaohui. Research on forestry text key information extraction based on TextRank and cluster filtering [J]. Journal of Agricultural Machinery, 2020,51 (05): 207-214+172Google Scholar
- Huang Pu.Research on key technologies of text information extraction optimization and system implementation [D]. Beijing: Beijing University of Posts and Telecommunications, 2019Google Scholar
- Li Chenliang.Text summarization model based on neural network joint learning [D]. Beijing: Beijing University of Posts and Telecommunications, 2019Google Scholar
- Liu Wen, Wang Jin, Li Rui, Design and implementation of key information extraction system for court judgment [J]. Journal of Hubei University of Technology, 2018, 33 (01): 63-67Google Scholar
Index Terms
- Extraction of key information from Chinese text of gas station safety accident cases
Recommendations
Almost Exact Matchings
In the exact matching problem we are given a graph G, some of whose edges are colored red, and a positive integer k. The goal is to determine if G has a perfect matching, exactly k edges of which are red. More generally if the matching number of G is m=...
Point-cloud refinement via exact matching
ICME'09: Proceedings of the 2009 IEEE international conference on Multimedia and ExpoIn many multi-view stereo (MVS) algorithms, a point-cloud evolution is performed, based on the matching process. For most of them, an assumption is usually employed for the matching, which indicates that the matching windows have the same shape. This ...
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approaches. Hence our pattern consists of a sequence of words. From the ...
Comments