Multi keyword matching method for rapid content analysis
A keyword matching and content analysis technology, applied in the field of content analysis, can solve the problem that the intrusion detection system does not have a good solution
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
Embodiment Construction
[0012] A multi-keyword matching algorithm based on Huffman coding (Huff-Match) that we designed is a multi-keyword matching algorithm based on Huffman code. In the preprocessing stage, Huff-Match first establishes the Huffman code of each character according to the probability of the character appearing in the keyword, and then encodes each keyword into an integer. In the scanning phase, Huff-Match scans the text from left to right and encodes this part of the text as an integer. Then use a test table to determine whether any of the keywords are matched. Since the encoded integer at any position in the text is easily calculated from the encoding at the previous position, Huff-Match can quickly process a large number of keywords. In the actual implementation of the algorithm, there is a detection table that cannot be too large, so we only take a part of the code for calculation, but finally use strict matching to confirm the occurrence of keywords. The closest previous work o...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More