Scalable, rule-based processing

Patent metadata

Field	Value
Publication number	US-9495638-B2
Application number	US-201213542460-A
Country	US
Kind code	B2
Filing date	Jul 5, 2012
Priority date	Nov 18, 2011
Publication date	Nov 15, 2016
Grant date	Nov 15, 2016

Abstract

A system, method and computer program product for scalable, rule-based processing, including an automaton builder for constructing automatons corresponding to trigger rules and word lists that are employed by the trigger rules, and a rule evaluator for evaluating any of the trigger rules with respect to an input document by selecting any of the automatons to evaluate a given one of the trigger rules, parsing the input document using the selected automatons, determining whether conditions of the given trigger rule are met, and identifying any actions that are associated with the given trigger rule.

First claim

What is claimed is:

1. A method for scalable, rule-based processing, the method comprising:
constructing a plurality of automatons corresponding to a plurality of trigger rules and a plurality of word lists that are employed by the trigger rules;
evaluating any of the plurality of trigger rules with respect to an input document by :
selecting any of the automatons to evaluate a given one of the plurality of trigger rules,
parsing the input document using the selected automatons,
determining whether conditions of the given trigger rule are met, and
identifying any actions that are associated with the given trigger rule, and

displaying in a rule tracing any of the plurality of trigger rules that are evaluated, together with indicia for different portions of the displayed trigger rules indicating an evaluation result of each of the different portions.

2. The method of claim 1 where the input document includes a set of textual content fields, where each of the textual content fields are either single-valued or multi-valued.

3. The method of claim 1 where each of the trigger rules includes a trigger and at least one action.

4. The method of claim 1 where any of the trigger rules are organized into a group of trigger rules, where the group serves as a workflow control block.

5. The method of claim 4 where a trigger rule within the group is configured to prevent the evaluation of any other trigger rule within the group.

6. The method of claim 4 further comprising:
iteratively evaluating the trigger rules in the group.

7. The method of claim 1 where the input document is processed using any of the automatons that were constructed using textual content fields found in the input document.

8. The method of claim 1 and further comprising:
providing output of the selected automatons in the form of identifiers of textual content fields found within the input document and locations of the textual content fields found within the input document.

9. The method of claim 1 further comprising:
identifying text patterns that appear in the trigger rules and extracting their ranges;
converting the ranges into sets;
analyzing the sets to define non-overlapping sets;
allocating a unique set-ID to each of the non-overlapping sets;
revising the text patterns in accordance with the non-overlapping sets;
constructing an automaton for each pattern, where the set-IDs are used for transition from state to state;
merging the pattern automatons into a single master automaton;
converting the master automaton into a deterministic, minimal state FSM; and
creating a two-stage table that maps Unicode characters to their set-IDs.

Assignees

• Cohen Daniel
• Dayan Yigal S
• Magdalen Josemina M
• Tzaban Yariv
• IBM

Inventors

• Cohen Daniel
• Dayan Yigal S
• Magdalen Josemina M
• Tzaban Yariv

Classifications

• G06N5/046

  Forward inferencing; Production systems · CPC title

• G06N5/025 Primary

  Extracting rules from data · CPC title

• G06F40/205

  Parsing · CPC title

• G06F17/2705

  Physics · mapped topic