Back to results
US 2019/0171953 A1Published application
Automatically generating reasoning graphs
AssigneeCotiviti, Inc.
InventorsChristopher Taylor Creel, William Paige Vestal, Christopher Shawn Watson
Life of this patent
Estimating the term…
Abstract
Embodiments disclosed herein relate to methods and systems for transliterating reasoning graphs and using the same to determine insights.
Claims43
A method of automatically outputting transliterations of a target reasoning graph, the method comprising:
- inputting a target reasoning graph into a computer, wherein the target reasoning graph includes:
- a plurality of leaf nodes each defining an insight;
- a plurality of reasoning paths each terminating at a leaf node, and
- a plurality of internal nodes each describing a reasoning function in plain language format, wherein each reasoning function defines a portion of the plurality of reasoning paths and defines queries and inputs for making a discrete decision with reference data at a specific point along a selected reasoning path;
- wherein the plurality of internal nodes, the plurality of leaf nodes, and the plurality of reasoning functions of the target reasoning graph are in a plain language format;
- providing, in the computer, a transliteration library including:
- a portfolio of templating functions in a templating language;
- a portfolio of reasoning functions in the plain language format;
- wherein the transliteration library defines a correspondence between each reasoning function of the portfolio of reasoning functions and a selected templating function of the portfolio of templating functions;
- with the computer, automatically generating a templating language representation of the target reasoning graph by correlating the reasoning functions of the target reasoning graph with the templating functions of the portfolio of templating functions corresponding thereto;
- and
- outputting the templating language representation of the target reasoning graph.
9 more elements
A method of automatically outputting transliterations of a target reasoning graph, the method comprising:
- inputting a target reasoning graph into a computer in data exchange format, wherein the target reasoning graph includes:
- a plurality of leaf nodes each defining an insight;
- a plurality of reasoning paths each terminating at a leaf node, and
- a plurality of internal nodes each describing a reasoning function in plain language format, wherein each reasoning function defines a portion of the plurality of reasoning paths and defines queries and inputs for making a discrete decision with reference data at a specific point along a selected reasoning path;
- wherein the plurality of internal nodes, the plurality of leaf nodes, and the plurality of reasoning functions of the target reasoning graph are in a plain language format;
- providing, in the computer, a transliteration library including:
- a portfolio of templating functions in a templating language;
- a portfolio of reasoning functions in the plain language format;
- wherein the transliteration library defines a correspondence between each reasoning function of the portfolio of reasoning functions and a selected templating function of the portfolio of templating functions;
- with the computer, automatically generating a templating language representation of the target reasoning graph by correlating the reasoning functions of the target reasoning graph with the templating functions of the portfolio of templating functions corresponding thereto;
- with a first compiler, converting the templating language representation of the target reasoning graph into one or more of a high-level programming language representation or a documentation language representation of the target reasoning graph;
- and
- with a second compiler, converting the high-level programming language or the documentation language representation of the target reasoning graph to machine executable code.
10 more elements
A method of automatically determining an insight using a transliterated target reasoning graph, the method comprising:
- inputting a target reasoning graph into a computer in data exchange format, wherein the target reasoning graph includes:
- a plurality of leaf nodes each defining an insight;
- a plurality of reasoning paths each terminating at a leaf node, and
- a plurality of internal nodes each describing a reasoning function in plain language format, wherein each reasoning function defines a portion of the plurality of reasoning paths and defines queries and inputs for making a discrete decision with reference data at a specific point along a selected reasoning path;
- wherein the plurality of internal nodes, the plurality of leaf nodes, and the plurality of reasoning functions of the target reasoning graph are in a plain language format;
- providing, in the computer, a transliteration library including:
- a portfolio of templating functions in a templating language;
- a portfolio of reasoning functions in the plain language format;
- wherein the transliteration library defines a correspondence between each reasoning function of the portfolio of reasoning functions and a selected templating function of the portfolio of templating functions;
- with the computer, automatically generating a templating language representation of the target reasoning graph by correlating the reasoning functions of the target reasoning graph with the templating functions of the portfolio of templating functions corresponding thereto;
- with the computer, converting the templating language representation of the target reasoning graph into one or more of a high-level programming language representation or a documentation language representation of the target reasoning graph;
- with at least one compiler, converting the high-level programming language representation of the target reasoning graph to machine executable code;
- and
- with the computer and the machine executable code of the target reasoning graph, determining an insight using the reference data to make each discrete decision corresponding to each reasoning function in the selected reasoning path until the selected reasoning path reaches a selected leaf node corresponding thereto.
11 more elements
A computer program product for of automatically outputting transliterations of a target reasoning graph, the computer program product comprising:
- a machine readable program stored on a non-transitory computer readable medium, the machine readable program including:
- an input module configured for accepting input of a target reasoning graph in data exchange format, wherein the target reasoning graph includes:
- a plurality of leaf nodes each defining an insight;
- a plurality of reasoning paths each terminating at a leaf node, and
- a plurality of internal nodes each describing a reasoning function in plain language format, wherein each reasoning function defines a portion of the plurality of reasoning paths and defines queries and inputs for making a discrete decision with reference data at a specific point along a selected reasoning path;
- wherein the plurality of internal nodes, the plurality of leaf nodes, and the plurality of reasoning functions of the target reasoning graph are in a plain language format;
- a transliteration library including:
- a portfolio of templating functions in a templating language;
- a portfolio of reasoning functions in the plain language format;
- wherein the transliteration library defines a correspondence between each reasoning function of the portfolio of reasoning functions and a selected templating function of the portfolio of templating functions;
- a transliteration module configured for automatically generating a templating language representation of the target reasoning graph by correlating the reasoning functions of the target reasoning graph with the templating functions of the portfolio of templating functions corresponding thereto;
- a reference data library for storing the reference data;
- a first compiler for converting the templating language representation of the target reasoning graph into one or more of a high-level programming language representation or a documentation language representation of the target reasoning graph;
- a second compiler for converting the high-level programming language representation or the documentation language representation of the target reasoning graph into machine executable code;
- and
- an output module configured for outputting the machine code.
13 more elements
Dependencies are inferred from the claim text.