Using ontologies to comprehend regular expressions
First Claim
Patent Images
1. A system, comprising:
- one or more computer processors; and
a memory containing a program which when executed by the one or more computer processors, performs an operation, the operation comprising;
selecting, based on a context relating to a domain of a regular expression, an ontology and an assertion base;
parsing the regular expression to identify at least one fragment of the regular expression;
identifying one or more assertions in the assertion base corresponding to one of the identified fragments;
identifying, for each identified assertion, an associated node in the ontology; and
returning, based on the associated nodes, a concept in the ontology as representing the associated fragment of the regular expression.
1 Assignment
0 Petitions
Accused Products
Abstract
Ontologies are used to comprehend regular expressions, by selecting, based on a context relating to a domain of a regular expression, an ontology and an assertion base, parsing the regular expression to identify at least one fragment of the regular expression, identifying one or more assertions in the assertion base corresponding to one of the identified fragments, identifying, for each identified assertion, an associated node in the ontology, and returning, based on the associated nodes, a concept in the ontology as representing the associated fragment of the regular expression.
17 Citations
13 Claims
-
1. A system, comprising:
-
one or more computer processors; and a memory containing a program which when executed by the one or more computer processors, performs an operation, the operation comprising; selecting, based on a context relating to a domain of a regular expression, an ontology and an assertion base; parsing the regular expression to identify at least one fragment of the regular expression; identifying one or more assertions in the assertion base corresponding to one of the identified fragments; identifying, for each identified assertion, an associated node in the ontology; and returning, based on the associated nodes, a concept in the ontology as representing the associated fragment of the regular expression. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer program product, comprising:
a non-transitory computer-readable storage medium having computer-readable program code embodied therewith, the computer-readable program code executable by a processor to perform an operation comprising; selecting, based on a context relating to a domain of a regular expression, an ontology and an assertion base; parsing the regular expression to identify at least one fragment of the regular expression; identifying one or more assertions in the assertion base corresponding to one of the identified fragments; identifying, for each identified assertion, an associated node in the ontology; and returning, based on the associated nodes, a concept in the ontology as representing the associated fragment of the regular expression. - View Dependent Claims (9, 10, 11, 12, 13)
Specification