Method and device for calculating similarity of Chinese character strings on the basis of edit distance

Abstract

An embodiment of the invention provides a method for calculating the similarity of Chinese character strings on the basis of edit distance. The method includes: calculating the similarity of Chinese characters in character strings to be compared; calculating the similarity of the Chinese character strings to be compared. According to the method, the Chinese characters in the character strings are converted into four-corner codes by the four-corner code method; the similarity of the Chinese characters is accordingly calculated on the basis of edit distance; on this basis, the weight of edit distance is replaced with the similarity of the Chinese characters to calculate the similarity of the character strings. The Chinese characters are converted into numeric strings for comparison, thus matching of the Chinese characters is more precise; the weight of the edit distance is replaced with the similarity of the Chinese characters to calculate the similarity of the character strings, thus the edit distance algorithm is applied to matching of the Chinese character strings under the Chinese language environment and matching results are more accurate. In addition, another embodiment of the invention provides a device for calculating the similarity of Chinese character strings on the basis of edit distance.

Description

technical field [0001] The invention relates to the field of similarity of Chinese character strings, in particular to a method and device for calculating the similarity of Chinese character strings based on edit distance. Background technique [0002] The comparison of the similarity of Chinese character strings is a common technique in technical fields such as character string matching, text comparison, and information extraction. In different applications, different technical means of similarity of Chinese strings will be adopted. Common technical means include matching algorithms based on edit distance, matching algorithms based on glyphs and pronunciation, and the smith-Waterman distance algorithm. [0003] In the edit distance algorithm, the steps to find the similarity between two strings are as follows: first, the edit distance matrix should be constructed in advance; second, the value of the matrix unit is calculated from left to right, top to bottom; Third, the c...

AI Technical Summary

Problems solved by technology

Although the algorithm based on Chinese character shape takes into acc

Images