发明名称 |
REGULAR EXPRESSION PATTERN MATCHING USING KEYWORD GRAPHS |
摘要 |
Expanding a regular expression set into an expanded expression set that recognizes a same language as the regular expression set and includes more expressions than the regular expression set, with less operators per expression includes: logically connecting the expressions in the regular expression set; parsing the expanded expression set; transforming the parsed expanded expression set into a Glushkov automata; transforming the Glushkov automata into a modified deterministic finite automaton in order to maintain fundamental graph properties; combining the modified DFA into a keyword graph using a combining algorithm that preserves the fundamental graph properties; and computing an Aho-Corasick fail function for the keyword graph using a modified algorithm to produce a modified Aho-Corasick graph with a goto and a fail function and added information per state. |
申请公布号 |
US2012221494(A1) |
申请公布日期 |
2012.08.30 |
申请号 |
US201113035488 |
申请日期 |
2011.02.25 |
申请人 |
PASETTO DAVIDE;PETRINI FABRIZIO;INTERNATIONAL BUSINESS MACHINES CORPORATION |
发明人 |
PASETTO DAVIDE;PETRINI FABRIZIO |
分类号 |
G06F15/18 |
主分类号 |
G06F15/18 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|