Translating text encodings of machine learning models to executable code

US11210073B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-11210073-B1
Application numberUS-202016941927-A
CountryUS
Kind codeB1
Filing dateJul 29, 2020
Priority dateJul 29, 2020
Publication dateDec 28, 2021
Grant dateDec 28, 2021

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Translating text encodings of machine learning models to executable code, the method comprising: receiving a text encoding of a machine learning model; generating, based on the text encoding of the machine learning model, compilable code encoding the machine learning model; and generating, based on the compilable code, executable code encoding the machine learning model.

First claim

Opening claim text (preview).

What is claimed is: 1. A method of translating text encodings of machine learning models to executable code, the method comprising: receiving a text encoding of a machine learning model; generating, based on the text encoding of the machine learning model, compilable code encoding the machine learning model; and generating, based on the compilable code, executable code encoding the machine learning model. 2. The method of claim 1 , wherein the text encoding of the machine learning model comprises a plurality of conditional statements, and wherein generating the compilable code comprises: parsing the plurality of conditional statements; and generating the compilable code based on the parsed plurality of conditional statements. 3. The method of claim 2 , wherein each of the plurality of conditional statements comprise one or more conditional actions, wherein the one or more conditional actions comprise a nested conditional statement or a modification to a confidence score. 4. The method of claim 2 , wherein generating the compilable code based on the parsed plurality of conditional statements comprises generating, in the compilable code, another conditional statement combining two or more of the plurality of conditional statements. 5. The method of claim 2 , wherein generating the compilable code based on the plurality of parsed conditional statements comprises generating, in the compilable code, a function corresponding to a branch of one or more nested conditional statements. 6. The method of claim 1 , wherein generating the compilable code comprises truncating one or more numerical values included in the text encoding of the machine learning model. 7. The method of claim 1 , wherein generating the executable code comprises compiling the compilable code to a target platform. 8. The method of claim 1 , wherein the machine learning model comprises a classifier. 9. An apparatus for translating text encodings of machine learning models to executable code, the apparatus comprising a computer processor and a computer memory, the computer memory including computer program instructions that, when executed by the computer processor, cause the computer processor to carry out; receiving a text encoding of a machine learning model; generating, based on the text encoding of the machine learning model, compilable code encoding the machine learning model; and generating, based on the compilable code, executable code encoding the machine learning model. 10. The apparatus of claim 9 , wherein the text encoding of the machine learning model comprises a plurality of conditional statements, and wherein generating the compilable code comprises: parsing the plurality of conditional statements; and generating the compilable code based on the parsed plurality of conditional statements. 11. The apparatus of claim 10 , wherein each of the plurality of conditional statements comprise one or more conditional actions, wherein the one or more conditional actions comprise a nested conditional statement or a modification to a confidence score. 12. The apparatus of claim 10 , wherein generating the compilable code based on the parsed plurality of conditional statements comprises generating, in the compilable code, another conditional statement combining two or more of the plurality of conditional statements. 13. The apparatus of claim 10 , wherein generating the compilable code based on the plurality of parsed conditional statements comprises generating, in the compilable code, a function corresponding to a branch of one or more nested conditional statements. 14. The apparatus of claim 9 , wherein generating the compilable code comprises truncating one or more numerical values included in the text encoding of the machine learning model. 15. The apparatus of claim 9 , wherein generating the executable code comprises compiling the compilable code to a target platform. 16. The apparatus of claim 9 , wherein the machine learning model comprises a classifier. 17. A computer program product disposed upon a non-transitory computer readable medium, the computer program product comprising computer program instructions for translating text encodings of machine learning models to executable code that, when executed, cause a computer system to perform steps comprising: receiving a text encoding of a machine learning model; generating, based on the text encoding of the machine learning model, compilable code encoding the machine learning model; and generating, based on the compilable code, executable code encoding the machine learning model. 18. The computer program product of claim 17 , wherein the text encoding of the machine learning model comprises a plurality of conditional statements, and wherein generating the compilable code comprises: parsing the plurality of conditional statements; and generating the compilable code based on the parsed plurality of conditional statements. 19. The computer program product of claim 18 , wherein each of the plurality of conditional statements comprise one or more conditional actions, wherein the one or more conditional actions comprise a nested conditional statement or a modification to a confidence score. 20. The computer program product of claim 18 , wherein generating the compilable code based on the parsed plurality of conditional statements comprises generating, in the compilable code, another conditional statement combining two or more of the plurality of conditional statements.

Assignees

Inventors

Classifications

  • G06F8/4435Primary

    Detection or removal of dead or redundant code · CPC title

  • G06F8/427Primary

    Parsing · CPC title

  • User interactive design; Environments; Toolboxes · CPC title

  • Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound · CPC title

  • Classification techniques · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11210073B1 cover?
Translating text encodings of machine learning models to executable code, the method comprising: receiving a text encoding of a machine learning model; generating, based on the text encoding of the machine learning model, compilable code encoding the machine learning model; and generating, based on the compilable code, executable code encoding the machine learning model.
Who is the assignee on this patent?
Sparkcognition Inc
What technology area does this patent fall under?
Primary CPC classification G06F8/4435. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Dec 28 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).