IP Library Granted Patent US 12,724,985
Granted Patent B2
US 12,724,985 · App. 17/937,606 · Granted Sep 1, 2026

Machine-learning based irrelevant sentence classifier

Inventors: Rajesh Sabapathy (Haryana, IN); Chirag Mittal (Haryana, IN); Gourav Awasthi (Haryana, IN); Aditya Teja Josyula (Collierville, TN)
Assignee: UnitedHealth Group Incorporated
G06F40/56G06F16/345G06F40/247G06F40/30G06F40/35G06N5/022G06F40/289
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,724,985
App. No.
17/937,606
Granted
Sep 1, 2026
Kind
B2
Abstract

There is a need for more effective, efficient, and accurate computer text comprehension. This need is addressed by applying unique text processing techniques to identify and remove irrelevant sentences from a narrative. The text processing techniques include a machine-learning based model that is trained using automatically generated training data that is tailored to a particular circumstance. A method for machine narrative comprehension includes receiving a narrative data object comprising one or more sentences; determining, using a machine-learning based irrelevant classifier model, a relevance of at least one of the one or more sentences; responsive to a determination that at least one sentence is irrelevant, generating a pertinent summary by removing the at least one sentence from the narrative; and generating, based at least in part on the pertinent summary, an output indicia data object for the narrative data object.

Claims (45)

1 . A computer-implemented method comprising:

receiving, by one or more processors, a narrative data object comprising one or more sentences;

inputting, by the one or more processors, a sentence, without contextual data from the narrative data object, of the one or more sentences to a binary classification model to determine a binary classification that identifies a general relevance of the sentence, wherein the binary classification comprises either a relevant classification or an irrelevant classification and the binary classification model is trained by:

(i) receiving (a) a training input comprising a historical narrative data object with a plurality of historical narrative sentences and (b) a training output comprising one or more summary sentences for the historical narrative data object,

(ii) determining a first labeled historical narrative sentence from the training input by assigning a relevant training label to a first historical narrative sentence of the plurality of historical narrative sentences in response to a first determination that a first maximum relevance score of a first plurality of relevance scores between the first historical narrative sentence and the one or more summary sentences exceeds a score threshold of zero,

(iii) determining a second labeled historical narrative sentence from the training input by assigning an irrelevant training label to a second historical narrative sentence of the plurality of historical narrative sentences in response to a second determination that a second maximum relevance score of a second plurality of relevance scores between the second historical narrative sentence and the one or more summary sentences fails to exceed the score threshold of zero, and

(iv) training the binary classification model using the first labeled historical narrative sentence and the second labeled historical narrative sentence from the training input;

responsive to a determination that the binary classification is the irrelevant classification, generating, by the one or more processors, a pertinent summary by removing the sentence from the narrative data object; and

outputting, by the one or more processors and based at least in part on the pertinent summary, an output indicia data object for the narrative data object.

2 . The computer-implemented method of claim 1 , wherein the output indicia data object comprises an intent prediction for the narrative data object, and wherein outputting, based at least in part on the pertinent summary, the output indicia data object for the narrative data object comprises:

generating, using a machine-learning based intent prediction model, the intent prediction based at least in part on the pertinent summary.

3 . The computer-implemented method of claim 1 , wherein the output indicia data object comprises a classification prediction for the narrative data object, and wherein outputting, based at least in part on the pertinent summary, the output indicia data object for the narrative data object comprises:

generating, using a machine-learning based prediction model, the classification prediction based at least in part on the pertinent summary.

4 . The computer-implemented method of claim 1 , wherein the output indicia data object comprises a paraphrased contextual summary for the narrative data object, and wherein outputting, based at least in part on the pertinent summary, the output indicia data object for the narrative data object comprises:

generating, using a machine-learning based paraphraser model, the paraphrased contextual summary based at least in part on the pertinent summary.

5 . The computer-implemented method of claim 1 , wherein the binary classification model is trained using supervisory training techniques.

6 . The computer-implemented method of claim 1 , wherein the first maximum relevance score comprises a first Recall-Oriented Understudy for Gisting Evaluation (ROUGE) score and the second maximum relevance score comprises a second ROUGE score.

7 . The computer-implemented method of claim 6 , wherein the relevant training label is determined responsive to the first ROUGE score exceeding the score threshold, and the irrelevant training label is determined responsive to the second ROUGE score failing to exceed the score threshold.

8 . The computer-implemented method of claim 1 , wherein the narrative data object comprises a multi-party interaction transcript corresponding to a multi-party interaction between at least two participants and the pertinent summary comprises a summary sentence of the multi-party interaction.

9 . A system comprising:

one or more processors; and

one or more memories storing processor-executable instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:

receiving a narrative data object comprising one or more sentences;

inputting a sentence, without contextual data from the narrative data object, of the one or more sentences to a binary classification model to determine a binary classification that identifies a general relevance of the sentence, wherein the binary classification comprises either a relevant classification or an irrelevant classification and the binary classification model is trained by:

(i) receiving (a) a training input comprising a historical narrative data object with a plurality of historical narrative sentences and (b) a training output comprising one or more summary sentences for the historical narrative data object,

(ii) determining a first labeled historical narrative sentence from the training input by assigning a relevant training label to a first historical narrative sentence of the plurality of historical narrative sentences in response to a first determination that a first maximum relevance score of a first plurality of relevance scores between the first historical narrative sentence and the one or more summary sentences exceeds a score threshold of zero,

(iii) determining a second labeled historical narrative sentence from the training input by assigning an irrelevant training label to a second historical narrative sentence of the plurality of historical narrative sentences in response to a second determination that a second maximum relevance score of a second plurality of relevance scores between the second historical narrative sentence and the one or more summary sentences fails to exceed the score threshold of zero, and

(iv) training the binary classification model using the first labeled historical narrative sentence and the second labeled historical narrative sentence from the training input;

responsive to a determination that the binary classification is the irrelevant classification, generating a pertinent summary by removing the sentence from the narrative data object; and

outputting, based at least in part on the pertinent summary, an output indicia data object for the narrative data object.

10 . The system of claim 9 , wherein the output indicia data object comprises an intent prediction for the narrative data object, and outputting, based at least in part on the pertinent summary, the output indicia data object for the narrative data object comprises:

generating, using a machine-learning based intent prediction model, the intent prediction for the narrative data object.

11 . The system of claim 10 , wherein the system comprises an automated robotic assistant.

12 . The system of claim 11 , wherein the narrative data object is an assistance query, and the operations further comprise:

generating a query resolution for the assistance query based at least in part on the intent prediction, and

initiating an action based at least in part on the query resolution.

13 . One or more non-transitory computer-readable media storing processor-executable instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:

receiving a narrative data object comprising one or more sentences;

inputting a sentence, without contextual data from the narrative data object, of the one or more sentences to a binary classification model to determine a binary classification that identifies a general relevance of the sentence, wherein the binary classification comprises either a relevant classification or an irrelevant classification and the binary classification model is trained by:

(i) receiving (a) a training input comprising a historical narrative data object with a plurality of historical narrative sentences and (b) a training output comprising one or more summary sentences for the historical narrative data object,

(ii) determining a first labeled historical narrative sentence from the training input by assigning a relevant training label to a first historical narrative sentence of the plurality of historical narrative sentences in response to a first determination that a first maximum relevance score of a first plurality of relevance scores between the first historical narrative sentence and the one or more summary sentences exceeds a score threshold of zero,

(iii) determining a second labeled historical narrative sentence from the training input by assigning an irrelevant training label to a second historical narrative sentence of the plurality of historical narrative sentences in response to a second determination that a second maximum relevance score of a second plurality of relevance scores between the second historical narrative sentence and the one or more summary sentences fails to exceed the score threshold of zero, and

(iv) training the binary classification model using the first labeled historical narrative sentence and the second labeled historical narrative sentence from the training input;

responsive to a determination that the binary classification is the irrelevant classification, generating a pertinent summary by removing the sentence from the narrative data object; and

outputting, based at least in part on the pertinent summary, an output indicia data object for the narrative data object.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 3, 2022
From: SABAPATHY, RAJESH; MITTAL, CHIRAG; AWASTHI, GOURAV; JOSYULA, ADITYA TEJA
To: UNITEDHEALTH GROUP INCORPORATED
Reel/Frame 061291/0216 →
Continuity (2)
Provisional Application 63366797 · Jun 22, 2022
Related Publication 20230419042A1 · Dec 28, 2023
References Cited (189)
US 6996414B2 · Vishwanathan et al. · 2006 [cited by applicant]
US 7318031B2 · Bantz et al. · 2008 [cited by applicant]
US 7702508B2 · Bennett · 2010 [cited by applicant]
US 7849147B2 · Rohall et al. · 2010 [cited by applicant]
US 7865560B2 · Rohall et al. · 2011 [cited by applicant]
US 7886012B2 · Bedi et al. · 2011 [cited by applicant]
US 8750489B2 · Park · 2014 [cited by applicant]
US 8825478B2 · Cox et al. · 2014 [cited by applicant]
US 8914452B2 · Boston et al. · 2014 [cited by applicant]
US 8983840B2 · Deshmukh et al. · 2015 [cited by applicant]
US 9116984B2 · Caldwell et al. · 2015 [cited by applicant]
US 9118759B2 · Krishnapuram et al. · 2015 [cited by applicant]
US 9300790B2 · Gainsboro et al. · 2016 [cited by applicant]
US 9348817B2 · Bohra et al. · 2016 [cited by applicant]
US 9413877B2 · Aldrich et al. · 2016 [cited by applicant]
US 9565301B2 · Lee et al. · 2017 [cited by applicant]
US 10009464B2 · Slovacek · 2018 [cited by applicant]
US 10051122B2 · Raanani et al. · 2018 [cited by applicant]
US 10204158B2 · Hay et al. · 2019 [cited by applicant]
US 10353904B2 · Enders et al. · 2019 [cited by applicant]
US 10354677B2 · Mohamed et al. · 2019 [cited by applicant]
US 10628474B2 · Modani et al. · 2020 [cited by applicant]
US 10637898B2 · Cohen et al. · 2020 [cited by applicant]
US 10659585B1 · Graham et al. · 2020 [cited by applicant]
US 10785185B2 · Vennam et al. · 2020 [cited by applicant]
US 10817787B1 · Zhang · 2020 [cited by examiner]
US 11018885B2 · Niekrasz · 2021 [cited by applicant]
US 11070673B1 · Lemus et al. · 2021 [cited by applicant]
US 11074284B2 · Cunico et al. · 2021 [cited by applicant]
US 11115353B1 · Crowley et al. · 2021 [cited by applicant]
US 11228681B1 · Rosenberg · 2022 [cited by applicant]
US 11232266B1 · Biswas et al. · 2022 [cited by applicant]
US 11262978B1 · Cohen et al. · 2022 [cited by applicant]
US 11272058B2 · Khafizov et al. · 2022 [cited by applicant]
US 11315569B1 · Talieh et al. · 2022 [cited by applicant]
US 11487797B2 · Shukla et al. · 2022 [cited by applicant]
US 11500951B1 · Shetty · 2022 [cited by applicant]
US 20090259642A1 · Cao et al. · 2009 [cited by applicant]
US 20100076978A1 · Cong et al. · 2010 [cited by applicant]
US 20100088299A1 · O'Sullivan et al. · 2010 [cited by applicant]
US 20100287162A1 · Shirwadkar · 2010 [cited by applicant]
US 20120209590A1 · Huerta et al. · 2012 [cited by applicant]
US 20130151533A1 · Udupa et al. · 2013 [cited by applicant]
US 20140032207A1 · Jin · 2014 [cited by examiner]
US 20140200928A1 · Watanabe et al. · 2014 [cited by applicant]
US 20150154956A1 · Brown · 2015 [cited by applicant]
US 20150193429A1 · Bohra et al. · 2015 [cited by applicant]
US 20160196492A1 · Johnson · 2016 [cited by examiner]
US 20160277577A1 · Yentis et al. · 2016 [cited by applicant]
US 20160350283A1 · Carus et al. · 2016 [cited by applicant]
US 20170054837A1 · Choi et al. · 2017 [cited by applicant]
US 20170286867A1 · Bell · 2017 [cited by examiner]
US 20180189267A1 · Takiel · 2018 [cited by examiner]
US 20180351887A1 · Efrati et al. · 2018 [cited by applicant]
US 20190042645A1 · Othmer et al. · 2019 [cited by applicant]
US 20190122142A1 · Brunn et al. · 2019 [cited by applicant]
US 20190297186A1 · Karani · 2019 [cited by applicant]
US 20190340296A1 · Cunico et al. · 2019 [cited by applicant]
US 20190373111A1 · Rute et al. · 2019 [cited by applicant]
US 20190386937A1 · Kim · 2019 [cited by applicant]
US 20200074312A1 · Liang et al. · 2020 [cited by applicant]
US 20200137224A1 · Rakshit et al. · 2020 [cited by applicant]
US 20200184155A1 · Galitsky · 2020 [cited by applicant]
US 20200193095A1 · Fan et al. · 2020 [cited by applicant]
US 20200210521A1 · Hutchins · 2020 [cited by examiner]
US 20200218722A1 · Mai · 2020 [cited by examiner]
US 20200227026A1 · Rajagopal et al. · 2020 [cited by applicant]
US 20200311738A1 · Gupta et al. · 2020 [cited by applicant]
US 20200311739A1 · Chopra et al. · 2020 [cited by applicant]
US 20200334419A1 · Raanani et al. · 2020 [cited by applicant]
US 20200401765A1 · Ran et al. · 2020 [cited by applicant]
US 20210034707A1 · Podgorny et al. · 2021 [cited by applicant]
US 20210117815A1 · Creed · 2021 [cited by examiner]
US 20210133251A1 · Tiwari et al. · 2021 [cited by applicant]
US 20210182326A1 · Romano et al. · 2021 [cited by applicant]
US 20210182491A1 · Chen et al. · 2021 [cited by applicant]
US 20210193135A1 · Gavai et al. · 2021 [cited by applicant]
US 20210248323A1 · Maheshwari · 2021 [cited by examiner]
US 20210248324A1 · Choudhary · 2021 [cited by examiner]
US 20210264897A1 · Churav et al. · 2021 [cited by applicant]
US 20210272040A1 · Johnson et al. · 2021 [cited by applicant]
US 20210303784A1 · Brdiczka et al. · 2021 [cited by applicant]
US 20210304747A1 · Haas et al. · 2021 [cited by applicant]
US 20210334469A1 · Feng · 2021 [cited by examiner]
US 20210342554A1 · Martin et al. · 2021 [cited by applicant]
US 20210357588A1 · Friedrich · 2021 [cited by examiner]
US 20210365773A1 · Subramanian · 2021 [cited by examiner]
US 20210375289A1 · Zhu et al. · 2021 [cited by applicant]
US 20210390127A1 · Fox et al. · 2021 [cited by applicant]
US 20220004971A1 · Kitamura · 2022 [cited by applicant]
US 20220030110A1 · Khafizov et al. · 2022 [cited by applicant]
US 20220067269A1 · de Oliveira et al. · 2022 [cited by applicant]
US 20220068279A1 · Embar et al. · 2022 [cited by applicant]
US 20220108086A1 · Wu et al. · 2022 [cited by applicant]
US 20220109585A1 · Asthana et al. · 2022 [cited by applicant]
US 20220138432A1 · Galitsky · 2022 [cited by applicant]
US 20220156464A1 · Norton · 2022 [cited by examiner]
US 20220189484A1 · Malladi et al. · 2022 [cited by applicant]
US 20220215052A1 · Chalana et al. · 2022 [cited by applicant]
US 20220277135A1 · Kryscinski et al. · 2022 [cited by applicant]
US 20220337443A1 · Sood et al. · 2022 [cited by applicant]
US 20220391595A1 · Shevelev et al. · 2022 [cited by applicant]
US 20220392434A1 · Asi et al. · 2022 [cited by applicant]
US 20220414338A1 · Cho et al. · 2022 [cited by applicant]
US 20230054726A1 · Roy et al. · 2023 [cited by applicant]
US 20230057760A1 · Galitsky · 2023 [cited by examiner]
US 20230122429A1 · Gunasekara et al. · 2023 [cited by applicant]
US 20230297778A1 · Can · 2023 [cited by examiner]
US 20230315993A1 · Nieborowski et al. · 2023 [cited by applicant]
US 20230334072A1 · Matsuzawa et al. · 2023 [cited by applicant]
US 20230359657A1 · Ganhotra et al. · 2023 [cited by applicant]
US 20230385557A1 · Sabapathy et al. · 2023 [cited by applicant]
US 20230419051A1 · Sabapathy et al. · 2023 [cited by applicant]
US 20250061277A1 · Zhu et al. · 2025 [cited by applicant]
EP 3839850A1 · 2021 [cited by applicant]
KR 1020220154592A · 2022 [cited by applicant]
Patel, Darshna, Saurabh Shah, and Hitesh Chhinkaniwala. “Fuzzy logic based multi document summarization with improved sentence scoring and redundancy removal technique.” Expert Systems with Applications 134 (2019): 167-… [cited by examiner]
Advisory Action (PTOL-303) Mailed on Jun. 27, 2024 for U.S. Appl. No. 17/405,555, 2 page(s). [cited by applicant]
Final Rejection Mailed on Apr. 15, 2024 for U.S. Appl. No. 17/405,555, 25 page(s). [cited by applicant]
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 17/122,607, dated Mar. 28, 2023, (8 pages), United States Patent and Trademark Office, US. [cited by applicant]
Yih, Wen-tau et al. “Multi-Document Summarization By Maximizing Informative Content-Words,” In IJCAI, Jan. 6, 2007, vol. 7, pp. 1776-1782. [Available online: https://www.aaai.org/Papers/IJCAI/2007/IJCAI07-287.pdf]. [cited by applicant]
Yuliska et al. “A Comparative Study of Deep Learning Approaches for Query-Focused Extractive Multi-Document Summarization,” 2019 IEEE 2nd International Conference on Information and Computer Technologies (ICICT), May 13… [cited by applicant]
Zhang, Xingxing et al. “HIBERT: Document Level Pre-training of Hierarchical Bidirectional Transformers for Document Summarization,” arXiv Preprint arXiv: 1905.06566v1 [cs.CL] May 16, 2019, (11 pages), available online a… [cited by applicant]
Zhong, Junmei et al. “Predicting Customer Call Intent By Analyzing Phone Call Transcripts Based On CNN For Multi-Class Classification,” Computer Science & Information Technology (CS & IT), pp. 9-20, arXiv preprint arXiv… [cited by applicant]
Zhou, Peng et al. “Attention-Based Bidirectional Long Short-Term Memory Networks for Relation Classification,” Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, pp. 207-212, Aug. 7… [cited by applicant]
Zweig, Geoffrey et al. “Automated Quality Monitoring For Call Centers Using Speech and NLP Technologies,” Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume, pp. 292-295, Jun. 2006. [cited by applicant]
“Summarize Text With The Extractive Summarization API,” Azure Cognitive Services|Microsoft Docs, Mar. 16, 2022, (6 pages) [Retrieved from the Internet May 4, 2022] <URL: https://docs.microsoft.com/en-us/azure/cognitive-… [cited by applicant]
“Supercharge Your Call Notes—Automated Call Recording and Transcription,” Jog.Ai, (6 pages), (online), [Retrieved from the Internet Nov. 15, 2021] <URL: https://jog.ai/>. [cited by applicant]
“Trustworthy and Cutting Edge AI,” The Blue, (12 pages), (online), [Retrieved from the Internet Nov. 12, 2021] <URL: https://theblue.ai/en/>. [cited by applicant]
Banerjee, Siddhartha et al. “Multi-Document Abstractive Summarization Using ILP Based Multi-Sentence Compression,” In Proceedings of the Twenty-Fourth International Joint Conference On Artificial Intelligence (IJCAI 201… [cited by applicant]
Baumel, Tal et al. “Query Focused Abstractive Summarization: Incorporating Query Relevance, Multi-Document Coverage, and Summary Length Constraints Into seq2seq Models,” arXiv Preprint, arXiv: 1801.07704v2, Jan. 25, 201… [cited by applicant]
Baumel, Tal et al. “Topic Concentration in Query-Focused Summarization,” Proceedings of the Thirtieth AAAI Conference On Artificial Intelligence (AAAI-16), pp. 2573-2579, Mar. 5, 2016. [cited by applicant]
Biswas, Pratik K. et al. “Extractive Summarization of Call Transcripts,” arXiv Preprint arXiv:2103.10599, Mar. 19, 2021, (10 pages). [cited by applicant]
Brin, Sergey. “The PageRank Citation Ranking: Bringing Order To The Web,” Proceedings of ASIS, vol. 98, Jan. 29, 1998, (17 pages). [cited by applicant]
Canhasi, Ercan. “Ercan Canhasi: Query Focused Multi Document Summarization Based on the Multi Facility Location Problem,” Computer Science On-Line Conference, Artificial Intelligence Trends In Intelligent Systems, CSOC … [cited by applicant]
Carbonell, Jaime et al. “The Use Of MMR, Diversity-Based Reranking For Reordering Documents and Producing Summaries,” In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development In I… [cited by applicant]
Chandramouli, Aravind et al. “Unsupervised Paradigm For Information Extraction From Transcripts Using BERT,” arXiv Preprint arXiv:2110.00949, Oct. 3, 2021, (11 pages). [cited by applicant]
Chen, Yun-Nung et al. “Intra-Speaker Topic Modeling For Improved Multi-Party Meeting Summarization With Integrated Random Walk,” In Proceedings of the 2012 Conference of the North American Chapter of the Association for… [cited by applicant]
Dang, Hoa Trang. “Overview of DUC 2005,” In Proceedings of the Document Understanding Conference, Oct. 9, 2005, vol. 2005, (12 pages). [Available online: https://www-nlpir.nist.gov/projects/duc/pubs/2005papers/OVERVIEW0… [cited by applicant]
Devlin, Jacob et al. “BERT: Pre-Training of Deep Bidirectional Transformers for Language Understanding,” Proceedings of NAACL-HLT 2019, Jun. 2, 2019, pp. 4171-4186. [cited by applicant]
Feigenblat, Guy et al. “Unsupervised Query-Focused Multi-Document Summarization Using The Cross Entropy Method,” SIGIR '17: Proceedings of the 40th International ACM SIGIR Conference On Research and Development In Infor… [cited by applicant]
Filatova, Elena et al. “Event-Based Extractive Summarization,” In Proceedings of ACL Workshop on Summarization, vol. 111, (2004), (8 pages). [cited by applicant]
Garg, Nikhil et al. “ClusterRank: A Graph Based Method For Meeting Summarization,” IDIAP Research Institute, Jun. 2009, (5 pages), Martigny, Switzerland. [cited by applicant]
Garg, Nikhil et al. “Clusterrank: A Graph Based Method For Meeting Summarization,” Proceedings of the 10th International Conference of the International Speech Communication Association (Interspeech 2009), pp. 1499-1502… [cited by applicant]
Gillick, Dan et al. “A Scalable Global Model For Summarization,” In Proceedings of the NAACL HLT Workshop On Integer Linear Programming For Natural Language Processing, Jun. 2009, pp. 10-18. [cited by applicant]
Goldstein, Jade et al. “Summarization: (1) Using MMR for Diversity-Based Reranking and (2) Evaluating Summaries,” Carnegie-Mellon University, Language Technologies Institute, Tipster III Summarization Project, Oct. 1, 1… [cited by applicant]
Gupta, Surabhi et al. “Measuring Importance and Query Relevance In Topic-Focused Multi-Document Summarization,” 45th Annual Meeting of the Association for Computational Linguistics Demo and Poster Sessions, Jun. 2007, p… [cited by applicant]
Hearst, Marti A. “Text-Tiling: A Quantitative Approach To Discourse Segmentation,” Association for Computational Linguistics 1993 (1993), pp. 1-10. [cited by applicant]
Higashinaka, Ryuichiro et al. “Improving HMM-Based Extractive Summarization For Multi-Domain Contact Center Dialogues,” In 2010 IEEE Spoken Language Technology Workshop, Dec. 12, 2010, pp. 61-66. DOI: 10.1109/SLT.2010.5… [cited by applicant]
Kothadiya, Aditya. “Why We Built A Note Taking Software—A Tool That Automatically Takes Notes And Analyzes Sales and Customer Calls,” Avoma Blog, (article, online), [Retrieved from the Internet Nov. 15, 2021] <https://w… [cited by applicant]
Li, Chen et al. “Using Supervised Bigram-Based ILP for Extractive Summarization,” In Proceedings of the 51st Annual Meeting of the Association For Computational Linguistics, Aug. 4, 2013, pp. 1004-1013, Sofia, Bulgaria. [cited by applicant]
Liang, Xinnian et al. “Unsupervised Keyphrase Extraction By Jointly Modeling Local and Global Context,” arXiv Preprint arXiv:2109.07293v1 [cs.CL], Sep. 15, 2021, (10 pages). [cited by applicant]
Liu, Yang et al. “Text Summarization With Pretrained Encoders,” arXiv Preprint arXiv:1908.08345v2 [cs.CL], Sep. 5, 2019, (11 pages). [cited by applicant]
McDonald, Ryan. “A Study Of Global Inference Algorithms In Multi-Document Summarization,” In European Conference on Information Retrieval, Apr. 2, 2007, (12 pages), Springer, Berlin, Heidelberg. [Available online: https… [cited by applicant]
Mehdad, Yashar et al. “Abstractive Meeting Summarization with Entailment and Fusion,” In Proceedings of the 14th European Workshop on Natural Language Generation, Aug. 2013, pp. 136-146. [Available online: https://www.a… [cited by applicant]
Mihalcea, Rada et al. “Textrank: Bringing Order Into Texts,” In Proceedings of the 2004 Conference On Empirical Methods In Natural Language Processing, Jul. 2004, pp. 404-411. [Available online: https://www.aclweb.org/a… [cited by applicant]
Murray, Gabriel et al. “Generating and Validating Abstracts Of Meeting Conversations: A User Study,” In Proceedings of the 6th International Natural Language Generation Conference (2010), (9 pages). [Available online: h… [cited by applicant]
Narayan, Shashi et al. “Stepwise Extractive Summarization and Planning With Structured Transformers,” arXiv Preprint arXiv:2010.02744v1 [cs.CL], Oct. 6, 2020, (17 pages). [cited by applicant]
Nenkova, Ani et al. “The Impact Of Frequency On Summarization,” Technical Report MSRTR-2005-101, Microsoft Research, Jan. 2005, (9 pages), Redmond, Washington. [Available online: http://citeseerx.ist.psu.edu/viewdoc/dow… [cited by applicant]
Oya, Tatsuro et al. “A Template-Based Abstractive Meeting Summarization: Leveraging Summary and Source Text Relationships,” In Proceedings of the 8th International Natural Language Generation Conference (INLG), Jun. 201… [cited by applicant]
Padmakumar, Vishakh et al. “Unsupervised Extractive Summarization Using Pointwise Mutual Information,” arXiv Preprint arXiv:2102.06272v2 [cs.CL], Mar. 22, 2021, (8 pages). [cited by applicant]
Radev, Dragomir R. et al. “Ranking Suspected Answers To Natural Language Questions Using Predictive Annotation,” ANLC '00: Proceedings of the Sixth Conference On Applied Natural Language Processing, Apr. 29, 2000, pp. 1… [cited by applicant]
Rahman, Nazreena et al. “A Method for Semantic Relatedness Based Query Focused Text Summarization,” In International Conference on Pattern Recognition and Machine Intelligence (PReMI 2017), LNCS 10597, Springer, Cham., … [cited by applicant]
Rudra, Koustav et al. “Summarizing Situational Tweets in Crisis Scenarios: An Extractive-Abstractive Approach,” IEEE Transactions On Computational Social Systems, Sep. 16, 2019, vol. 6, No. 5, pp. 981-993. [cited by applicant]
Rudra, Koustav. “Extracting and Summarizing Information From Microblogs During Disasters,” Ph.D. Thesis, Apr. 2018, (199 pages). [cited by applicant]
Shang, Guokan et al. “Unsupervised Abstractive Meeting Summarization with Multi-Sentence Compression and Budgeted Submodular Maximization,” In Proceedings of the 56th Annual Meeting Of The Association For Computational … [cited by applicant]
Singer, Eleanor et al. “Some Methodological Uses of Responses To Open Questions and Other Verbatim Comments In Quantitative Surveys,” Methods, Data, Analyses: A Journal For Quantitative Methods and Survey Methodology (m… [cited by applicant]
Steinberger, Josef et al. “Evaluation Measures for Text Summarization,” Computing and Informatics, vol. 28, Mar. 2, 2009, pp. 1001-1026. [cited by applicant]
Stepanov, E. et al. “Automatic Summarization of Call-Center Conversations,” In Conference: IEEE Automatic Speech Recognition and Understanding Workshop (ASRU 2015), (2 pages), Dec. 2015, available online: http://sisl.di… [cited by applicant]
Sun, Xu et al. “Feature-Frequency-Adaptive On-Line Training For Fast and Accurate Natural Language Processing,” Computational Linguistic, vol. 40, No. 3, Sep. 1, 2014, pp. 563-586. [cited by applicant]
Trione, Jeremy et al. “Beyond Utterance Extraction: Summary Recombination for Speech Summarization,” In Interspeech, pp. 680-684, Sep. 2016, available online: https://pageperso.lis-lab.fr/benoit.favre/papers/favre_is201… [cited by applicant]
Ushio, Asahi et al. “Back To The Basics: A Quantitative Analysis of Statistical and Graph-Based Term Weighting Schemes For Keyword Extraction,” arXiv Preprint arXiv:210408028v2 [cs.LG], Sep. 13, 2021, (15 pages), United… [cited by applicant]
Vanetik, Natalia et al. “Query-Based Summarization Using MDL Principle,” Proceedings of the MultiLing 2017 Workshop On Summarization and Summary Evaluation Across Source Types and Genres, Association for Computational L… [cited by applicant]
Vreeken, Jilles et al. “KRIMP: Mining Itemsets That Compress,” Data Mining and Knowledge Discovery, Jul. 2011, vol. 23, No. 1, pp. 169-214, DOI: 10.1007/s10618-010-0202-x. [cited by applicant]
Xu, Shusheng et al. “Unsupervised Extractive Summarization by Pre-Training Hierarchical Transformers,” arXiv Preprint arXiv:2010.08242v1 [cs.CL], Oct. 16, 2020, (15 pages), Shanghai, China. [cited by applicant]
Yang, Zichao et al. “Hierarchical Attention Networks for Document Classification,” Proceedings of the NAACL-HLT 2016, Association for Computational Linguistics, Jun. 12, 2016, pp. 1480-1489, San Diego, California. [cited by applicant]
NonFinal Office Action for U.S. Appl. No. 17/405,555, dated Nov. 17, 2023, (23 pages), United States Patent and Trademark Office, US. [cited by applicant]
Ma, Bing et al. “Extractive Dialogue Summarization Without Annotation Based On Distantly Supervised Machine Reading Comprehension In Customer Service,” In IEEE/ACM Transactions on Audio, Speech, and Language Processing,… [cited by applicant]
Notice of Allowance and Fee(s) Due, for U.S. Appl. No. 17/815,817, dated Mar. 30, 2023, (12 pages), United States Patent and Trademark Office, US. [cited by applicant]
NonFinal Office Action for U.S. Appl. No. 17/122,607, dated Nov. 8, 2022, (58 pages), United States Patent and Trademark Office, US. [cited by applicant]
Vanetik, Natalia et al. “An Unsupervised Constrained Optimization Approach To Compressive Summarization,” Information Sciences, vol. 509, Jan. 2020, pp. 22-35. [cited by applicant]
Non-Final Rejection Mailed on Aug. 14, 2024 for U.S. Appl. No. 17/405,555, 29 page(s). [cited by applicant]
Non-Final Rejection Mailed on Oct. 28, 2024 for U.S. Appl. No. 17/938,089, 6 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Sep. 11, 2024 for U.S. Appl. No. 17/937,616, 14 page(s). [cited by applicant]
Final Rejection Mailed on Jan. 21, 2025 for U.S. Appl. No. 17/405,555, 30 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Dec. 30, 2024 for U.S. Appl. No. 17/937,616, 2 page(s). [cited by applicant]
Advisory Action (PTOL-303) Mailed on Mar. 19, 2025 for U.S. Appl. No. 17/405,555, 2 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Apr. 28, 2025 for U.S. Appl. No. 17/405,555, 16 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Mar. 12, 2025 for U.S. Appl. No. 17/938,089, 10 page(s). [cited by applicant]