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.