Structure aware transformers for natural language processing
US-2024370714-A1 · Nov 7, 2024 · US
US2019354851A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2019354851-A1 |
| Application number | US-201815982688-A |
| Country | US |
| Kind code | A1 |
| Filing date | May 17, 2018 |
| Priority date | May 17, 2018 |
| Publication date | Nov 21, 2019 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Embodiments for construction of a machine learning model for structured inputs by a processor. A domain knowledge may be applied to identify the one or more grammar entities. Input data may be arranged into one or more grammar entities identified using the domain knowledge. Each of the one or more grammar entities may be modularly adapted to one or more grammar entity functions to create a machine learning model. One or more rules may be used to create each of the one or more grammar entity functions.
Opening claim text (preview).
1 . A method for construction of a machine learning model for structured inputs by a processor, comprising: arranging input data into one or more grammar entities identified using a domain knowledge; and modularly adapting each of the one or more grammar entities to one or more grammar entity functions to create a machine learning model. 2 . The method of claim 1 , further including applying the domain knowledge to identify the one or more grammar entities, wherein the one or more grammar entities are tokens, semantic expressions, subsets of tokens and semantic expressions, or a combination thereof 3 . The method of claim 1 , further including annotating the one or more grammar entities with selected property data. 4 . The method of claim 1 , wherein arranging input data into one or more grammar entities further includes formatting the input data into a selected arrangement of the one or more grammar entities. 5 . The method of claim 1 , further including statically mapping the one or more grammar entities to the one or more grammar entity functions. 6 . The method of claim 1 , further including: using a current state vector and an annotated property data as inputs for each of the one or more grammar entity functions; and generating a next state vector as output from the one or more grammar entity functions. 7 . The method of claim 1 , further including using one or more rules to create each of the one or more grammar entity functions. 8 . A system for construction of a machine learning model for structured inputs, comprising: one or more computers with executable instructions that when executed cause the system to: arrange input data into one or more grammar entities identified using a domain knowledge; and modularly adapt each of the one or more grammar entities to one or more grammar entity functions to create a machine learning model. 9 . The system of claim 8 , wherein the executable instructions further apply a domain knowledge to identify the one or more grammar entities, wherein the one or more grammar entities are tokens, semantic expressions, subsets of tokens and semantic expressions, or a combination thereof. 10 . The system of claim 8 , wherein the executable instructions further annotate the one or more grammar entities with selected property data. 11 . The system of claim 8 , wherein the executable instructions for arranging input data into one or more grammar entities further format the input data into a selected arrangement of the one or more grammar entities. 12 . The system of claim 8 , wherein the executable instructions further statically map the one or more grammar entities to the one or more grammar entity functions. 13 . The system of claim 8 , wherein the executable instructions further: use a current state vector and an annotated property input value as inputs for each of the one or more grammar entity functions; and generate a next state vector as output from the one or more grammar entity functions. 14 . The system of claim 8 , wherein the executable instructions further use one or more rules to create each of the one or more grammar entity functions. 15 . A computer program product for automated extraction and summarization of decision discussions of a communication by a processor, the computer program product comprising a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising: an executable portion that arranges input data into one or more grammar entities identified using a knowledge domain; and an executable portion that modularly adapts each of the one or more grammar entities to one or more grammar entity functions to create a machine learning model. 16 . The computer program product of claim 15 , further including an executable portion that applies a domain knowledge to identify the one or more grammar entities, wherein the one or more grammar entities are tokens, semantic expressions, subsets of tokens and semantic expressions, or a combination thereof. 17 . The computer program product of claim 15 , further including an executable portion that annotates the one or more grammar entities with selected property data. 18 . The computer program product of claim 15 , further including an executable portion that: formats the input data into a selected arrangement of the one or more grammar entities; and statically maps the one or more grammar entities to the one or more grammar entity functions. 19 . The computer program product of claim 15 , further including an executable portion that: uses a current state vector and an annotated property input value as inputs for each of the one or more grammar entity functions; and generates a next state vector as output from the one or more grammar entity functions. 20 . The computer program product of claim 15 , further including an executable portion that uses one or more rules to create each of the one or more grammar entity functions.
Backpropagation, e.g. using gradient descent · CPC title
Knowledge engineering; Knowledge acquisition · CPC title
for controlling access to devices or network resources · CPC title
for remote control or remote monitoring of applications · CPC title
comprising hierarchical management structures · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.