Back to results
US 12,008,326 B2Granted
Computer implemented method for the automated analysis or use of data
AssigneeUnlikely Artificial Intelligence Limited
InventorsWilliam Tunstall-Pedoe, Finlay Curran, Harry Roscoe, Robert Heywood
Life of this patent
Estimating the term…
Abstract
A computer implemented method for the automated analysis or use of data is implemented by a voice assistant. The method comprises the steps of: (a) storing in a memory a structured, machine-readable representation of data that conforms to a machine-readable language (‘machine representation’); the machine representation including representations of user speech or text input to a human/machine interface; and (b) automatically processing the machine representations to analyse the user speech or text input.
Claims25
A computer implemented method for the automated analysis or use of data, comprising the steps of:
- (a) storing in a non-transitory computer-readable medium a structured, machine-readable representation of data that conforms to a machine-readable language, and in which a question is represented in the non-transitory computer-readable medium as a structured, machine-readable representation of data;
- and
- (b) automatically generating a response to the question, using the following steps:
- (i) matching the question with structured, machine-readable representations of data previously stored in a memory store;
- (ii) fetching and executing one or more computation units, wherein each computation unit is a semantic node, where computation units represent computational capabilities relevant to answering the question;
- (iii) fetching and executing one or more reasoning passages, which are structured, machine-readable representations of data that represent semantics of applicable reasoning steps relevant to answering the question;
- and in which the representation of the question, the structured, machine-readable representations of data previously stored in the memory store, the computation units and the reasoning passages are all represented in substantially the same machine-readable language;
- in which the step of fetching and executing the one or more reasoning passages, which are one or more initial reasoning passages, returns other passages with unknowns that need to be processed, and results of that processing is a tree of connection that is used to give results for the one or more initial reasoning passages;
- in which the tree of connection is stored and the processing of these other passages with unknowns happens in parallel, allowing data fetching and exploration of reasoning to be parallelized;
- in which once all passages are processed up to a given maximum reasoning depth, a second non-parallelised step is used to walk through this tree of connection of processed passages and unknowns, including unknowns mappings, to find valid answers.
7 more elements
A computer-based system configured to analyse data, the system being configured to:
- (a) store in a non-transitory computer-readable medium a structured, machine-readable representation of data that conforms to a machine-readable language, and in which a question is represented in the non-transitory computer-readable medium as a structured, machine-readable representation of data;
- and
- (b) automatically generate a response to the question, using:
- (i) matching the question with structured, machine-readable representations of data previously stored in a memory store;
- (ii) fetching and executing one or more computation units, wherein each computation unit is a semantic node, where computation units represent computational capabilities relevant to answering the question;
- (iii) fetching and executing one or more reasoning passages, which are structured, machine-readable representations of data that represent semantics of applicable reasoning steps relevant to answering the question;
- and in which the representation of the question, the structured, machine-readable representations of data previously stored in the memory store, the computation units and the reasoning passages are all represented in substantially the same machine-readable language;
- in which the fetching and executing of the one or more reasoning passages, which are one or more initial reasoning passages, returns other passages with unknowns that need to be processed, and results of that processing is a tree of connection that is used to give results for the one or more initial reasoning passages;
- in which the tree of connection is stored and the processing of these other passages with unknowns happens in parallel, allowing data fetching and exploration of reasoning to be parallelized;
- in which once all passages are processed up to a given maximum reasoning depth, a second non-parallelised step is used to walk through this tree of connection of processed passages and unknowns, including unknowns mappings, to find valid answers.
7 more elements
Dependencies are inferred from the claim text.