US 12,406,146 B2
Computer implemented method for the automated analysis or use of data
William Tunstall-Pedoe, Cambridgeshire (GB); Finlay Curran, Cambridgeshire (GB); Harry Roscoe, Cambridgeshire (GB); and Robert Heywood, Cambridgeshire (GB)
Assigned to UNLIKELY ARTIFICIAL INTELLIGENCE LIMITED, Cambridgeshire (GB)
Filed by UNLIKELY ARTIFICIAL INTELLIGENCE LIMITED, Cambridgeshire (GB)
Filed on Dec. 25, 2022, as Appl. No. 18/088,593.
Application 18/088,593 is a continuation of application No. 18/001,368, previously published as PCT/GB2021/052196, filed on Aug. 24, 2021.
Claims priority of application No. 2013207 (GB), filed on Aug. 24, 2020; application No. 2014876 (GB), filed on Sep. 21, 2020; and application No. 2020164 (GB), filed on Dec. 18, 2020.
Prior Publication US 2023/0132072 A1, Apr. 27, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/951 (2019.01); G06F 16/242 (2019.01); G06F 16/31 (2019.01); G06F 16/3329 (2025.01); G06F 40/123 (2020.01); G06F 40/126 (2020.01); G06F 40/20 (2020.01); G06F 40/205 (2020.01); G06F 40/211 (2020.01); G06F 40/226 (2020.01); G06F 40/242 (2020.01); G06F 40/279 (2020.01); G06F 40/30 (2020.01); G06F 40/35 (2020.01); G06F 40/45 (2020.01); G06F 40/47 (2020.01); G06F 40/58 (2020.01); G06N 3/0442 (2023.01); G06N 3/0455 (2023.01); G06N 3/0499 (2023.01); G06N 3/08 (2023.01); G06N 5/02 (2023.01); G06Q 10/1053 (2023.01); G06Q 30/0251 (2023.01); G06Q 30/0601 (2023.01); G10L 15/08 (2006.01); G10L 15/16 (2006.01); G10L 15/18 (2013.01); G10L 15/22 (2006.01); G10L 15/26 (2006.01); G10L 25/63 (2013.01); G16H 10/60 (2018.01); H04L 51/02 (2022.01); G06N 3/091 (2023.01)
CPC G06F 40/35 (2020.01) [G06F 16/243 (2019.01); G06F 16/322 (2019.01); G06F 16/3329 (2019.01); G06F 16/951 (2019.01); G06F 40/123 (2020.01); G06F 40/126 (2020.01); G06F 40/20 (2020.01); G06F 40/205 (2020.01); G06F 40/211 (2020.01); G06F 40/226 (2020.01); G06F 40/242 (2020.01); G06F 40/279 (2020.01); G06F 40/30 (2020.01); G06F 40/45 (2020.01); G06F 40/47 (2020.01); G06F 40/58 (2020.01); G06N 3/0442 (2023.01); G06N 3/0455 (2023.01); G06N 3/0499 (2023.01); G06N 3/08 (2013.01); G06N 5/02 (2013.01); G06Q 10/1053 (2013.01); G06Q 30/0255 (2013.01); G06Q 30/0257 (2013.01); G06Q 30/0631 (2013.01); G10L 15/16 (2013.01); G10L 15/1815 (2013.01); G10L 15/22 (2013.01); G10L 15/26 (2013.01); G10L 25/63 (2013.01); G16H 10/60 (2018.01); H04L 51/02 (2013.01); G06N 3/091 (2023.01); G10L 2015/088 (2013.01)] 28 Claims
OG exemplary drawing
 
1. A computer implemented method for automated analysis or use of data, comprising the steps of:
(a) storing or accessing in a memory store a structured, machine-readable representation of data that conforms to a machine-readable language; in which the data includes personal health or medical data;
(b) automatically processing the structured representation to analyse the personal health or medical data;
in which the method includes the step of
(c) the machine-readable language representing a question in a memory in the structured, machine-readable representation of data; and the method further includes the step of
(d) automatically generating a response to the question, using the following steps:
(i) matching the question with the structured, machine-readable representations of data previously stored in the memory store;
(ii) fetching and executing one or more computation units, wherein the computation units represent computational capabilities relevant to answering the question;
(iii) fetching and execution of one or more reasoning passages, which are structured, machine-readable representations of data that represent semantics of potentially 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 the same machine-readable language;
in which the machine-readable language used to represent the question, the structured, machine-readable representations of data previously stored in the memory store, the computation units and the reasoning passages uses semantic nodes and passages to represent the question, the structured, machine-readable representations of data previously stored in the memory store, the computation units and the reasoning passages; and in which each semantic node represents a respective entity which is represented by a respective identifier; and each passage is either (i) a semantic node or (ii) a combination of semantic nodes; and where machine-readable meaning comes from choice of semantic nodes and the way they are combined and ordered as passages;
in which the machine-readable language: (I) uses a syntax that is a single shared syntax that applies to passages that represent factual statements, query statements and reasoning statements; (II) uses a syntax that is an unambiguous syntax comprising nesting of structured representations of data; and (III) uses an identifier selected from an address space that is sufficiently large to enable users to select a new identifier with negligible risk of selecting a previously allocated identifier; and (IV) is scalable.