IP Library Granted Patent US 12,197,865
Granted Patent B2
US 12,197,865 · App. 17/554,143 · Granted Jan 14, 2025

Learning framework for processing communication session transcripts

Inventors: Akshay Aravindakshan Thoniparambil (Bangalore, IN); Manish Agarwal (Bangalore, IN); Gaurav Kedia (Bangalore, IN); Aashish Bansiwala (Ganganagar, IN); Deepak Ramamohan (Mysuru, IN); Sourav Choudhary (Samastipur, IN)
Assignee: Capital One Services, LLC
G06F40/289G06F16/3344G06F16/355G06F40/35
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,197,865
App. No.
17/554,143
Filed
Dec 17, 2021
Granted
Jan 14, 2025
Kind
B2
Art Unit
2692
USPC
704/9
Abstract

Learning frameworks for processing text transcripts may include receiving, by an application, a query comprising a topic. A topic model may determine a plurality of subtopics based on the topic. The application may receive, from a database based on the topic and plurality of subtopics, a plurality of text transcripts. A sentiment model may compute, for each text transcript, a respective sentiment score based on a text of the respective text transcript. The application may determine, for each text transcript, a duration of a communication session associated with the respective text transcript. The application may compute, for each text transcript, a total score based on the sentiment score and the duration of the respective text transcript. The application may return, as responsive to the query, a subset of the plurality of text transcripts having a total score that exceeds a threshold.

Claims (73)

1. A method, comprising:

receiving, by an application executing on a processor, a query comprising a topic;

determining, by a topic model executing on the processor, a plurality of subtopics based on the topic;

receiving, by the application from a database based on the topic and plurality of subtopics, a plurality of text transcripts, each transcript associated with a respective communication session;

computing, by a sentiment model executing on the processor for each text transcript, a respective sentiment score based on a text of the respective text transcript;

determining, by the application for each text transcript, a duration of the communication session associated with the respective text transcript;

computing, by the application for each text transcript, a total score based on the sentiment score and the duration of the respective communication session;

returning, by the application as responsive to the query, a subset of the plurality of text transcripts having a total score that exceeds a threshold;

extracting, by a key phrase model, a plurality of key phrases from each text transcript of the subset of the plurality of text transcripts;

determining, by the application and based on content of the plurality of key phrases, a system error associated with the application; and

transmitting, by the application, a notification including the system error to a computing device to address the system error.

2. The method of claim 1 , further comprising:

determining, by the application for each communication session, a first amount of time a customer engaged in conversation with an agent;

computing, by the application for each text transcript, a first time score based on the first amount of time;

determining, by the application for each communication session, a second amount of time a customer was on hold; and

computing, by the application for each text transcript, a second time score based on the second amount of time, wherein the total score is further based on the first and second time scores.

3. The method of claim 2 , wherein computing the total score comprises computing a sum of the sentiment score, the first time score, and the second time score.

4. The method of claim 1 , further comprising:

outputting, by the application, the plurality of key phrases for display.

5. The method of claim 1 ,

wherein the notification includes the topic determined from the topic model and one or more portions of the plurality of text transcripts that are associated with the topics.

6. The method of claim 4 , wherein the key phrase model is trained based on a plurality of training transcripts using unsupervised training, wherein the topic model is based on the key phrase model using semi-supervised training.

7. The method of claim 1 , wherein determining the plurality of subtopics is based on clustering the topic into a cluster and identifying the plurality of subtopics in the cluster; and

wherein clustering the topic is performed using an unsupervised training algorithm.

8. A non-transitory computer-readable storage medium, the computer-readable storage medium including instructions that when executed by a processor, cause the processor to:

receive, by an application, a query comprising a topic;

determine, by a topic model, a plurality of subtopics based on the topic;

receive, by the application from a database based on the topic and plurality of subtopics, a plurality of text transcripts, each transcript associated with a respective communication session;

compute, by a sentiment model for each text transcript, a respective sentiment score based on a text of the respective text transcript;

determine, by the application for each text transcript, a duration of the communication session associated with the respective text transcript;

compute, by the application for each text transcript, a total score based on the sentiment score and the duration of the respective text transcript;

return, by the application as responsive to the query, a subset of the plurality of text transcripts having a total score that exceeds a threshold;

extract, by a key phrase model, a plurality of key phrases from each text transcript of the subset of the plurality of text transcripts;

determine, by the application and based on content of the plurality of key phrases, a system error associated with the application; and

transmit, by the application, a notification including the system error to a computing device to address the system error.

9. The computer-readable storage medium of claim 8 , wherein the instructions further cause the processor to:

determine, by the application for each communication session, a first amount of time a customer engaged in conversation with an agent;

compute, by the application for each text transcript, a first time score based on the first amount of time;

determine, by the application for each communication session, a second amount of time a customer was on hold; and

compute, by the application for each text transcript, a second time score based on the second amount of time, wherein the total score is further based on the first and second time scores.

10. The computer-readable storage medium of claim 9 , wherein compute the total score comprises computing a sum of the sentiment score, the first time score, and the second time score.

11. The computer-readable storage medium of claim 8 , wherein the instructions further configure the computer to:

output, by the application, the plurality of key phrases for display.

12. The computer-readable storage medium of claim 8 ,

wherein the notification includes the topic determined from the topic model and one or more portions of the plurality of text transcripts that are associated with the topics.

13. The computer-readable storage medium of claim 11 , wherein the key phrase model is trained based on a plurality of training transcripts use unsupervised training, wherein the topic model is based on the key phrase model using semi-supervised training.

14. The computer-readable storage medium of claim 8 , wherein determining the plurality of subtopics is based on clustering the topic into a cluster and identifying the plurality of subtopics in the cluster; and

wherein clustering the topic is performed using a dbscan clustering algorithm.

15. A computing apparatus comprising:

a processor; and

a memory storing instructions that, when executed by the processor, cause the processor to:

receive, by an application, a query comprising a topic;

determine, by a topic model, a plurality of subtopics based on the topic;

receive, by the application from a database based on the topic and plurality of subtopics, a plurality of text transcripts, each transcript associated with a respective communication session;

compute, by a sentiment model for each text transcript, a respective sentiment score based on a text of the respective text transcript;

determine, by the application for each text transcript, a duration of the communication session associated with the respective text transcript;

compute, by the application for each text transcript, a total score based on the sentiment score and the duration of the respective text transcript;

return, by the application as responsive to the query, a subset of the plurality of text transcripts having a total score that exceeds a threshold;

extract, by a key phrase model, a plurality of key phrases from each text transcript of the subset of the plurality of text transcripts;

determine, by the application and based on content of the plurality of key phrases, a system error associated with the application; and

transmit, by the application, a notification including the system error to a computing device to address the system error.

16. The computing apparatus of claim 15 , wherein the instructions further cause the processor to:

determine, by the application for each communication session, a first amount of time a customer engaged in conversation with an agent;

compute, by the application for each text transcript, a first time score based on the first amount of time;

determine, by the application for each communication session, a second amount of time a customer was on hold; and

compute, by the application for each text transcript, a second time score based on the second amount of time, wherein the total score is further based on the first and second time scores.

17. The computing apparatus of claim 16 , wherein compute the total score comprises computing a sum of the sentiment score, the first time score, and the second time score.

18. The computing apparatus of claim 15 , wherein the instructions further cause the processor to:

output, by the application, the plurality of key phrases for display.

19. The computing apparatus of claim 15 ,

wherein the notification includes the topic determined from the topic model and one or more portions of the plurality of text transcripts that are associated with the topics.

20. The computing apparatus of claim 15 , wherein determining the plurality of subtopics is based on clustering the topic into a cluster and identifying the plurality of subtopics in the cluster; and

wherein clustering the topic is performed using an unsupervised training algorithm.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 20, 2021
From: THONIPARAMBIL, AKSHAY ARAVINDAKSHAN; AGARWAL, MANISH; KEDIA, GAURAV; BANSIWALA, AASHISH; RAMAMOHAN, DEEPAK; CHOUDHARY, SOURAV
To: CAPITAL ONE SERVICES, LLC
Reel/Frame 058427/0537 →
Continuity (1)
Related Publication 20230196020A1 · Jun 22, 2023
References Cited (35)
US 7606714B2 · Williams · 2009 [cited by applicant]
US 9477752B1 · Romano · 2016 [cited by applicant]
US 9767165B1 · Tacchi · 2017 [cited by applicant]
US 9779081B2 · Simard et al. · 2017 [cited by applicant]
US 9922025B2 · Cross et al. · 2018 [cited by applicant]
US 10754883B1 · Kannu · 2020 [cited by applicant]
US 11023675B1 · Neervannan · 2021 [cited by examiner]
US 11227183B1 · Connors et al. · 2022 [cited by applicant]
US 11294974B1 · Shukla et al. · 2022 [cited by applicant]
US 20040210443A1 · Kuhn · 2004 [cited by applicant]
US 20120259801A1 · Ji · 2012 [cited by applicant]
US 20130346424A1 · Zhang et al. · 2013 [cited by applicant]
US 20170353605A1 · Dumaine · 2017 [cited by examiner]
US 20180121539A1 · Ciulla · 2018 [cited by applicant]
US 20190139551A1 · Steelberg · 2019 [cited by applicant]
US 20190163817A1 · Milenova · 2019 [cited by applicant]
US 20200302011A1 · Mishra · 2020 [cited by examiner]
US 20200410012A1 · Moon · 2020 [cited by applicant]
US 20210089971A1 · Grabau et al. · 2021 [cited by applicant]
US 20210097472A1 · Inamdar et al. · 2021 [cited by applicant]
US 20210157990A1 · Lima et al. · 2021 [cited by applicant]
US 20210158234A1 · Sivasubramanian · 2021 [cited by applicant]
US 20220230116A1 · Dubey · 2022 [cited by examiner]
US 20220293107A1 · Leaman · 2022 [cited by applicant]
US 20220318485A1 · Narayanan · 2022 [cited by examiner]
US 20220365955A1 · Ramamohan · 2022 [cited by applicant]
Devlin et al., “BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding”, Cornell University [online], Submitted Oct. 11, 2018, 16 pages. [cited by applicant]
Author Unknown, “Okapi BM25”, Wikipedia the Free Encyclopedia [online], Retrieved from the Internet URL: <https://en.wikipedia.org/wiki/Okapi_BM25>, Retrieved on May 12, 2021, 4 pages. [cited by applicant]
Pagliardini et al., “Unsupervised Learning of Sentence Embeddings using Compositional n-Gram Features”, NAACL 2018—Conference of the North American Chapter of the Association for Computational Linguistics, pp. 528-540. [cited by applicant]
Author Unknown, “DBSCAN”, Wikipedia [online], Retrieved from Internet URL:<https://en.wikipedia.org/wiki/DBSCAN>, Retrieved on Dec. 14, 2021, 8 pages. [cited by applicant]
Author Unknown, “Sentiment analysis”, Wikipedia [online], Retrieved from Internet URL:<https://en.wikipedia.org/wiki/Sentiment_analysis', Retrieved on Dec. 14, 2021, 16 pages. [cited by applicant]
Author Unknown, “How to Search Chat History”, Published Jun. 3, 2021, Retrieved from Internet URL :<https://help.livehelpnow.net/1/kb/article/1584/how-to-search-chat-history>, Retrieved on Dec. 14, 2021, 2 pages. [cited by applicant]
Author Unkown, “Transcripts—Accessing transcripts”, Olark [online], Retrieved from Internet URL:<https://www.olark.com/help/view-transcripts/>, Retrieved on Dec. 14, 2021, 8 pages. [cited by applicant]
Gildea et al., “Topic-based Language Models using EM”, Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999), 2167-2170, doi: 10.21437/Eurospeech. 1999-479. [cited by applicant]
Levine et al., “PMI-Masking: Principled Masking of Correlated Spans”, arXiv:2010.01825v1 [cs.LG] Oct. 5, 2020 https://doi.org/10.48550/arXiv.2010.01825. [cited by applicant]
Cited By (1)
US 12,675,519