基于0-1规划模型的规则中文碎片拼接复原研究

Abstract

Abstract:

By analyzing the fragments on the regular Chinese text distribution,extracting fragments boundary information,defining compatibility of adjacent fragments based on Euclidean distance,and considering the maximum compatibility of all the fragments,the fragment recuperative model is established based on 0-1 programming,and a greedy algorithm is used to simulate a fragmented files.The research results show that the regular Chinese fragments recovered problem can be accurately described with math based on 0-1 programming model,and greedy algorithm combined with appropriate artificial intervention can better solve this problem.

Key words: 0 1 programming model;chinese fragments reassembly;matching degree;greedy algorithm

CLC Number:

TP391.1

SHEN Hongping,ZHANG Yipeng,WANG Yikang. Research on Regular Chinese Fragments Reassembly Based on 0-1 Programming Model[J]., 2014, 27(6): 13-.

[1]	Toleu Galymzhan, WU Chunxue. Deep Learning for Sentence and Token Boundaries Detection [J]. , 2017, 30(9): 20-.
[2]	YANG Xia. Emotion Classification of the Micro Blog Comments Based on Tongyici [J]. , 2014, 27(7): 134-.
[3]	SUN Shi-Yao. Information Extraction Technology in the Application of Military Plotting System [J]. , 2013, 26(12): 148-.
[4]	SHAO Ze-Guo. Design of a Language Classification System [J]. , 2012, 25(12): 130-.

Research on Regular Chinese Fragments Reassembly Based on 0-1 Programming Model

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 4

Metrics

Comments

Recommended 0