A character string fuzzy matching and query method based on an editing distance

TLDR: In this article, a character string fuzzy matching and querying method based on an editing distance was proposed, where the matching degree of the character string is smaller than a preset lower bound value and no repeated element exists in the position list.

Abstract: The invention discloses a character string fuzzy matching and querying method based on an editing distance. The method comprises the following steps: sequentially dividing the query strings accordingto the lengths of the character strings in the paragraphs so as to obtain a query string substring set; when the character strings in the paragraphs are matched with the character strings in the querystring, adding the length of the character string into the matching degree of the original character string of the index corresponding to the character string, adding the character string into a result set when the matching degree of the character string is greater than a preset upper bound value and no repeated element exists in the position list, otherwise, verifying the editing distance of thecharacter string; When the matching degree of the character string is smaller than a preset lower bound value, directly filtering the character string; When the matching degree of the character string is between the preset lower bound value and the preset upper bound value, editing distance verification is carried out on the character string, the difference that paragraphs of different lengths donot affect the matching result can be reflected through the method, and meanwhile the number of editing distance verification operations is small.