Patent Document ID: 8650207
Application ID: 13310238

Base Claim:
1. A computer-implemented process for performing string transformations involving lookup operations in one or more relational tables, comprising: using a computer to perform the following process actions: establishing a relational table lookup expression language comprising a set of grammar rules defining expressions; generating a synthesis procedure which learns a set of expressions in the relational table lookup expression language that produces a prescribed output from one or more input string variables using said one or more relational tables based on a set of one or more input-output examples each comprising one or more input string variables and said prescribed output; and receiving one or more input string variables of a same type found in the set of one or more input-output examples, and producing the prescribed output using the synthesis procedure.

---

Claim 2:
2. The process of claim 1 , wherein the process action of generating a synthesis procedure, comprises the actions of: for each input-output example separately, employing a learning procedure to compute a set of expressions in the relational table lookup expression language that produce the prescribed output of the input-output example from the one or more input string variables of the input-output example using said one or more relational tables, and representing the computed set of expressions using a prescribed relational table lookup data structure; and whenever there are two or more input-output examples, employing an intersect procedure to intersect the sets of expressions, as represented by the prescribed relational table lookup data structure, computed using the input-output examples, wherein the intersected sets of expressions are also represented by the prescribed relational table lookup data structure.