A Chinese String Matching Algorithm Based on Edit Distance
Approximate string matching is an important research direction in the field of pattern matching.In Chinese string approximate matching,the edit distance based on character operation cannot accurately measure the similarity relationship caused by string copy and cut operations.This paper introduces the shift and copy operations of strings on the basis of the traditional edit distance,and presents a calculation method for dynamic programming search based on the greedy algorithm,which can effectively calculate the improved edit distance.Experimental re-sults and analysis show the effectiveness for text retrieval.
NETL
NSTL
万方数据
