Character string matching method and device

Abstract

The embodiment of the invention provides a character string matching method and device. The method comprises the following steps that: obtaining a character string to be matched and at least one key character string corresponding to the character string to be matched, calculating the matching value of the key character string, wherein the character string to be matched comprises a first characterstring and a second character string; calculating the maximum prefix matching character string length of the first character string and the second character string; according to the maximum prefix matching character string length, utilizing a preset rule to calculate first editing distance between the first character string and the second character string; and according to the first editing distance and the matching value, obtaining a similarity between the first character string and the second character string. The device is used for executing the method. By use of the embodiment of the invention, through the calculation of the matching value of the key character string, the preset rule is used for calculating the first editing distance between the first character string and the second character string, finally, the similarity between the first editing distance and the matching value is obtained, and the accuracy of character string matching is improved.

Description

technical field [0001] The embodiments of the present invention relate to the technical field of text classification processing, and in particular to a string matching method and device. Background technique [0002] The Jaro-Winkler algorithm is used to calculate the similarity between two strings, and is currently the mainstream algorithm for measuring the degree of string matching. [0003] is the calculation method of the Jaro-Winkler algorithm as shown in formula (1): [0004] W ij =D ij +lp(1-D ij ) (1) [0005] Among them: W ij is the string S to be matched i and S j edit distance; l is the string S to be matched i and S j The length of the common prefix field, the upper limit is 4; p is a constant scaling factor, p=0.1, D ij It is jaro distance, a type of data edit distance. [0006] D. ij The calculation method of is shown in formula (2): [0007] [0008] Among them, m ij is the string S to be matched i and S j The number of characters matched in...

AI Technical Summary

Problems solved by technology

It can be seen that only relying on the similarity calculated by the edit distance to measure the string matching situation, the correct rate is higher for strings with a small measurement length, without numbers and unique names, while for strings containing numbers, the length gap between strings is too large, and String error too large with unique name

Images