IP Library › Granted Patent US 12,271,706
Granted Patent B2
US 12,271,706 · App. 18/091,611 · Granted Apr 8, 2025

System and method for incremental estimation of interlocutor intents and goals in turn-based electronic conversational flow

Inventor: Pedro Vale Lima (Oporto, PT)
Assignee: DISCOURSE.AI, INC.
G06F40/35G06F40/289G06F40/58
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,271,706
App. No.
18/091,611
Granted
Apr 8, 2025
Kind
B2
Abstract

A system and method implemented on a computing device for incrementally discovering new intents and goals by collecting data from a first corpus of a plurality of newer digitally-recorded conversations, performing dimensionality reduction to prepare the extracted conversations for clustering, clustering the prepared conversations, identifying new intent and/or goal labels using a trained Artificial Intelligence (AI) engine, applying a model-based filter to remove new labels which overlap already-known labels in the first corpus, and outputting the newly-discovered labels in association with the extracted conversations into a computer-readable file.

Claims (57)

1. A method implemented by a computing device for incrementally discovering an intent or a goal or both an intent and a goal of a party in an interlocutor digital conversation, the method comprising:

collecting data, by a computer system, from a first corpus of a plurality of digitally-recorded conversations by extracting conversations with a creation date newer than a threshold date;

performing dimensionality reduction, by a computer system, to prepare the extracted conversations for clustering;

clustering, by the computer system, the prepared extracted conversations;

subsequent to the clustering, identifying, by a computer system, one or more new intent labels or a new goal label or a combination of new intent labels and new goal labels using a trained Artificial Intelligence (AI) engine;

applying a model-based filter, by a computer system, to the one or more new intent labels or the new goal label or the combination of new intent labels and new goal labels to remove new labels which overlap already-known labels in the first corpus; and

outputting, by a computer system, the new labels in association with the extracted conversations into a computer-readable file.

2. The method as set forth in claim 1 wherein the collecting data comprises retrieving a current taxonomy.

3. The method as set forth in claim 1 further comprising:

counting, by a computer system, a number of extracted conversations; and

responsive to the number of extracted conversations falling below a threshold count, determining, by a computer system, the method without performing remaining steps.

4. The method as set forth in claim 1 further comprising storing, by a computer system, the extracted conversations into a second corpus.

5. The method as set forth in claim 4 further comprising:

extracting, by a computer system, from the first corpus one or more conversations which have associated model scores below a low score threshold; and

merging, by a computer system, one or more extracted low model score conversations into the second corpus.

6. The method as set forth in claim 1 wherein the dimensionality reduction comprises a Uniform Manifold Approximation and Projection process.

7. The method as set forth in claim 1 wherein the applying of the model-based filter comprises selecting extracted conversation clusters according to a model score threshold.

8. The method as set forth in claim 1 wherein the applying of the model-based filter comprises selecting extracted conversation clusters according to an entropy threshold.

9. A computer program product for incrementally discovering an intent or a goal or both an intent and a goal of a party in an interlocutor digital conversation, the computer program product comprising:

one or more tangible, non-transitory computer-readable memory devices which are not propagating signals per se; and

one or more program instructions encoded by the one or more tangible, non-transitory computer-readable memory devices configured to cause one or more computer processors to perform steps comprising:

collecting data from a first corpus of a plurality of digitally-recorded conversations by extracting conversations with a creation date newer than a threshold date;

performing dimensionality reduction to prepare the extracted conversations for clustering;

clustering the prepared extracted conversations;

subsequent to the clustering, identifying one or more new intent labels or a new goal label or a combination of new intent labels and new goal labels using a trained Artificial Intelligence (AI) engine;

applying a model-based filter to the one or more new intent labels or the new goal label or the combination of new intent labels and new goal labels to remove new labels which overlap already-known labels in the first corpus; and

outputting the new labels in association with the extracted conversations into a computer-readable file.

10. The computer program product as set forth in claim 9 wherein the collecting data comprises retrieving a current taxonomy.

11. The computer program product as set forth in claim 9 wherein the one or more program instructions further comprise one or more program instructions configured to cause one or more computer processors to perform the steps comprising:

counting a number of extracted conversations; and

responsive to the number of extracted conversations falling below a threshold count, determining a method without performing remaining steps.

12. The computer program product as set forth in claim 9 wherein the one or more program instructions further comprise one or more program instructions configured to cause one or more computer processors to perform the step comprising storing the extracted conversations into a second corpus.

13. The computer program product as set forth in claim 12 wherein the one or more program instructions further comprise one or more program instructions configured to cause one or more computer processors to perform the steps comprising:

extracting from the first corpus one or more conversations which have associated model scores below a low score threshold; and

merging one or more extracted low model score conversations into the second corpus.

14. The computer program product as set forth in claim 9 wherein the dimensionality reduction comprises a Uniform Manifold Approximation and Projection process.

15. The computer program product as set forth in claim 9 wherein the applying of the model-based filter comprises selecting extracted conversation clusters according to a model score threshold.

16. The computer program product as set forth in claim 9 wherein the applying of the model-based filter comprises selecting extracted conversation clusters according to an entropy threshold.

17. A system for incrementally discovering an intent or a goal or both an intent and a goal of a party in an interlocutor digital conversation, the system comprising:

one or more computer processors;

one or more tangible, non-transitory computer-readable memory devices which are not propagating signals per se; and

one or more program instructions encoded by the one or more tangible, non-transitory computer-readable memory devices configured to cause the one or more computer processors to perform steps comprising:

collecting data from a first corpus of a plurality of digitally-recorded conversations by extracting conversations with a creation date newer than a threshold date;

performing dimensionality reduction to prepare the extracted conversations for clustering;

clustering the prepared extracted conversations;

subsequent to the clustering, identifying one or more new intent labels or a new goal label or a combination of new intent labels and new goal labels using a trained Artificial Intelligence (AI) engine;

applying a model-based filter to the one or more new intent labels or the new goal label or the combination of new intent labels and new goal labels to remove new labels which overlap already-known labels in the first corpus; and

outputting the new labels in association with the extracted conversations into a computer-readable file.

18. The system as set forth in claim 17 wherein the collecting data comprises retrieving a current taxonomy.

19. The system as set forth in claim 17 wherein the one or more program instructions further comprise one or more program instructions configured to cause one or more computer processors to perform the steps comprising:

counting a number of extracted conversations; and

responsive to the number of extracted conversations falling below a threshold count, determining a method without performing remaining steps.

20. The system as set forth in claim 17 wherein the one or more program instructions further comprise one or more program instructions configured to cause one or more computer processors to perform the step comprising storing the extracted conversations into a second corpus.

21. The system as set forth in claim 17 wherein the dimensionality reduction comprises a Uniform Manifold Approximation and Projection process.

22. The system as set forth in claim 17 wherein the applying of the model-based filter comprises selecting extracted conversation clusters according to a model score threshold.

23. The system as set forth in claim 17 wherein the applying of the model-based filter comprises selecting extracted conversation clusters according to an entropy threshold.

24. The system as set forth in claim 20 wherein the one or more program instructions further comprise one or more program instructions configured to cause one or more computer processors to perform the steps comprising: extracting from the first corpus one or more conversations which have associated model scores below a low score threshold; and merging the one or more extracted low model score conversations into the second corpus.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 30, 2022
From: LIMA, PEDRO VALE
To: DISCOURSE.AI, INC.
Reel/Frame 062244/0220 →
Continuity (9)
Continuation In Part 17896291 · Aug 26, 2022
Continuation 17124005 · Dec 16, 2020
Continuation In Part 16786923 · Feb 10, 2020
Continuation In Part 16734973 · Jan 6, 2020
Continuation 16210081 · Dec 5, 2018
Continuation In Part 16201188 · Nov 27, 2018
Provisional Application 62594616 · Dec 5, 2017
Provisional Application 62594610 · Dec 5, 2017
Related Publication 20230237276A1 · Jul 27, 2023
References Cited (52)
US 6587844B1 · Mohri · 2003 [cited by examiner]
US 9021397B2 · Ramsay · 2015 [cited by examiner]
US 9966065B2 · Gruber · 2018 [cited by examiner]
US 10878011B2 · Ashoori · 2020 [cited by examiner]
US 10896670B2 · Eisenzopf · 2021 [cited by examiner]
US 10929611B2 · Eisenzopf · 2021 [cited by examiner]
US 11004013B2 · Eisenzopf · 2021 [cited by examiner]
US 11107006B2 · Eisenzopf · 2021 [cited by examiner]
US 11507756B2 · Lima · 2022 [cited by examiner]
US 11847422B2 · Lima · 2023 [cited by examiner]
US 20050105712A1 · Williams · 2005 [cited by examiner]
US 20110238408A1 · Larcheveque · 2011 [cited by examiner]
US 20130091021A1 · Maslov · 2013 [cited by examiner]
US 20130339021A1 · Deshmukh · 2013 [cited by examiner]
US 20150348551A1 · Gruber · 2015 [cited by examiner]
US 20170092264A1 · Hakkani-Tur · 2017 [cited by examiner]
US 20190171712A1 · Eisenzopf · 2019 [cited by examiner]
US 20190172069A1 · Eisenzopf · 2019 [cited by examiner]
US 20190243916A1 · Ashoori · 2019 [cited by examiner]
US 20200143288A1 · Eisenzopf · 2020 [cited by examiner]
US 20200265339A1 · Eisenzopf · 2020 [cited by examiner]
US 20210157990A1 · Lima · 2021 [cited by examiner]
US 20220215174A1 · Galitsky · 2022 [cited by examiner]
US 20230018172A1 · Lima · 2023 [cited by examiner]
US 20230237276A1 · Lima · 2023 [cited by examiner]
Mcinnes, L, et al.; “UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction”, (2018) retrieved Dec. 30, 2022 from https://arXiv.org/abs/1802.03426. [cited by applicant]
Sainburg, T, et al.; “Parametric UMAP embeddings for representation and semi-supervised learning”, (2021) retrieved Dec. 30, 2022 from ArXiv e-prints 2009.12981. [cited by applicant]
Vaze, S. et al.; “Generalized category discovery”; CVPR (2022); retrieved Dec. 30, 2022 from https://arxiv.org/pdf/2201.02609. [cited by applicant]
Han, K. et al.; “Learning to discover novel visual categories via deep transfer clustering”; ICCV (2019); retrieved Dec. 30, 2022 from https://openaccess.thecvf.com/content_ICCV_2019/papers/Han_Learning_to_Discover_Nove… [cited by applicant]
Lin, T-E.; et al.; “Discovering New Intents via Constrained Deep Adaptive Clustering with Cluster Refinement” (2019); retrieved Dec. 30, 2022 from https://arxiv.org/abs/1911.08891. [cited by applicant]
Caron, M. et al.; “Unsupervised Learning of Visual Features by Contrasting Cluster Assignments” (2006); retrieved Dec. 30, 2022 from https://arxiv.org/abs/2006.09882. [cited by applicant]
Wikipedia; “Hungarian algorithm”; retrieved Dec. 30, 2022 from https://en.wikipedia.org/wiki/Hungarian_algorithm. [cited by applicant]
Hirschberg, J.B., et al.; “V-Measure: A conditional entropy-based external cluster evaluation” (2007), Proceedings of EMNLP, retrieved Dec. 30, 2022 from https://aclanthology.org/D07-1043/. [cited by applicant]
Ting-En Lin, et al.; “Discovering New Intents via Constrained Deep Adaptive Clustering with Cluster Refinement”; Apr. 3, 2020; retrieved on Feb. 23, 2021 from https://ojs.aaai.org//index.php/AAAI/article/view/6353. [cited by applicant]
Chen Shi, et al.; “Auto-Dialabel: Labeling Dialogue Data with Unsupervised Learning”, Oct.-Nov. 2018; retrieved on Feb. 23, 2021 from https://www.aclweb.org/anthology/D18-1072/. [cited by applicant]
Zhong, et al.; “Predicting Customer Call Intent by Analyzing Phone Call Transcripts Based on CNN for Multi-Class Classification”; copyright 2019; retrieved on Feb. 23, 2021 from https://arxiv.org/pdf/1907.03715.pdf. [cited by applicant]
Chatterlee et al.; “Intent Mining from past conversations for Conversational Agent”; Dec. 2020; retrieved on Feb. 23, 2021 from https://www.aclweb.org/anthology/2020.coling-main.366.pdf. [cited by applicant]
Perkins, et al.; “Dialog Intent Induction with Deep Multi-View Clustering”; Sep. 15, 2020; retrieved on Feb. 23, 2021 from https://arxiv.org/pdf/1908.11487.pdf. [cited by applicant]
Vedula, et al.; “Towards Open Intent Discovery for Conversational Text”; Apr. 17, 2019; retrieved on Feb. 23, 2021 from https://arxiv.org/pdf/1904.08524.pdf. [cited by applicant]
USPTO; Notice of Allowance mailed on Jul. 5, 2022 in parent U.S. Appl. No. 17/124,005, filed Dec. 16, 2020. [cited by applicant]
Yang et al.; “Multilingual Universal Sentence Encoder for Semantic Retrieval”; Jul. 12, 2019. [cited by applicant]
Coenen; et al.; “Understanding UMAP”, retrieved on Sep. 29, 2020 from https://pair-code.github.io. [cited by applicant]
Alammar, Jay; “The Illustrated GPT-2 (Visualizing Transformer Language Models)”; retrieved on Nov. 14, 2020 from http://jalammar.github.io. [cited by applicant]
Devlin, et al.; “Open Sourcing BERT: State-of-the-Art Pre-training for Natural Language Processing”; Nov. 2, 2018. [cited by applicant]
Liu, et al.; “RoBERTa: A Robustly Optimized BERT Pretraining Approach”; Jul. 29, 2019. [cited by applicant]
Yang, et al.; “Language-Agnostic BERT Sentence Embedding”; Aug. 18, 2020. [cited by applicant]
Garbade, Michael; “Understanding K-means Clustering in Maching Learning”; Sep. 12, 2018. [cited by applicant]
Mcinnes, et al.; UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction; Sep. 21, 2020. [cited by applicant]
Tutuorials Point; Machine Learning—Hierarchical Clustering; retrieved on Nov. 14, 2020 from https://www.tutorialspoint.com. [cited by applicant]
Soricut, et al.; “ALBERT: A Lite BERT for Self-Supervised Learning of Language Representations”; Dec. 20, 2019. [cited by applicant]
Nguyen, et al.; “Consensus Clusterings”; published by IEEE Xplore on Mar. 12, 2008. [cited by applicant]
Wikipedia; “OpenAI”; retrieved on Nov. 14, 2020 from htts://en.wikipedia.org. [cited by applicant]