发明申请
- 专利标题: DECOMPOSING AND MERGING REGULAR EXPRESSIONS
- 专利标题(中): 分解和合并常规表达
-
申请号: US12968618申请日: 2010-12-15
-
公开(公告)号: US20120158768A1公开(公告)日: 2012-06-21
- 发明人: Charles William Lamanna , Mauktik H. Gandhi , Jason Eric Brewer
- 申请人: Charles William Lamanna , Mauktik H. Gandhi , Jason Eric Brewer
- 申请人地址: US WA Redmond
- 专利权人: Microsoft Corporation
- 当前专利权人: Microsoft Corporation
- 当前专利权人地址: US WA Redmond
- 主分类号: G06F17/30
- IPC分类号: G06F17/30
摘要:
The present invention extends to methods, systems, and computer program products for decomposing and merging regular expressions. Embodiments of the invention decompose a regular expression into multiple simple keyword graphs, merge those keyword graphs in a compact and efficient manner, and produce a directed acyclic graph (DAG) that can execute a simplified regular expression alphabet. Several of these regular expression DAG's can then be merged together to produce a single DAG that represents an entire collection of regular expressions. DAGs along with other text processing algorithms and a heap collection can be combined in a multi-pass approach to expand the regular expression alphabet.
信息查询