一种改进的编辑距离算法及其在数据处理中的应用

基于数据处理的需要，在分析原有编辑距离算法的基础上，通过拓展交换操作减少编辑操作的数量。与仅对计算点之前相邻位置字符间的交换操作相比，通过对计算点前后非相邻位置字符间的交换操作改进该算法，能够得到更理想化的编辑距离。将改进的编辑距离算法应用于煤矿隐患数据的处理，提高了隐患数据分类分级的有效性和执行效率。

An improved algorithm of Levenshtein Distance and its application in data processing

Based on the requirement of data processing, after analyzing the existing algorithm of Levenshtein Distance, the number of edit operation was decreased by extending the transposition operation. Compared to the existing the algorithm that can only transpose adjacent symbols before the position of being computed, improving the algorithm by transposing isolated symbols before the position of being computed as well as at after the position of being computed, can gain better edit distance. By applying the improved algorithm to the processing of the hidden trouble data of coal mine, both the validity and efficiency of classifying and grading the hidden trouble data were improved.