CN103577598A - Matching method and device for pattern string and text string - Google Patents
Matching method and device for pattern string and text string Download PDFInfo
- Publication number
- CN103577598A CN103577598A CN201310576313.7A CN201310576313A CN103577598A CN 103577598 A CN103577598 A CN 103577598A CN 201310576313 A CN201310576313 A CN 201310576313A CN 103577598 A CN103577598 A CN 103577598A
- Authority
- CN
- China
- Prior art keywords
- string
- text string
- pattern
- displacement value
- array
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Machine Translation (AREA)
Abstract
The invention discloses a matching method and device for a pattern string and a text string. The matching method comprises the steps of matching the pattern string and the text string, and under the circumstance of the mismatch of the pattern string and the text string, determining the skip mode of the text string according to the maximum positive displacement value obtained based on multiple preprocessing arrays constructed by the pattern string in advance. According to the matching method and device for the pattern string and the text string, after the mismatch of the pattern string and the characters in the text string, the skip mode of the text string is determined by using the multiple preprocessing arrays constructed in advance, the effect that the pattern string skips with the maximum positive displacement value can be ensured under the circumstance that the effect that the pattern string does not backtrack after the mismatch of the pattern string and the characters in the text string is ensured, and thus the pattern matching speed and the safety of network management are improved.
Description
Technical field
The present invention relates to computer realm, and especially, relate to matching process and the device of a kind of pattern string and text string.
Background technology
Pattern matching algorithm is as the core algorithm of network security, its task is in a text string (also can be described as target strings), to find designated character string (being pattern string), and return to this pattern string and in text string, occur position, the efficiency of pattern matching algorithm directly has influence on the efficiency of management of network security.Initial violence search is undertaken by exhaustive, and its shortcoming is that matching speed is slow, takes length.The classical Single Pattern Matching Algorithms then occurring comprises Ke Nusi-Mo Lisi-Alexandre Desplat String Searching Algorithm (Knuth-Morris-Pratt, hereafter is KMP) algorithm, slope skill that-mole string search algorithm (Boyer-Moore, hereafter is BM) algorithm, and the optimized algorithm Boyer-Moore-Horspool(BMH of BM), Boyer-Moore-Horspool-Sunday(BMHS), Boyer-Moore-Horspool-two-Chinese (hereafter is BMH2C) etc., these classic algorithm are mainly to utilize the redirect after character mismatch to promote matching speed.
Wherein, the complexity of KMP algorithm is O(n), can guarantee that after character mismatch, pattern string is not recalled, utilize KMP algorithm (being the place, end that pattern string is positioned at text string) under worst case, there is higher performance.Although the jump distance of KMP algorithm (also can be described as shift value) is permanent in just, because jump distance is less, average belavior of algorithm is low compared with BM algorithm.BM algorithm has larger jump distance, there is good average behavior, but because BM algorithm can draw negative shift value in some cases, can not guarantee not recall after the character mismatch in text string, the worst and worse in the situation that (, pattern string is positioned at the place, Huo Zhuankao end, end of text string), BM algorithm has poor performance, its complexity is O(mn).
For Single Pattern Matching Algorithms in correlation technique, after mismatch, text string redirect is less or recall the problem that causes matching efficiency low, not yet proposes at present effective solution.
Summary of the invention
For Single Pattern Matching Algorithms in correlation technique after mismatch, text string redirect is less or recall the problem that causes matching efficiency low, the present invention proposes the matching process of a kind of pattern string and text string, can in the situation that after the character mismatch in Assured Mode string and text string text string do not recall, guarantee that text string carries out redirect with maximum positive displacement value, promoted the security of pattern matching speed and network management.
Technical scheme of the present invention is achieved in that
The matching process of a kind of pattern string and text string is provided according to an aspect of the present invention.
This matching process comprises: pattern string is mated with text string;
The in the situation that of pattern string and text string mismatch, the maximum positive displacement value obtaining according to a plurality of pre-service arrays that build based on pattern string is in advance determined the redirect mode of text string.
Preferably, a plurality of pre-service arrays comprise Skip array and/or Next array.
And, preferentially according to Skip array, obtain the redirect mode that shift value is determined text string.
Alternatively, the maximum positive displacement value obtaining according to a plurality of pre-service arrays that build based on pattern string in advance determines that the redirect mode of text string comprises:
In the situation that Skip array obtains positive displacement value, according to this positive displacement value, determine the redirect mode of text string;
In the situation that Skip array obtains negative displacement value, according to Next array, obtain positive displacement value, according to this positive displacement value, determine the redirect mode of text string.
Further, before pattern string is mated with text string, pattern string and text string are carried out to left-justify.
Wherein, pattern string is mated and comprised with text string: in the situation that the match is successful, the position of the character identical with pattern string in returned text string.
The coalignment of a kind of pattern string and text string is provided according to another aspect of the present invention.
This coalignment comprises:
Matching module, for mating pattern string with text string;
Determination module, for pattern string and the text string mismatch in the situation that, the maximum positive displacement value obtaining according to a plurality of pre-service arrays that build based on pattern string is in advance determined the redirect mode of text string.
Preferably, a plurality of pre-service arrays comprise Skip array and/or Next array.
And above-mentioned determination module is also for preferentially obtaining according to Skip array the redirect mode that shift value is determined text string.
Alternatively, above-mentioned determination module also for:
In the situation that Skip array obtains positive displacement value, according to this positive displacement value, determine the redirect mode of text string;
In the situation that Skip array obtains negative displacement value, according to Next array, obtain positive displacement value, according to this positive displacement value, determine the redirect mode of text string.
The present invention is by after the character mismatch in pattern string and text string, utilize a plurality of pre-service arrays that build in advance to determine the redirect mode of text string, can in the situation that after the character mismatch in Assured Mode string and text string text string do not recall, guarantee that text string carries out redirect with maximum positive displacement value, promoted the security of pattern matching speed and network management.
Accompanying drawing explanation
Fig. 1 is according to the process flow diagram of the matching process of the pattern string of the embodiment of the present invention and text string;
Fig. 2 is the process flow diagram of BMH2C algorithm in prior art;
Fig. 3 is the process flow diagram of matching algorithm according to an embodiment of the invention;
Fig. 4 is according to the block diagram of the coalignment of the pattern string of the embodiment of the present invention and text string.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, rather than whole embodiment.Embodiment based in the present invention, the every other embodiment that those of ordinary skills obtain, belongs to the scope of protection of the invention.
According to embodiments of the invention, provide the matching management method of a kind of pattern string and text string.
As shown in Figure 1, according to the matching process of the pattern string of the embodiment of the present invention and text string, comprise:
Step S101, mates pattern string with text string, further, before pattern string is mated with text string, pattern string and text string are carried out to left-justify, in the situation that the match is successful, and the position of the character identical with pattern string in returned text string;
Step S103, the in the situation that of pattern string and text string mismatch, the maximum positive displacement value obtaining according to a plurality of pre-service arrays that build based on pattern string is in advance determined the redirect mode of text string, avoid in prior art in text string mismatch situation, only by single pre-service array, obtain shift value, causing shift value is negative or less defect, thereby can in the situation that after the character mismatch in Assured Mode string and text string text string do not recall, guarantee that text string carries out redirect with maximum positive displacement value, promoted the security of pattern matching speed and network management.
Preferentially, a plurality of pre-service arrays comprise Skip array and/or Next array, and wherein, Skip array can be the pre-service array in KMP algorithm, and Next array can be the pre-service array in BMH2C algorithm.Below simply introduce KMP algorithm, BMH2C algorithm and these two kinds of algorithms are compared, wherein, the text of text string S for being searched, pattern string P is the character string that need to search in text, i text string vernier pointer (also referred to as subscript), j is pattern string vernier pointer, and n is text string length, and m is pattern string length.
KMP algorithm: in KMP algorithm, in order to ensure after character mismatch, when coupling next time j position, introduced pre-service array next[] array, next[j] value representation P[0～j-1] in the longest " suffix equals prefix " sew length.
For next[] array is defined as follows:
(formula 1) next[0]=-1, wherein, j=0, that is, the pretreatment values of the first character of any character string is defined as-1;
(formula 2) next[j]=k
max, 0<k<j wherein; P[0,1,2 ... k-1]=P[j-k, j-k+1, j-k+2 ... j-1];
(formula 3) next[j]=0, other situations.
For example, take shown in table 1 is example concrete analysis next[j] situation of array:
Table 1
| P | a | b | a | b | a |
| j | 0 | 1 | 2 | 3 | 4 |
| next[j] | -1 | 0 | 0 | 1 | 2 |
When j=0, applicable (formula 1), that is, and j=0, next[j]=-1;
At j=1,, be suitable for (formula 3), next[j at 2 o'clock]=0;
When j=3, applicable (formula 2), before j=3, only j=2 is identical with j=0, only has one and is worth next[3]=1;
When j=4, applicable (formula 2), before j=4, j=2 is identical with j=0, and j=3 is identical with j=1, has two values, next[4]=2.
When j=3 and j=4, next[j] during=k>0, represent P[0...k-1]=P[j-k, j-1].
The thought of KMP algorithm: in matching process, if there is unmatched situation, if next[j] >=0, the pointer i of text string is constant, and the pointer j of pattern string is moved to next[j] position proceed coupling; If next[j]=-1, i is moved to right 1, and j is set to 0, proceed comparison, complexity is O (n).
BMH2C algorithm: in BMH2C algorithm, using the character late of the text character corresponding with last character of pattern string and text character as a substring (, in this substring, there are two characters), when this substring occurs in pattern string, pattern string moves right, and this substring was alignd with its rightmost appearance in pattern string; Otherwise, when pattern string moves to right, directly skip this substring, the amount of moving to right is m+1.
Use two characters to decide the amount of moving to right, can represent side-play amount array skip[char1 with two-dimensional array] [char2], as shown in Figure 2, be the block diagram of BMH2C algorithm:
Step S201, when array initialization, is all set to m+1, i.e. Skip[i by the value of two-dimensional array] [j]=m+1;
Step S203, when initialization, can also further to the value of skip array, revise, by skip[i] [p[0]] be set to m, be Skip[i] [p[0]]=m, because also consider a kind of special circumstances, as substring S[i] S[i+1] a rear character S[i+1] with the first character P[0 of pattern] when identical, although substring S[i] S[i+1] in pattern, do not occur, if but the m+1 that moves to right probably misses a kind of match condition, therefore only the m that should move to right, makes the first character P[0 of pattern] with the rear character S[i+1 of substring] align;
Step S205, initialized the 3rd step is that all substrings for occurring in pattern arrange the amount of moving to right accordingly, Skip[p[k]] [p[k+1]]=m-k-1.
The in the situation that of mismatch, preferentially according to Skip array, obtain the redirect mode that shift value is determined text string.In the situation that Skip array obtains positive displacement value, according to this positive displacement value, determine the redirect mode of text string; In the situation that Skip array obtains negative displacement value, according to Next array, obtain positive displacement value, according to this positive displacement value, determine the redirect mode of text string.
That is, the shift value of Skip array is in KMP algorithm, to reduce the live part of pattern complexity, and the shift value of Next array is the live part of redirect significantly in BMH2C algorithm.The combination of getting KMP algorithm and the two live part of BMH2C algorithm, retains the two advantage, obtains desired speed under general the situation lower algorithm of complexity, the just place of core of the present invention in pattern match and poor situation faster.
According to one embodiment of present invention, provide a kind of matching algorithm, as shown in Figure 3, for according to the process flow diagram of the matching algorithm of the embodiment of the present invention.
Step S301, starts, and task initialization builds Skip array and Next array according to pattern string;
Step S303, carries out left-justify by text string S and pattern string P;
Step S305, definition i is the vernier of text string S, and definition j is the vernier of pattern string P, and step S303 can be expressed as the zero-bit of the i of text string S is alignd with the j zero-bit of pattern string P;
Step S307, judges whether the vernier i of text string S is less than the length that slen(is pattern string S), when i is less than slen, circulate, execution step S309, when i is greater than slen, carries out S321;
Step S309, judges that whether the character of current vernier i indication of text string S is identical with the character of the current vernier j indication of pattern string P, if S[i]=P[j], equal continuation is mated, and execution step S311, if different, mean and occur mismatch, execution step S313;
Step S311, the vernier of pattern string and the text string character bit that advances respectively, prepares coupling next time;
Step S313, after mismatch, calculates the shift value in skip after mismatch, inquire about skip array, then returns to the shift value of skip array;
Step S315, the positive negativity of the displacement numerical value that judgement skip array is returned, if displacement is for just, performs step S319, when displacement is for negative, performs step S317;
Step S317, the displacement numerical value that skip array is returned forces i not recall for negative, then inquires about next array, and the vernier i of text string remains unchanged, and the vernier j of pattern string is set to the displacement numerical value that next array is returned, that is, and j=next[j];
Step S319, the displacement numerical value that skip array is returned is that canonical is used redirect, the vernier i step-by-step shift value of the text string corresponding character bit that advances, vernier j zero clearing, pattern string resets to pattern initial character;
Step S321, judges the value of j and the length of plen(pattern string P) whether equate, judge whether to have mated, that is, whether judgment model string is all covered, if success performs step S323;
Step S323, pattern matching success, the position of return string;
Step S325, failure, does not have that the match is successful, returns to invalid value
Step S327, task termination.
According to the matching algorithm of the embodiment of the present invention in conjunction with KMP and BMH2C algorithm advantage separately, initialization builds skip and next array, in matching process, first text string S and pattern string P is carried out to left-justify, then mate successively character, the position of mating in returned text string in the situation that of coupling.After mismatch, search skip array, obtain displacement.Now judge the positive and negative of shift value, if displacement for just, text string carries out redirect by this positive displacement value.If shift value, for negative, is inquired about next array, obtain new displacement.Until the match is successful or arrive text string end.Because the displacement of next array is permanent, for just, can guarantee that the j value of this algorithm is never recalled, as far as possible with maximum displacement redirect, and complexity is O(n).
According to embodiments of the invention, also provide the coalignment of a kind of pattern string and text string.
As shown in Figure 4, according to the coalignment of the pattern string of the embodiment of the present invention and text string, comprise:
According to the coalignment of the pattern string of the embodiment of the present invention and text string, further comprise:
Initialization module (not shown), for before pattern string is mated with text string, carries out left-justify by pattern string and text string;
Module (not shown) is returned in position, in the situation that the match is successful, and the position of the character identical with pattern string in returned text string
A plurality of pre-service arrays comprise Skip array and/or Next array, determination module 32 preferentially obtains according to Skip array the redirect mode that shift value is determined text string, wherein, Skip array can be the pre-service array in KMP algorithm, and Next array can be the pre-service array in BMH2C algorithm.。
In the situation that Skip array obtains positive displacement value, determination module 32 is determined the redirect mode of text string according to this positive displacement value; In the situation that Skip array obtains negative displacement value, determination module 32 obtains positive displacement value according to Next array, determines the redirect mode of text string according to this positive displacement value.
In sum, by means of technique scheme of the present invention, after the character mismatch in pattern string and text string, utilize a plurality of pre-service arrays that build in advance to determine the redirect mode of text string, further, use the Skip of BMH2C and the Next array of KMP, can in the situation that after the character mismatch in Assured Mode string and text string text string do not recall, guarantee that text string carries out redirect with maximum positive displacement value, can take into account the advantage of KMP and BMH2C algorithm, Lifting scheme matching speed and network security efficiency.
The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.
Claims (10)
1. a matching process for pattern string and text string, is characterized in that, comprising:
Described pattern string is mated with described text string;
The in the situation that of described pattern string and described text string mismatch, the maximum positive displacement value obtaining according to a plurality of pre-service arrays that build based on described pattern string is in advance determined the redirect mode of described text string.
2. matching process according to claim 1, is characterized in that, a plurality of pre-service arrays comprise Skip array and/or Next array.
3. matching process according to claim 2, is characterized in that, preferentially according to Skip array, obtains the redirect mode that shift value is determined described text string.
4. matching process according to claim 3, is characterized in that, the maximum positive displacement value obtaining according to a plurality of pre-service arrays that build based on described pattern string in advance determines that the redirect mode of described text string comprises:
In the situation that described Skip array obtains positive displacement value, according to this positive displacement value, determine the redirect mode of described text string;
In the situation that described Skip array obtains negative displacement value, according to described Next array, obtain positive displacement value, according to this positive displacement value, determine the redirect mode of described text string.
5. matching process according to claim 1, is characterized in that, before described pattern string is mated with described text string, further comprises:
Described pattern string and described text string are carried out to left-justify.
6. matching process according to claim 1, is characterized in that, described pattern string is mated and comprised with described text string:
In the situation that the match is successful, return to the position of character identical with described pattern string in described text string.
7. a coalignment for pattern string and text string, is characterized in that, comprising:
Matching module, for mating described pattern string with described text string;
Determination module, for described pattern string and the described text string mismatch in the situation that, the maximum positive displacement value obtaining according to a plurality of pre-service arrays that build based on described pattern string is in advance determined the redirect mode of described text string.
8. matching process according to claim 7, is characterized in that, a plurality of pre-service arrays comprise Skip array and/or Next array.
9. coalignment according to claim 8, is characterized in that, described determination module is also for preferentially obtaining according to Skip array the redirect mode that shift value is determined described text string.
10. coalignment according to claim 9, is characterized in that, described determination module is further used for:
In the situation that described Skip array obtains positive displacement value, according to this positive displacement value, determine the redirect mode of described text string;
In the situation that described Skip array obtains negative displacement value, according to described Next array, obtain positive displacement value, according to this positive displacement value, determine the redirect mode of described text string.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310576313.7A CN103577598B (en) | 2013-11-15 | 2013-11-15 | Matching method and device for pattern string and text string |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310576313.7A CN103577598B (en) | 2013-11-15 | 2013-11-15 | Matching method and device for pattern string and text string |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103577598A true CN103577598A (en) | 2014-02-12 |
| CN103577598B CN103577598B (en) | 2017-02-15 |
Family
ID=50049374
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310576313.7A Active CN103577598B (en) | 2013-11-15 | 2013-11-15 | Matching method and device for pattern string and text string |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103577598B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104519056A (en) * | 2014-12-15 | 2015-04-15 | 广东科学技术职业学院 | Double-jump-based single mode matching method |
| CN107341224A (en) * | 2017-06-30 | 2017-11-10 | 北方工业大学 | The matching process and device of a kind of character string |
| CN112069303A (en) * | 2020-09-17 | 2020-12-11 | 四川长虹电器股份有限公司 | Matching search method and device for character strings and terminal |
| WO2021047003A1 (en) * | 2019-09-09 | 2021-03-18 | 深圳前海微众银行股份有限公司 | Text positioning method, apparatus, device, and storage medium |
| CN113590895A (en) * | 2021-07-28 | 2021-11-02 | 西华大学 | Character string retrieval method |
| CN113836367A (en) * | 2021-09-26 | 2021-12-24 | 杭州迪普科技股份有限公司 | Character reverse matching method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080071781A1 (en) * | 2006-09-19 | 2008-03-20 | Netlogic Microsystems, Inc. | Inexact pattern searching using bitmap contained in a bitcheck command |
| CN101409623A (en) * | 2008-11-26 | 2009-04-15 | 湖南大学 | Mode matching method facing to high speed network |
| CN102750379A (en) * | 2012-06-25 | 2012-10-24 | 华南理工大学 | Fast character string matching method based on filtering type |
-
2013
- 2013-11-15 CN CN201310576313.7A patent/CN103577598B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080071781A1 (en) * | 2006-09-19 | 2008-03-20 | Netlogic Microsystems, Inc. | Inexact pattern searching using bitmap contained in a bitcheck command |
| CN101409623A (en) * | 2008-11-26 | 2009-04-15 | 湖南大学 | Mode matching method facing to high speed network |
| CN102750379A (en) * | 2012-06-25 | 2012-10-24 | 华南理工大学 | Fast character string matching method based on filtering type |
Non-Patent Citations (1)
| Title |
|---|
| 杨子江等: ""一种快速的单模式匹配算法"", 《华南师范大学学报( 自然科学版)》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104519056A (en) * | 2014-12-15 | 2015-04-15 | 广东科学技术职业学院 | Double-jump-based single mode matching method |
| CN104519056B (en) * | 2014-12-15 | 2017-09-08 | 广东科学技术职业学院 | A kind of single pattern matching method jumped based on double jump |
| CN107341224A (en) * | 2017-06-30 | 2017-11-10 | 北方工业大学 | The matching process and device of a kind of character string |
| WO2021047003A1 (en) * | 2019-09-09 | 2021-03-18 | 深圳前海微众银行股份有限公司 | Text positioning method, apparatus, device, and storage medium |
| CN112069303A (en) * | 2020-09-17 | 2020-12-11 | 四川长虹电器股份有限公司 | Matching search method and device for character strings and terminal |
| CN113590895A (en) * | 2021-07-28 | 2021-11-02 | 西华大学 | Character string retrieval method |
| CN113590895B (en) * | 2021-07-28 | 2023-04-25 | 西华大学 | Character string retrieval method |
| CN113836367A (en) * | 2021-09-26 | 2021-12-24 | 杭州迪普科技股份有限公司 | Character reverse matching method and device |
| CN113836367B (en) * | 2021-09-26 | 2023-04-28 | 杭州迪普科技股份有限公司 | Method and device for character reverse matching |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103577598B (en) | 2017-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103577598A (en) | Matching method and device for pattern string and text string | |
| CN103425739B (en) | A kind of character string matching method | |
| US9092483B2 (en) | User query reformulation using random walks | |
| CN107193921B (en) | Method and system for correcting error of Chinese-English mixed query facing search engine | |
| CN110134714B (en) | Distributed computing framework cache index method suitable for big data iterative computation | |
| CN101398820B (en) | Large scale key word matching method | |
| CN102722709B (en) | Method and device for identifying garbage pictures | |
| CN106528647B (en) | One kind carrying out the matched method of term based on cedar even numbers group dictionary tree algorithm | |
| CN105389349A (en) | Dictionary updating method and apparatus | |
| CN105447179A (en) | Microblog social network based topic automated recommendation method and system | |
| CN110362827B (en) | Keyword extraction method, keyword extraction device and storage medium | |
| CN101329680B (en) | Large scale rapid matching method of sentence surface | |
| CN103914570A (en) | Intelligent customer service searching method and system based on character string similarity algorithm | |
| CN103646029A (en) | Similarity calculation method for blog articles | |
| CN106777920A (en) | The method and apparatus for determining longest common subsequence | |
| CN108628907A (en) | A method of being used for the Trie tree multiple-fault diagnosis based on Aho-Corasick | |
| CN102999495B (en) | A kind of synonym Semantic mapping relation determines method and device | |
| CN112948573B (en) | Text label extraction method, device, equipment and computer storage medium | |
| CN103500178B (en) | Quick multi-mode matching method on worst-case scenario of FS algorithm | |
| CN103336765A (en) | Markov matrix off-line correction method of text keywords | |
| CN109446293A (en) | A kind of parallel higher-dimension nearest Neighbor | |
| CN114647764B (en) | Query method and device of graph structure and storage medium | |
| CN105426389A (en) | Fuzzy retrieval locating method based on UI directory tree view | |
| CN105701093A (en) | Automaton -based pattern matching method and device | |
| CN102184245B (en) | Method for fast searching massive text data keywords |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220726 Address after: 100089 building 36, courtyard 8, Dongbeiwang West Road, Haidian District, Beijing Patentee after: Dawning Information Industry (Beijing) Co.,Ltd. Patentee after: DAWNING INFORMATION INDUSTRY Co.,Ltd. Address before: 100193 No. 36 Building, No. 8 Hospital, Wangxi Road, Haidian District, Beijing Patentee before: Dawning Information Industry (Beijing) Co.,Ltd. |