Character string matching search method and device and terminal
A string matching and character matching technology, which is applied in electrical digital data processing, digital data information retrieval, instruments, etc., can solve the problems of low efficiency, improve matching efficiency, reduce the number of comparisons, and increase the distance of moving to the right Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0043] In order to better understand the principle of the traditional Horspool algorithm, an example is used to illustrate the process of the Horspool algorithm. It should be noted here that the example is only to illustrate the principle of the algorithm, so the length of the main string of text characters and the substring of text characters in this example is relatively small, and the format is relatively simple. Assume that the main string of text characters is M=DBHALLEBHEDLLOHELLE with a length of 19, and the substring of text characters is S=OHELLE with a length of 6. like figure 1 As shown, the traditional Horspool algorithm instance string matching process steps are as follows:
[0044] (1) The first match
[0045] Compare the last character E of the character substring S with the last character L of the corresponding position of the main character string M, E is not equal to L, that is, the match fails at the last character, and the character of the failed match is...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


