Ontology driven dictionary generation and ambiguity resolution for natural language processing
First Claim
1. A computer implemented method for natural language processing ambiguity resolution, comprising:
- storing, in computer memory, an ontological hierarchy of classes and sub-classes, wherein each class or sub-class represents a distinct grammatical function or grammatical property;
storing, in computer memory, a set of grammatical rules, wherein each grammatical rule stores a permissible positional relation between one class or sub-class and another class or sub-class;
storing, in computer memory, a dictionary for each class and subclass comprising compiled word instances belonging to the class or sub-class;
receiving, using a computer processor, a phrase comprising at least two words that are each associated in the dictionary with at least one class and at least two sub-classes;
annotating, using the processor, the at least two words with possible classes and sub-classes to which the at least two words belong, based on the dictionary; and
until each of the at least two words is annotated with a single possible class and sub-class;
eliminating, using the processor, a possible class or sub-class for an ambiguous word of the at least two words, based on the grammatical rules and possible classes or sub-classes of one or more other words in the phrase, andeither selecting, using the processor, a next ambiguous word of the at least two words that remains annotated with more than one possible class and sub-class to be eliminated, or determining, using the processor, that each of the at least two words is annotated with a single possible class and sub-class.
1 Assignment
0 Petitions
Accused Products
Abstract
Natural language processing ambiguity resolution includes storing an ontological library specifying a set of grammatical rules associated with ontological classes and sub-classes. A dictionary for each class and sub-class is generated by compiling all word instances belonging to the class or sub-class. A phrase is received having at least one ambiguous word that is associated with at least one class and at least two sub-classes. The ambiguous word is annotated with the ontological classes and sub-classes to which the ambiguous word belongs and the grammatical rules associated with the ontological classes and sub-classes to which the ambiguous word belongs are retrieved from the ontological library. One or more ontological classes or sub-classes are eliminated based on the retrieved grammatical rules and a surviving ontological class and sub-class are determined to be an accurate ontological class and sub-class for the ambiguous word to resolve the natural language processing ambiguity.
44 Citations
9 Claims
-
1. A computer implemented method for natural language processing ambiguity resolution, comprising:
-
storing, in computer memory, an ontological hierarchy of classes and sub-classes, wherein each class or sub-class represents a distinct grammatical function or grammatical property; storing, in computer memory, a set of grammatical rules, wherein each grammatical rule stores a permissible positional relation between one class or sub-class and another class or sub-class; storing, in computer memory, a dictionary for each class and subclass comprising compiled word instances belonging to the class or sub-class; receiving, using a computer processor, a phrase comprising at least two words that are each associated in the dictionary with at least one class and at least two sub-classes; annotating, using the processor, the at least two words with possible classes and sub-classes to which the at least two words belong, based on the dictionary; and until each of the at least two words is annotated with a single possible class and sub-class; eliminating, using the processor, a possible class or sub-class for an ambiguous word of the at least two words, based on the grammatical rules and possible classes or sub-classes of one or more other words in the phrase, and either selecting, using the processor, a next ambiguous word of the at least two words that remains annotated with more than one possible class and sub-class to be eliminated, or determining, using the processor, that each of the at least two words is annotated with a single possible class and sub-class. - View Dependent Claims (2, 3)
-
-
4. A system for natural language processing ambiguity resolution, comprising:
-
a computer processor; and computer memory, the computer memory storing an ontological hierarchy of classes and sub-classes, wherein each class or sub-class represents a distinct grammatical function or grammatical property; a set of grammatical rules, wherein each grammatical rule stores a permissible positional relation between one class or sub-class and another class or sub-class; a dictionary for each class and subclass comprising compiled word instances belonging to the class or sub-class; and a series of program instructions, wherein the program instructions are executable by the computer processor to; receive a phrase comprising at least two words that are each associated in the dictionary with at least one class and at least two sub-classes; annotate the at least two words with possible classes and sub-classes to which the at least two words belong, based on the dictionary; and until each of the at least two words is annotated with a single possible class and sub-class; eliminate a possible class or sub-class for an ambiguous word of the at least two words, based on the grammatical rules and on the possible classes or sub-classes of one or more other words in the phrase, and either select a next ambiguous word of the at least two words that remains annotated with more than one possible class and sub-class to be eliminated, or determine that each of the at least two words is annotated with a single possible class and sub-class. - View Dependent Claims (5, 6)
-
-
7. A computer implemented method for natural language processing ambiguity resolution, comprising:
-
storing, in computer memory, an ontological hierarchy of classes and sub-classes, wherein each class or sub-class represents a distinct linguistic property; storing, in computer memory, a set of grammatical rules, wherein each grammatical rule stores a permissible positional relation between one class or sub-class and another class or sub-class; storing, in computer memory, a dictionary for each class and subclass comprising compiled single-word or multiword instances belonging to the class or sub-class; receiving, using a computer processor, a phrase comprising at least two words or multiword instances that are each associated in the dictionary with at least one class and at least two sub-classes; annotating, using the processor, the at least two words or multiword instances with possible classes and sub-classes to which the at least two words or multiword instances belong, based on the dictionary; and until each of the at least two words or multiword instances is annotated with a single possible class and sub-class; eliminating, using the processor, a possible class or sub-class for an ambiguous word or multiword instance of the at least two words or multiword instances, based on the grammatical rules and possible classes or sub-classes of one or more other words or multiword instances in the phrase, and either selecting, using the processor, a next ambiguous word or multiword instance of the at least two words or multiword instances that remains annotated with more than one possible class and sub-class to be eliminated, or determining, using the processor, that each of the at least two words or multiword instances is annotated with a single possible class and sub-class. - View Dependent Claims (8, 9)
-
Specification