Inferencing using disambiguated natural language rules
First Claim
1. A method of automatically producing bridging inferences that join two related input phrases, said method comprising:
- applying a lexicon and ontology data structure to a first input phrase to produce a first tagged input phrase;
matching said first tagged input phrase to first rules;
generating first inferred phrases from said first rules;
matching said first inferred phrases to second rules;
generating second inferred phrases from said second rules;
applying said lexicon and ontology data structure to a second input phrase to produce a second tagged input phrase;
selecting a first rule of said first rules and a second rule of said second rules that causes a second inferred phrase of said second inferred phrases to match said second tagged input phrase; and
recording, as a bridging inference path, said first rule and said second rule, wherein said first rule and said second rule each comprise a pattern element comprising a lexical entry and an optional variable.
3 Assignments
0 Petitions
Accused Products
Abstract
A method and structure for automatically producing bridging inferences that join two related input sentences, by applying a lexicon and ontology data structure to a first input sentence to produce first input tagged sentences, applying the lexicon and ontology data structure to a second input sentence to produce second input tagged sentences, matching each first input tagged sentence to first rules, generating first inferred tagged sentences from the first rules, matching the first inferred tagged sentences to second rules, generating second inferred tagged sentences from the second rules, matching the second inferred tagged sentences to third rules, generating third inferred tagged sentences from the third rules, and so on, until a final inferred tagged sentence matches any second input tagged sentence. For each final inferred tagged sentence matching a second input tagged sentence, a bridging inference path is produced as output comprising a first input tagged sentence, a first inferred tagged sentence, a second inferred tagged sentence, a third inferred tagged sentence, and so on, and a final inferred tagged sentence. The first inferred tagged sentence in the briding inference path is the particular first inferred tagged sentence that resulted from application of a first rule to the first input tagged sentence. For the second through the last inferred tagged sentences in the bridging inference path, each inferred tagged sentence in the bridging inference path is the particular inferred tagged sentence that resulted from application of a rule to the previous inferred tagged sentence in the bridging inference path.
-
Citations
28 Claims
-
1. A method of automatically producing bridging inferences that join two related input phrases, said method comprising:
-
applying a lexicon and ontology data structure to a first input phrase to produce a first tagged input phrase; matching said first tagged input phrase to first rules; generating first inferred phrases from said first rules; matching said first inferred phrases to second rules; generating second inferred phrases from said second rules; applying said lexicon and ontology data structure to a second input phrase to produce a second tagged input phrase; selecting a first rule of said first rules and a second rule of said second rules that causes a second inferred phrase of said second inferred phrases to match said second tagged input phrase; and recording, as a bridging inference path, said first rule and said second rule, wherein said first rule and said second rule each comprise a pattern element comprising a lexical entry and an optional variable. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method of automatically producing predictive inferences from an input phrase, said method comprising:
-
applying a lexicon and ontology data structure to said input phrase to produce a tagged input phrase; matching said tagged input phrase to rules; generating inferred phrases from said rules, wherein said rules comprise a pattern element comprising a lexical entry and an optional variable. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computer system with at least one memory and at least one central processing unit, said computer system having a lexicon and ontology data structure and a rule base data structure, each stored in said memory, wherein said lexicon and ontology data structure comprises:
-
at least one lexical entry, concepts, and character strings; a first map from said character strings to said lexical entries; a second map from said lexical entries to said concepts; a third map from said concepts to said lexical entries; and a fourth map representing a parent relationship from said concepts to said concepts, wherein each lexical entry comprises a character string, part of speech, and sense number, wherein each concept comprises a character string, wherein said rule base data structure comprises at least one rules, wherein said rule includes a left pattern, a connective, and a right pattern, wherein a pattern comprises a list of pattern elements, and wherein a pattern element comprises a lexical entry and an optional variable. - View Dependent Claims (18, 19, 20, 21, 22)
-
-
23. A computer system with at least one memory and at least one central processing unit, said computer system having a lexicon and ontology data structure and a rule base data structure, each stored in said memory, wherein said lexicon and ontology data structure comprises:
-
at least one lexical entry, concepts, and character strings, wherein each lexical entry comprises a character string, part of speech, and sense number, wherein each concept comprises a character string, wherein said rule base data structure comprises at least one rules, wherein said rule includes a left pattern, a connective, and a right pattern, wherein a pattern comprises a list of pattern elements, and wherein a pattern element comprises a lexical entry and an optional variable. - View Dependent Claims (24, 25, 26, 27, 28)
-
Specification