Language model for abstractive summarization

US11475210B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11475210-B2
Application numberUS-202117304081-A
CountryUS
Kind codeB2
Filing dateJun 14, 2021
Priority dateAug 31, 2020
Publication dateOct 18, 2022
Grant dateOct 18, 2022

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.

Methods, systems, and computer programs are presented for abstractive summarization of text by viewing sequence transduction as a language modeling problem. One method comprises an operation for training a machine-learning program to create a machine-learning model that estimates a word to be added to a running summary for the text being summarized. The method further comprises operations for detecting the text to be summarized, initializing the running summary, and performing a plurality of iterations. Each iteration comprises providing, to the machine-learning model, the source text and the running summary, and adding, using the machine-learning model, a new word to the running summary. Further, the method comprises an operation for storing, on a memory, the running summary as the summary of the text.

First claim

Opening claim text (preview).

The invention claimed is: 1. A computer-implemented method for creating a summary for text, the method comprising: training a machine-learning program to create a machine-learning model that estimates a word to be added to a running summary for the text being summarized; detecting the text to be summarized; initializing the running summary; performing a plurality of iterations, each iteration comprising: providing, to the machine-learning model, the text and the running summary; and adding, using the machine-learning model, a new word to the running summary; and storing, on a memory, the running summary as the summary of the text. 2. The method as recited in claim 1 , wherein the training is based on training data, the training data comprising a plurality of conversations and corresponding summaries. 3. The method as recited in claim 2 , wherein the machine-learning program is trained using maximum likelihood, wherein the training data comprises, for each conversation from the plurality of conversations, the conversation, a control token, and the summary of the conversation, the control token separating the conversation from the summary. 4. The method as recited in claim 1 , wherein the machine-learning program is a decoder-only deep-learning transformer. 5. The method as recited in claim 4 , wherein the decoder-only deep-learning transformer comprises four layers comprising: a masked self attention layer, a first norm layer, a feed forward layer, and a second norm layer. 6. The method as recited in claim 1 , wherein the text is embedded using data-driven subword encoding via Byte Pair Encoding (BPE). 7. The method as recited in claim 1 , wherein initializing the running summary comprises setting the running summary to be empty. 8. The method as recited in claim 1 , wherein the text is a conversation that comprises one or more turns. 9. The method as recited in claim 1 , wherein the text is a turn within a conversation. 10. The method as recited in claim 1 , further comprising: causing presentation of the summary on a display. 11. A system comprising: a memory comprising instructions; and one or more computer processors, wherein the instructions, when executed by the one or more computer processors, cause the system to perform operations comprising: training a machine-learning program to create a machine-learning model that estimates a word to be added to a running summary for text being summarized; detecting the text to be summarized; initializing the running summary; performing a plurality of iterations, each iteration comprising: providing, to the machine-learning model, the text and the running summary; and adding, using the machine-learning model, a new word to the running summary; and storing, on the memory, the running summary as a summary of the text. 12. The system as recited in claim 11 , wherein the training is based on training data, the training data comprising a plurality of conversations and corresponding summaries. 13. The system as recited in claim 12 , wherein the machine-learning program is trained using maximum likelihood, wherein the training data comprises, for each conversation from the plurality of conversations, the conversation, a control token, and the summary of the conversation, the control token separating the conversation from the summary. 14. The system as recited in claim 11 , wherein the machine-learning program is a decoder-only deep-learning transformer. 15. The system as recited in claim 14 , wherein the decoder-only deep-learning transformer comprises four layers comprising: a masked self attention layer, a first norm layer, a feed forward layer, and a second norm layer. 16. A tangible machine-readable storage medium including instructions that, when executed by a machine, cause the machine to perform operations comprising: training a machine-learning program to create a machine-learning model that estimates a word to be added to a running summary for text being summarized; detecting the text to be summarized; initializing the running summary; performing a plurality of iterations, each iteration comprising: providing, to the machine-learning model, the text and the running summary; and adding, by the machine-learning model, a new word to the running summary; and storing, on a memory, the running summary as a summary of the text. 17. The tangible machine-readable storage medium as recited in claim 16 , wherein the training is based on training data, the training data comprising a plurality of conversations and corresponding summaries. 18. The tangible machine-readable storage medium as recited in claim 17 , wherein the machine-learning program is trained using maximum likelihood, wherein the training data comprises, for each conversation from the plurality of conversations, the conversation, a control token, and the summary of the conversation, the control token separating the conversation from the summary. 19. The tangible machine-readable storage medium as recited in claim 16 , wherein the machine-learning program is a decoder-only deep-learning transformer. 20. The tangible machine-readable storage medium as recited in claim 19 , wherein the decoder-only deep-learning transformer comprises four layers comprising: a masked self attention layer, a first norm layer, a feed forward layer, and a second norm layer.

Assignees

Inventors

Classifications

  • Combinations of networks · CPC title

  • Lexical analysis, e.g. tokenisation or collocates · CPC title

  • G06F40/166Primary

    Editing, e.g. inserting or deleting · CPC title

  • G06F40/35Primary

    Discourse or dialogue representation · CPC title

  • Learning methods · 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 US11475210B2 cover?
Methods, systems, and computer programs are presented for abstractive summarization of text by viewing sequence transduction as a language modeling problem. One method comprises an operation for training a machine-learning program to create a machine-learning model that estimates a word to be added to a running summary for the text being summarized. The method further comprises operations for d…
Who is the assignee on this patent?
Twilio Inc
What technology area does this patent fall under?
Primary CPC classification G06F40/166. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Oct 18 2022 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 3 related publications on this page (citations in our corpus or others sharing the same primary CPC).