Patent US5113342A successfully refreshed from Google Patents.
US5113342A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Computer method for executing transformation rules
Assignee: International Business Machines Corp
•
Filing: 1989-04-26
•
Granted: 1992-05-12
•
Expires: 2009-04-26
Abstract
Abstract A computer method is disclosed for using rewrite rules of the form X(Y)Z=(R) where X is the left context, Y is the body of the rule, Z is the right context and R is the replacement value for Y if the rule is successful. The method places restrictions on how the rules are defined to make it possible to organize the rules so that they can be indexed efficiently. In particular, the body of the rules is not allowed to be defined in generic terms, whereas this restriction is not applied to the left and right context of the rules. The rules are scanned so that the first rule that matches the body and its context is the one that applies. Ordering the rules into a hierarchy makes it possible to have exceptions to any particular rule. The method encompasses a model where the rules are applied to any input string. When no rules apply to any character of the input string, a default rule to copy the string is applied. This guarantees that the process will always terminate and that it will be loop-free.
Inventors
- 👤 Antonio Zamora
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 11:12
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/10; G06F40/166; G06F40/20; G06F40/279; G06F40/284; G06F40/40; G06F40/55; G06F8/00; G06F8/30; G06F8/31; G06F8/311
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
212 words
A process for executing transformation rules within a computer system with an input and an output which sequentially, for each input character, comprises the steps of: looking up the current input character in an index which identifies the rules applicable to that character; attempting to match a portion of the rule identified as the "body" of the rule having a string of one or more characters against the input string, starting at the current input character; attempting to match a portion of the rule identified as the "right context" of the rule having a sequence of strings or identifiers representing sets of strings against the input string to the right of said matching "body;" attempting to match a portion of the rule identified as the "left context" of the rule having a sequence of strings or identifiers representing sets of strings against the input string to the left of said matching "body;" outputting a replacement string associated with the matching rule when all portions of the rule match against the input string, and skipping the portion of the input string corresponding to the body to continue the transformation process; outputting the input character in the event that the current input character does not have any applicable rules, to continue the transformation process.
Claim 2
Dependent Claim
212 words
A process for executing transformation rules within a computer system with an input and an output which sequentially, for each input character, comprises the steps of: looking up the current input character in an index which identifies the rules applicable to that character; attempting to match a portion of the rule identified as the "body" of the rule having a string of one or more characters against the input string, starting at the current input character; attempting to match a portion of the rule identified as the "right context" of the rule having a sequence of strings or identifiers representing sets of strings against the input string to the right of said matching "body;" attempting to match a portion of the rule identified as the "left context" of the rule having a sequence of strings or identifiers representing sets of strings against the input string to the left of said matching "body;" outputting a replacement string associated with the matching rule when all portions of the rule match against the input string, and skipping the portion of the input string corresponding to the body to continue the transformation process; outputting the input character in the event that the current input character does not have any applicable rules, to continue the transformation process.
Claim 3
Dependent Claim
24 words
The process of claim 1, where the output of the transformation is reprocessed through a set of rules for any finite number of iterations.
Claim 4
Dependent Claim
46 words
The process of claim 1, where a state is associated with each rule and with each replacement string so that only rules with a particular state are examined, and the state associated with the replacement string determines the rules that will be examined in subsequent iterations.
Claim 5
Dependent Claim
12 words
The process of claim 1, where said transformation rules are hyphenation rules.
Claim 6
Dependent Claim
13 words
The process of claim 1, where said transformation rules are phonetic mapping rules.
Claim 7
Dependent Claim
63 words
A computer method for defining a collection of rewrite rules, comprising: inputting to a computer the body of each rule to consist of terminal strings only; organizing the rules based in the computer on the collating sequence of the "body" of each rule; and inputting to the computer an index based on the "body" of the rules to access the collection of rules.
Claim 8
Dependent Claim
63 words
A computer method for defining a collection of rewrite rules, comprising: inputting to a computer the body of each rule to consist of terminal strings only; organizing the rules based in the computer on the collating sequence of the "body" of each rule; and inputting to the computer an index based on the "body" of the rules to access the collection of rules.
Claim 9
Dependent Claim
93 words
A computer method for applying rewrite rules, comprising the steps of: scanning an input string character-by-character; locating rewrite rules that may be applicable by the use of an index based on the characters of the "body" of the rules; if the "body" and the context of a rule match, creating an input string by replacing the portion of the input string that matches the "body" of a rule with the corresponding replacement string, skipping the replaced portion of the input, and optionally setting a state variable to a value associated with the rule.
Claim 10
Dependent Claim
93 words
A computer method for applying rewrite rules, comprising the steps of: scanning an input string character-by-character; locating rewrite rules that may be applicable by the use of an index based on the characters of the "body" of the rules; if the "body" and the context of a rule match, creating an input string by replacing the portion of the input string that matches the "body" of a rule with the corresponding replacement string, skipping the replaced portion of the input, and optionally setting a state variable to a value associated with the rule.
Claim 11
Dependent Claim
26 words
The method as described in claim 7, wherein the process applies to rules for which the state variable matches the execution state associated with a rule.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-05-12 | 1995-11-11 | 1996-05-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-05-12 | 1999-11-11 | 2000-05-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-05-12 | 2003-11-11 | 2004-05-12 | $7700.00 | Window Closed / Lapsed |