Sap Se

Sap Portals Israel Limited

Ronen Halbani

Shahar Tarshish

Liad Barel

Anita Demayo

Efrat Vilozny

The present disclosure relates to computer systems and computer-implemented methods for automatically enabling natural language rules in a structured rule engine. In one example, the method includes receiving an input identifying an unstructured query corresponding to a particular application associated with a rules framework associated with a pre-defined query structure format, analyzing the received input based on a first set of design time artifacts associated with the particular application and a second set of design time artifacts associated with the rules framework, the first set of artifacts uniquely associated with the particular application and the second set of artifacts generically associated with the rules framework, wherein the second set of design time artifacts are applied commonly to a plurality of different applications. A structured query for the particular application is generated in the pre-defined query structure format of the rules framework based on the first and second set of artifacts.

Automatic generation of structured queries from natural language input

A method and system are provided including a parser module; a display; a memory storing processor-executable process steps; and a parser processor coupled to the memory, and in communication with the parser module and operative to execute the processor-executable steps to cause the system to: provide a user interface to a user via the display, the user interface including one or more data-entry fields; receive an expression in the one or more data-entry fields; transform the expression into a tree structure, wherein the tree structure is usable by two or more different runtime engines; and output the tree structure. Numerous other aspects are provided.

Re-usable rule parser for different runtime engines

The disclosure generally describes computer-implemented methods, software, and systems for enabling dynamic tokens in an expression parser. An example method includes identifying an expression represented as a natural language input for validation by a parser. Each of the phrases in the expression are iteratively converted into a set of tokens by determining whether a current phrase matches a pre-defined token associated with a known grammar rule, and, in response to determining that the current phrase matches a pre-defined token, generating a token for the current phrase for use in validating the expression. If the current phrase does not match a pre-defined token, the unrecognized string of characters is compared to a plurality of dynamic tokens included in an external pool of tokens to generate a generic token of an identified type. The dynamic token is replaced with the generic token and can be used to validate the expression.

Growing community of inventors

Natania, Israel

Ronen Halbani