IP Library › Granted Patent US 12,314,658
Granted Patent B2
US 12,314,658 · App. 17/389,194 · Granted May 27, 2025

System and method for electronic chat production

Inventor: Jan Stadermann (Rheinbach, DE)
Assignee: Open Text Holdings, Inc.
G06F40/20G06F18/24155G06N20/00H04L51/04
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,314,658
App. No.
17/389,194
Granted
May 27, 2025
Kind
B2
Abstract

Systems, methods, and computer program products for adaptively splitting electronic chats are provided. One embodiment includes receiving, by an electronic discovery system, an electronic chat comprising a set of electronic chat messages, each of the electronic chat messages in the set of electronic chat messages having a timestamp; determining a set of time gaps between the electronic chat messages from the set of electronic chat messages, based on selecting a Gaussian mixture model as a model of the time gaps, splitting the set of electronic chat message into a set of conversations based on the Gaussian mixture model; performing a text analysis on the set of conversations based on a chat subject matter identified in the set of electronic chat messages; and splitting the set of conversations based on the chat subject matter.

Claims (74)

1. A method of electronic chat production in an electronic discovery system, comprising:

receiving, by the electronic discovery system executing on a computer processor, an electronic chat comprising a set of electronic chat messages, each of the electronic chat messages having a timestamp;

determining a set of time gaps between the electronic chat messages in the set of electronic chat messages, the set of time gaps determined as respective time gaps between respective adjacent electronic chat messages in the set of electronic chat messages;

determining a set of models that model the set of time gaps, wherein determining the set of models comprises:

determining, using the set of time gaps, a Gaussian mixture model representing a mixture of Gaussian distributions;

selecting an optimum model from the set of models;

based on selecting the Gaussian mixture model as the optimum model and a text analysis of the electronic chat, performing an adaptive splitting of the set of electronic chat messages, comprising:

splitting the set of electronic chat messages into a set of conversations based on the Gaussian mixture model;

performing the text analysis on the set of conversations based on a chat subject matter identified in the set of electronic chat messages;

splitting the set of conversations based on the chat subject matter; and

storing the split set of conversations.

2. The method of claim 1 , wherein the chat subject matter is a set of chat subject matters within a parent chat subject matter grouping and wherein receiving the electronic chat comprising a set of electronic chat messages is based on a chat query criterion identifying the parent chat subject matter grouping.

3. The method of claim 1 , wherein determining a Gaussian mixture model representing a mixture of Gaussian distributions comprises:

learning the Gaussian mixture model by modeling a mixture of Gaussian distributions.

4. The method of claim 3 , wherein learning the Gaussian mixture model further comprises:

setting a maximum number of Gaussian components; and

modeling a set of Gaussian distributions from 2 through the maximum number of Gaussian components.

5. The method of claim 3 , wherein learning the Gaussian mixture model further comprises:

using an expectation maximization technique to learn the Gaussian distributions of the Gaussian mixture model.

6. The method of claim 1 , wherein selecting an optimum model from the set of models further comprises:

determining a Bayesian information criterion for each model in the set of models and selecting the optimal model from the set of models based on the Bayesian information criteria for the set of models.

7. The method of claim 1 , wherein the chat subject matter is a plurality of chat subject matters, the method further comprising, by the electronic discovery system;

applying, by a text mining and classification engine, a text analysis on the electronic chat to derive the plurality of chat subject matters for the electronic chat; and

splitting the set of conversations by identifying corresponding chat messages characterized by the chat subject matter.

8. A computer program product comprising a non-transitory, computer-readable medium storing thereon a set of computer-executable instructions, the set of computer-executable instructions comprising instructions for:

receiving, by an electronic discovery system executing on a computer processor, an electronic chat comprising a set of electronic chat messages, each of the electronic chat messages having a timestamp;

determining a set of time gaps between the electronic chat messages in the set of electronic chat messages, the set of time gaps determined as respective time gaps between respective adjacent electronic chat messages in the set of electronic chat messages;

determining a set of models that model the set of time gaps, wherein determining the set of models comprises:

determining, using the set of time gaps, a Gaussian mixture model representing a mixture of Gaussian distributions;

selecting an optimum model from the set of models;

based on selecting the Gaussian mixture model as the optimum model and a text analysis of the electronic chat, performing an adaptive splitting of the set of electronic chat messages, comprising:

splitting the set of electronic chat messages into a set of conversations based on the Gaussian mixture model;

performing the text analysis on the set of conversations based on a chat subject matter identified in the set of electronic chat messages;

splitting the set of conversations based on the chat subject matter; and

storing the split set of conversations.

9. The computer program product of claim 8 , wherein the chat subject matter is a set of chat subject matters within a parent chat subject matter grouping and wherein receiving the electronic chat comprising a set of electronic chat messages is based on a chat query criterion identifying the parent chat subject matter grouping.

10. The computer program product of claim 8 , wherein determining a Gaussian mixture model representing a mixture of Gaussian distributions comprises:

learning the Gaussian mixture model by modeling a mixture of Gaussian distributions.

11. The computer program product of claim 10 , wherein learning the Gaussian mixture model further comprises:

setting a maximum number of Gaussian components; and

modeling a set of Gaussian distributions from 2 through the maximum number of Gaussian components.

12. The computer program product of claim 10 , wherein learning the Gaussian mixture model further comprises:

using an expectation maximization technique to learn the Gaussian distributions of the Gaussian mixture model.

13. The computer program product of claim 8 , wherein selecting an optimum model from the set of models further comprises:

determining a Bayesian information criterion for each model in the set of models and selecting the optimal model from the set of models based on the Bayesian information criteria for the set of models.

14. The computer program product of claim 8 , wherein the chat subject matter is a plurality of chat subject matters, and wherein the set of computer-executable instructions comprises instructions for:

applying, by a text mining and classification engine, the text analysis on the electronic chat to derive the plurality of chat subject matters for the electronic chat; and

splitting the set of conversations by identifying corresponding chat messages characterized by the chat subject matter.

15. An electronic discovery system comprising:

a processor;

a non-transitory, computer-readable medium storing thereon a set of computer-executable instructions executable by the processor, the set of computer-executable instructions comprising instructions for:

receiving an electronic chat comprising a set of electronic chat messages, each of the electronic chat messages having a timestamp;

determining a set of time gaps between the electronic chat messages in the set of electronic chat messages, the set of time gaps determined as respective time gaps between respective adjacent electronic chat messages in the set of electronic chat messages;

determining a set of models that model the set of time gaps, wherein determining the set of models comprises:

determining, using the set of time gaps, a Gaussian mixture model representing a mixture of Gaussian distributions;

selecting an optimum model from the set of models;

based on selecting the Gaussian mixture model as the optimum model and a text analysis of the electronic chat, performing an adaptive splitting of the set of electronic chat messages, comprising:

splitting the set of electronic chat messages into a set of conversations based on the Gaussian mixture model;

performing the text analysis on the set of conversations based on a chat subject matter identified in the set of electronic chat messages;

splitting the set of conversations based on the chat subject matter; and

storing the split set of conversations.

16. The electronic discovery system of claim 15 , wherein the chat subject matter is a set of chat subject matters within a parent chat subject matter grouping and wherein receiving the electronic chat comprising a set of electronic chat messages is based on a chat query criterion identifying the parent chat subject matter grouping.

17. The electronic discovery system of claim 15 , wherein determining a Gaussian mixture model representing a mixture of Gaussian distributions comprises:

learning the Gaussian mixture model by modeling a mixture of Gaussian distributions.

18. The electronic discovery system of claim 17 , wherein learning the Gaussian mixture model further comprises:

setting a maximum number of Gaussian components; and

modeling a set of Gaussian distributions from 2 through the maximum number of Gaussian components.

19. The electronic discovery system of claim 17 , wherein learning the Gaussian mixture model further comprises:

using an expectation maximization technique to learn the Gaussian distributions of the Gaussian mixture model.

20. The electronic discovery system of claim 15 , wherein selecting an optimum model from the set of models further comprises:

determining a Bayesian information criterion for each model in the set of models and selecting the optimal model from the set of models based on the Bayesian information criteria for the set of models.

21. The electronic discovery system of claim 15 , wherein the chat subject matter is a plurality of chat subject matters, and wherein the set of computer-executable instructions comprises instructions for:

applying, by a text mining and classification engine, the text analysis on the electronic chat to derive the plurality of chat subject matters for the electronic chat; and

splitting the set of conversations by identifying corresponding chat messages characterized by the chat subject matter.

Assignments (2)
MERGER Recorded Jun 23, 2026
From: OPEN TEXT HOLDINGS, INC.
To: OPEN TEXT INC.
Reel/Frame 075054/0978 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 11, 2022
From: STADERMANN, JAN
To: OPEN TEXT HOLDINGS, INC.
Reel/Frame 059238/0729 →
Continuity (2)
Provisional Application 63220391 · Jul 9, 2021
Related Publication 20230015667A1 · Jan 19, 2023
References Cited (40)
US 7849147B2 · Rohall · 2010 [cited by examiner]
US 9344390B1 · Chandrasekar · 2016 [cited by examiner]
US 10505875B1 · Jenks · 2019 [cited by examiner]
US 10586266B2 · Fredrich · 2020 [cited by examiner]
US 11595337B2 · Stadermann · 2023 [cited by applicant]
US 11631056B2 · Carter · 2023 [cited by examiner]
US 11700224B2 · Stadermann · 2023 [cited by applicant]
US 12177178B2 · Stadermann · 2024 [cited by applicant]
US 20070050388A1 · Martin · 2007 [cited by examiner]
US 20090144033A1 · Liu · 2009 [cited by applicant]
US 20120102037A1 · Ozonat · 2012 [cited by examiner]
US 20120123734A1 · Linde · 2012 [cited by applicant]
US 20150012111A1 · Contreras-Vidal · 2015 [cited by applicant]
US 20150228015A1 · Bhattacharya · 2015 [cited by examiner]
US 20160019659A1 · Doganata · 2016 [cited by examiner]
US 20180144389A1 · Fredrich · 2018 [cited by examiner]
US 20190180175A1 · Meteer · 2019 [cited by applicant]
US 20190251166A1 · Penrose · 2019 [cited by applicant]
US 20190286667A1 · Puzicha · 2019 [cited by examiner]
US 20200344193A1 · Conley · 2020 [cited by examiner]
US 20210006515A1 · Downs · 2021 [cited by applicant]
US 20210029065A1 · Erhart et al. · 2021 [cited by applicant]
US 20210335367A1 · Graff · 2021 [cited by applicant]
US 20230016925A1 · Stadermann · 2023 [cited by applicant]
US 20230179558A1 · Stadermann · 2023 [cited by applicant]
US 20250055824A1 · Stadermann · 2025 [cited by applicant]
Miro, Xavier Anguera “Robust Speaker Diarization for Meetings,” mailed Oct. 2006, 229 pages. [cited by applicant]
Office Action mailed Dec. 21, 2021 issued in U.S. Appl. No. 17/389,187, 14 pages. [cited by applicant]
Notice of Allowance issued in U.S. Appl. No. 17/389,187, mailed Apr. 6, 2022, 7 pages. [cited by applicant]
International Search Report and Written Opinion, issued in Application No. PCT/US2022/036537, mailed Aug. 9, 2022, 11 pages. [cited by applicant]
Office Action issued in U.S. Appl. No. 17/389,190, mailed Sep. 12, 2022, 9 pgs. [cited by applicant]
Notice of Allowance issued in U.S. Appl. No. 17/389,187, mailed Oct. 31, 2022, 7 pgs. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/389,190, issued by the U.S. Patent and Trademark office, Feb. 15, 2023, 11 pages. [cited by applicant]
Office Action issued for U.S. Appl. No. 18/162,478, mailed Oct. 13, 2023, 15 pages. [cited by applicant]
Office Action issued for U.S. Appl. No. 18/162,478, mailed Feb. 28, 2024, 20 pages. [cited by applicant]
Office Action issued for U.S. Appl. No. 18/317,839, mailed Jun. 5, 2024, 7 pages. [cited by applicant]
International Preliminary Report on Patentability issued for International Application No. PCT/US2022/036537, mailed Jan. 18, 2024, 8 pages. [cited by applicant]
Notice of Allowance issued for U.S. Appl. No. 18/162,478, mailed Jul. 18, 2024, 7 pages. [cited by applicant]
Notice of Allowance issued for U.S. Appl. No. 18/317,839, mailed Sep. 16, 2024, 11 pages. [cited by applicant]
Notice of Allowance issued for U.S. Appl. No. 18/317,839, mailed Feb. 26, 2025, 8 pages. [cited by applicant]