A method includes obtaining a sequence of words of a query and identifying, for each word of the sequence of words, an identigen subset to produce a plurality of identigen subsets. The method further includes determining, in accordance with grouping rules, a query entigen grouping that includes a sequence of unique entigens, where an entigen of the sequence of unique entigens corresponds to an identigen of a corresponding identigen subset of the plurality of identigen subsets, and where the query entigen grouping corresponds to a meaning of associated with the query. The method further includes identifying a section of a knowledge base that substantially matches the query entigen grouping, where the knowledge base facilitates storage of knowledge as a multitude of entigen groupings. The method further includes determining an answer to the query based on the section of the knowledge base.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A method for execution by a computer, the method comprising: obtaining a representation of at least a portion of a query, wherein the query includes a sequence of words; identifying, for each word of the sequence of words, an identigen subset to produce a plurality of identigen subsets, wherein each identigen subset of the plurality of identigen subsets includes one or more identigens, and wherein an identigen of the one or more identigens has an associated potential meaning of the word; determining, in accordance with grouping rules, a query entigen grouping that includes a sequence of unique entigens, wherein the sequence of unique entigens corresponds to the sequence of words, wherein an entigen of the sequence of unique entigens corresponds to an identigen of a corresponding identigen subset of the plurality of identigen subsets, and wherein the query entigen grouping corresponds to a meaning associated with the at least the portion of the query; identifying a section of a knowledge base that substantially matches the query entigen grouping, wherein the knowledge base facilitates storage of knowledge as a multitude of entigen groupings; and determining an answer to the query based on the section of the knowledge base.
2. The method of claim 1 further comprises: accessing a descriptive index dictionary to identify each identigen of the one or more identigens of the identigen subset.
3. The method of claim 1 further comprises: the knowledge base includes a graphical database, wherein each entigen of the multitude of entigen groupings is associated with a node of the graphical database.
4. The method of claim 1 , wherein the identifying the identigen subset comprises: identifying at least one entigen of an associated query entigen grouping.
5. The method of claim 1 , wherein the determining the query entigen grouping comprises one or more of: allowing a first query entigen grouping when a first sequence of unique entigens associated with the first query entigen grouping is allowed by the grouping rules; rejecting a second query entigen grouping when a second sequence of unique entigens associated with the second query entigen grouping is not allowed by the grouping rules; allowing a third query entigen grouping when each pairing of sequentially adjacent entigens of a third sequence of unique entigens associated with the third query entigen grouping is allowed by a pairing aspect of the grouping rules; and rejecting a fourth query entigen grouping when each pairing of sequentially adjacent entigens of a fourth sequence of unique entigens associated with the fourth query entigen grouping is not allowed by the pairing aspect of the grouping rules.
6. The method of claim 1 , wherein the identifying the section of the knowledge base that substantially matches the query entigen grouping comprises one or more of: indicating, for each query entigen grouping, a match when a graphical representation of the query entigen grouping compares favorably to a graphical representation of the section of the knowledge base, wherein the knowledge base includes a graphical database, and wherein each entigen of the multitude of entigen groupings is associated with a node of the graphical database; and selecting a first query entigen grouping over at least one other query entigen grouping when a first graphical representation of the first query entigen grouping compares most favorably to a first graphical representation of a first section of the knowledge base and each graphical representation of the at least one other query entigen grouping compares less favorably to each graphical representation of each section of the knowledge base.
7. The method of claim 1 , wherein the determining the answer to the query based on the section of the knowledge base comprises: extracting at least one entigen of an entigen grouping associated with the section of the knowledge base, wherein the at least one entigen resolves the query; and forming the answer utilizing the at least one entigen.
8. The method of claim 1 further comprises: updating the knowledge base utilizing the query entigen grouping to produce an updated knowledge base.
9. The method of claim 1 further comprises: determining a first answer to the query based on a first section of the knowledge base and a second answer to the query based on a second section of the knowledge base, wherein a common section of the knowledge base may include the first section of the knowledge base and the second section of the knowledge base.
10. The method of claim 1 further comprises one or more of: obtaining clarifying information when the query entigen grouping does not match any section of the knowledge base, wherein the clarifying information provides more clarity with regards to the query; and obtaining the clarifying information when rejecting the query entigen grouping when the sequence of unique entigens is not allowed by the grouping rules.
11. A computer readable memory comprises: a first memory element that stores operational instructions that, when executed by a processor, causes the processor to: obtain a representation of at least a portion of a query, wherein the query includes a sequence of words; a second memory element that stores operational instructions that, when executed by the processor, causes the processor to: identify, for each word of the sequence of words, an identigen subset to produce a plurality of identigen subsets, wherein each identigen subset of the plurality of identigen subsets includes one or more identigens, and wherein an identigen of the one or more identigens has an associated potential meaning of the word; a third memory element that stores operational instructions that, when executed by the processor, causes the processor to: determine, in accordance with grouping rules, a query entigen grouping that includes a sequence of unique entigens, wherein the sequence of unique entigens corresponds to the sequence of words, wherein an entigen of the sequence of unique entigens corresponds to an identigen of a corresponding identigen subset of the plurality of identigen subsets, and wherein the query entigen grouping corresponds to a meaning associated with the at least the portion of the query; a fourth memory element that stores operational instructions that, when executed by the processor, causes the processor to: identify a section of a knowledge base that substantially matches the query entigen grouping, wherein the knowledge base facilitates storage of knowledge as a multitude of entigen groupings; and a fifth memory element that stores operational instructions that, when executed by the processor, causes the processor to: determine an answer to the query based on the section of the knowledge base.
12. The computer readable memory of claim 11 further comprises: the second memory element further stores operational instructions that, when executed by the processor, causes the processor to: access a descriptive index dictionary to identify each identigen of the one or more identigens of the identigen subset.
13. The computer readable memory of claim 11 further comprises: the knowledge base includes a graphical database, wherein each entigen of the multitude of entigen groupings is associated with a node of the graphical database.
14. The computer readable memory of claim 11 further comprises: the second memory element further stores operational instructions that, when executed by the processor, causes the processor to identify the identigen subset by: identifying at least one entigen of an associated query entigen grouping.
15. The computer readable memory of claim 11 further comprises: the third memory element further stores operational instructions that, when executed by the processor, causes the processor to determine the query entigen grouping by one or more of: allowing a first query entigen grouping when a first sequence of unique entigens associated with the first query entigen grouping is allowed by the grouping rules; rejecting a second query entigen grouping when a second sequence of unique entigens associated with the second query entigen grouping is not allowed by the grouping rules; allowing a third query entigen grouping when each pairing of sequentially adjacent entigens of a third sequence of unique entigens associated with the third query entigen grouping is allowed by a pairing aspect of the grouping rules; and rejecting a fourth query entigen grouping when each pairing of sequentially adjacent entigens of a fourth sequence of unique entigens associated with the fourth query entigen grouping is not allowed by the pairing aspect of the grouping rules.
16. The computer readable memory of claim 11 further comprises: the fourth memory element further stores operational instructions that, when executed by the processor, causes the processor to identify the section of the knowledge base that substantially matches the query entigen grouping by one or more of: indicating, for each query entigen grouping, a match when a graphical representation of the query entigen grouping compares favorably to a graphical representation of the section of the knowledge base, wherein the knowledge base includes a graphical database, and wherein each entigen of the multitude of entigen groupings is associated with a node of the graphical database; and selecting a first query entigen grouping over at least one other query entigen grouping when a first graphical representation of the first query entigen grouping compares most favorably to a first graphical representation of a first section of the knowledge base and each graphical representation of the at least one other query entigen grouping compares less favorably to each graphical representation of each section of the knowledge base.
17. The computer readable memory of claim 11 further comprises: the fifth memory element further stores operational instructions that, when executed by the processor, causes the processor to determine the answer to the query based on the section of the knowledge base by: extracting at least one entigen of an entigen grouping associated with the section of the knowledge base, wherein the at least one entigen resolves the query; and forming the answer utilizing the at least one entigen.
18. The computer readable memory of claim 11 further comprises: the third memory element further stores operational instructions that, when executed by the processor, causes the processor to: update the knowledge base utilizing the query entigen grouping to produce an updated knowledge base.
19. The computer readable memory of claim 11 further comprises: the fifth memory element further stores operational instructions that, when executed by the processor, causes the processor to: determine a first answer to the query based on a first section of the knowledge base and a second answer to the query based on a second section of the knowledge base, wherein a common section of the knowledge base may include the first section of the knowledge base and the second section of the knowledge base.
20. The computer readable memory of claim 11 further comprises: the fourth memory element further stores operational instructions that, when executed by the processor, causes the processor to: obtain clarifying information when the query entigen grouping does not match any section of the knowledge base, wherein the clarifying information provides more clarity with regards to the query; and obtain the clarifying information when rejecting the query entigen grouping when the sequence of unique entigens is not allowed by the grouping rules.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
August 31, 2018
August 11, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.