IP Library › Granted Patent US 12,619,824
Granted Patent B2
US 12,619,824 · App. 18/384,179 · Granted May 5, 2026

Method for generating summary and system therefor

Inventors: Sung Roh Yoon (Seoul, KR); Bong Kyu Hwang (Seoul, KR); Ju Dong Kim (Seoul, KR); Jae Woong Yun (Seoul, KR); Hyun Jae Lee (Seoul, KR); Hyun Jin Choi (Seoul, KR); Jong Yoon Song (Seoul, KR); Noh Il Park (Gwacheon-si, KR); Seong Ho Joe (Seoul, KR); Young June Gwon (Seoul, KR)
Assignees: SAMSUNG SDS CO., LTD.; SEOUL NATIONAL UNIVERSITY R&DB FOUNDATION
G06F40/295G06F40/284
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,619,824
App. No.
18/384,179
Granted
May 5, 2026
Kind
B2
Abstract

Provided are a method for generating a summary and a system therefor. The method according to some embodiments may include calculating a likelihood loss for a summary model using a first text sample and a first summary sentence corresponding to the first text sample, calculating an unlikelihood loss for the summary model using a second text sample and the first summary sentence, the second text sample being a negative sample generated from the first text sample, and updating the summary model based on the likelihood loss and the unlikelihood loss.

Claims (61)

1 . A method for generating a summary, the method being performed by at least one processor and comprising:

calculating a likelihood loss for a summary model using a first text sample and a first summary sentence corresponding to the first text sample, wherein the summary model is a neural network-based model;

calculating a first unlikelihood loss for the summary model using a second text sample and the first summary sentence and calculating a second unlikelihood loss for the summary model using a third text sample and the first summary sentence, the second text sample and the third text sample being negative samples generated from the first text sample in different manners, and the third text sample being generated by removing a portion associated with a main keyword from the first text sample;

updating weight parameters of the summary model based on the likelihood loss, the first unlikelihood loss, and the second unlikelihood loss, in a manner such that a likelihood that the first summary sentence is generated from the first text sample increases, a likelihood that the first summary sentence is generated from the second text sample decreases, and a likelihood that the first summary sentence is generated from the third text sample decreases;

updating the summary model to include the updated weight parameters; and

generating a summary of an input text sample using the updated summary model.

2 . The method of claim 1 , wherein the first or second unlikelihood loss is calculated based on a difference between a summary sentence of the second or third text sample generated through the summary model and the first summary sentence, and is calculated as a smaller value as the difference increases.

3 . The method of claim 1 , wherein the calculating of the first unlikelihood loss comprises:

extracting the main keyword from the first summary sentence; and

generating the second text sample by masking the a portion associated with the main keyword in the first text sample.

4 . The method of claim 3 , wherein the main keyword is extracted by performing part-of-speech analysis or named entity recognition on the first summary sentence.

5 . The method of claim 3 , wherein the main keyword comprises a keyword of which a part of speech is a numeral or a proper noun.

6 . The method of claim 3 , wherein the portion associated with the main keyword is a token group including a matching token for the main keyword and adjacent tokens of the matching token, a sentence including the matching token, or a paragraph including the matching token.

7 . The method of claim 3 , wherein the generating of the third text sample comprises:

extracting a plurality of sentences from a text sample different from the first text sample; and

generating the third text sample by inserting the plurality of sentences into the first text sample from which the portion associated with the main keyword is removed such that an order of the plurality of sentences is maintained.

8 . The method of claim 1 , wherein the likelihood loss is a first likelihood loss,

the second text sample is generated by replacing a portion of the first text sample with a mask token,

the method further comprises:

generating a fourth text sample by adding the mask token to the first text sample; and

calculating a second likelihood loss for the summary model using the fourth text sample and the first summary sentence, and

the weight parameters of the summary model are updated based on the first likelihood loss, the second likelihood loss, the first unlikelihood loss, and the second unlikelihood loss.

9 . The method of claim 1 , wherein the updating of the weight parameters of the summary model comprises:

summing up the likelihood loss, the first unlikelihood loss, and the second unlikelihood loss based on pre-assigned weights; and

updating the weight parameters of the summary model based on the summed loss, and

a weight assigned to the likelihood loss is higher than a weight assigned to the first or second unlikelihood loss.

10 . The method of claim 1 , wherein the summary model is a model predicting tokens constituting a summary sentence of the input text sample in an auto-regressive manner, and

the method further comprises:

obtaining a text sample for evaluation and a summary sentence for evaluation, the text sample for evaluation being at least partially different from a text sample corresponding to the summary sentence for evaluation;

calculating confidence scores for tokens constituting the summary sentence for evaluation by inputting the text sample for evaluation to the summary model; and

evaluating performance of the summary model based on the calculated confidence scores.

11 . The method of claim 1 , wherein the summary model is a model predicting tokens constituting a summary sentence of an input text sample in an auto-regressive manner, and

the method further comprises:

obtaining a text sample for evaluation and a summary sentence for evaluation;

predicting a plurality of tokens by inputting the text sample for evaluation to the summary model and performing decoding through a teacher forcing technique, the teacher forcing technique being performed in a manner of providing the summary sentence for evaluation to the summary model; and

evaluating performance of the summary model by comparing a first saliency of the summary model for the input text sample for evaluation appearing in a process of predicting the plurality of tokens and a second saliency for the provided summary sentence for evaluation with each other.

12 . The method of claim 11 , wherein the first saliency is calculated based on gradient values for tokens of the text sample for evaluation obtained by back-propagating prediction losses of the plurality of tokens.

13 . The method of claim 1 , wherein the summary model is a model predicting tokens constituting a summary sentence of the input text sample in an auto-regressive manner, and

the method further comprises:

obtaining a text sample for evaluation and a summary sentence for evaluation, the text sample for evaluation being at least partially different from a text sample corresponding to the summary sentence for evaluation;

calculating a confidence score for each token by inputting the text sample for evaluation to the summary model and performing decoding through a teacher forcing technique, the teacher forcing technique being performed in a manner of providing the summary sentence for evaluation to the summary model; and

evaluating performance of the summary model based on an entropy value for the confidence score for each token.

14 . The method of claim 13 , wherein the entropy value is a first entropy value, and

the evaluating of the performance of the summary model comprises:

calculating a second entropy value for the text sample corresponding to the summary sentence for evaluation by inputting the text sample corresponding to the summary sentence for evaluation into the summary model and performing decoding through the teacher forcing technique; and

evaluating the performance of the summary model based on a difference between the first entropy value and the second entropy value.

15 . A system for generating a summary, comprising:

one or more processors; and

a memory configured to store one or more instructions,

wherein the one or more processors, by executing the stored one or more instructions, perform:

calculating a likelihood loss for a summary model using a first text sample and a first summary sentence corresponding to the first text sample, wherein the summary model is a neural network-based model;

calculating a first unlikelihood loss for the summary model using a second text sample and the first summary sentence and calculating a second unlikelihood loss for the summary model using a third text sample and the first summary sentence, the second text sample and the third text sample being negative samples generated from the first text sample in different manners, and the third text sample being generated by removing a portion associated with a main keyword from the first text sample;

updating weight parameters of the summary model based on the likelihood loss, the first unlikelihood loss, and the second unlikelihood loss, in a manner such that a likelihood that the first summary sentence is generated from the first text sample increases, a likelihood that the first summary sentence is generated from the second text sample decreases, and a likelihood that the first summary sentence is generated from the third text sample decreases;

updating the summary model using the updated weight parameters; and

generating a summary of an input text sample using the updated summary model.

16 . A non-transitory computer-readable recording medium storing a computer program, which, when executed by at least one processor, causes the at least one processor to perform:

calculating a likelihood loss for a summary model using a first text sample and a first summary sentence corresponding to the first text sample, wherein the summary model is a neural network-based model;

calculating a first unlikelihood loss for the summary model using a second text sample and the first summary sentence and calculating a second unlikelihood loss for the summary model using a third text sample and the first summary sentence, the second text sample and the third text sample being negative samples generated from the first text sample in different manners, and the third text sample being generated by removing a portion associated with a main keyword from the first text sample;

updating weight parameters the summary model based on the likelihood loss, the first unlikelihood loss, and the second unlikelihood loss, in a manner such that a likelihood that the first summary sentence is generated from the first text sample increases, a likelihood that the first summary sentence is generated from the second text sample decreases, and a likelihood that the first summary sentence is generated from the third text sample decreases;

updating the summary model to include the updated weight parameters; and

generating a summary of an input text sample using the updated summary model.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 26, 2023
From: YOON, SUNG ROH; HWANG, BONG KYU; KIM, JU DONG; YUN, JAE WOONG; LEE, HYUN JAE; CHOI, HYUN JIN; SONG, JONG YOON; PARK, NOH IL; JOE, SEONG HO; GWON, YOUNG JUNE
To: SAMSUNG SDS CO., LTD.; SEOUL NATIONAL UNIVERSITY R&DB FOUNDATION
Reel/Frame 065359/0529 →
Priority Claims (1)
KR 10-2022-0139083 · Oct 28, 2022 · national
Continuity (1)
Related Publication 20240143927A1 · May 2, 2024
References Cited (19)
US 20220004712A1 · Bahuleyan et al. · 2022 [cited by applicant]
US 20230004589A1 · Wu · 2023 [cited by examiner]
KR 1020220043505A · 2022 [cited by applicant]
KR 1020220079163A · 2022 [cited by applicant]
Saito et al., “Abstractive Summarization with Combination of Pre-trained Sequence-to-Sequence and Saliency Models” (Year: 2020). [cited by examiner]
Bahuleyan et al., “Diverse Keyphrase Generation with Neural Unlikelihood Training” (Year: 2020). [cited by examiner]
Li et al., “Don't Say That! Making Inconsistent Dialogue Unlikely with Unlikelihood Training” (Year: 2020). [cited by examiner]
Cao and Wang, “CLIFF: Contrastive Learning for Improving Faithfulness and Factuality in Abstractive Summarization” (Year: 2021). [cited by examiner]
Lee et al., “Contrastive Learning with Adversarial Perturbations for Conditional Text Generation” (Year: 2021). [cited by examiner]
Zheng et al., “Enhanced Seq2Seq Autoencoder via Contrastive Learning for Abstractive Text Summarization” (Year: 2021). [cited by examiner]
Liu et al., “Topic-Aware Contrastive Learning for Abstractive Dialogue Summarization” (Year: 2021). [cited by examiner]
Xie et al., “Factual Consistency Evaluation for Text Summarization via Counterfactual Estimation” 2022 (Year: 2021). [cited by examiner]
King et al., “Don't Say What You Don't Know: Improving the Consistency of Abstractive Summarization by Constraining Beam Search” (Year: 2022). [cited by examiner]
Liu et al. “Summarizing Dialogues with Negative Cues” (Year: 2022). [cited by examiner]
Lee et al., “Masked Summarization to Generate Factually Inconsistent Summaries for Improved Factual Consistency Checking” (Year: 2022). [cited by examiner]
Wen et al., “PRIMERA: Pyramid-based Masked Sentence Pre-training for Multi-document Summarization” (Year: 2022). [cited by examiner]
West et al., “Probing Factually Grounded Content Transfer with Factual Ablation” (Year: 2022). [cited by examiner]
Cao, Shuyang et al., “CLIFF: Contrastive Learning for Improving Faithfulness and Factuality in Abstractive Summarization”, arXiv:2109.09209v1 [cs.CL], Sep. 19, 2021. (17 pages total). [cited by applicant]
Nair, Pranav Ajit et al., “On Reducing Repetition in Abstractive Summarization”, Proceedings of the Student Research Workshop associated with RANLP-2021, pp. 126-134, held online, Sep. 1-3, 2021. [cited by applicant]