Mode matching algorithm and system based on traffic high-frequency content
A pattern matching and matching algorithm technology, which is applied in character and pattern recognition, calculation, computer components, etc., can solve the problems of low matching performance and ignoring characteristics, and achieve the effect of improving matching performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0038] Embodiment 1, with reference to figure 1 , to illustrate this embodiment, a pattern matching system based on traffic high-frequency content in this embodiment, including an AC automaton, a mapping module, and a UHC matching module; communication between the UHC matching module and the AC automaton is established through the mapping module , the mapping module is composed of multiple mapping sets; the UHC matching module creates multiple subsets corresponding to the mapping sets; the AC automaton is used to scan text, the mapping module is used to match high-frequency content, the The UHC matching module is used to process high-frequency content and save the state for jumping back to the AC automaton.
[0039] The mapping module is a fast search module, in which a smaller mapping set is generated to build a bridge between the AC node and the high-frequency content matching module, and a fast search is performed while scanning to determine whether the high-frequency conte...
Embodiment 2
[0042] Embodiment 2, with reference to Figure 1 to Figure 5 , to illustrate this embodiment, a pattern matching algorithm based on traffic high-frequency content in this embodiment includes the following steps:
[0043] Step 1. Create an automaton;
[0044] Step 1.1. Construct the automaton according to the pattern set, first create the root node;
[0045] Step 1.2: Enter the next character in the pattern in alphabetical order, if there is no side of the character, then execute step 1.3, otherwise, execute step 1.4; when all characters of all patterns are inserted into the automaton, Execute step 1.5;
[0046] Step 1.3. Create a new node, set the edge value to scan characters, and return to step 1.2;
[0047] Step 1.4, the state of the automaton jumps to the next node along the edge, and returns to step 1.2;
[0048] Step 1.5. Traversing the automata in depth, adding failure pointers to each node;
[0049] Step 1.6. Extract the first characters of all patterns of high-fr...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


