关键词: 0 1规划模型, 中文碎片拼接, 匹配度, 贪婪算法

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