IP Library › Granted Patent US 12,341,741
Granted Patent B2
US 12,341,741 · App. 18/317,839 · Granted Jun 24, 2025

System and method for electronic chat production

Inventor: Jan Stadermann (Rheinbach, DE)
Assignee: OPEN TEXT HOLDINGS, INC.
H04L51/216H04L12/1813H04L51/00H04L51/04H04L51/07H04L51/21G06F2201/835
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,341,741
App. No.
18/317,839
Granted
Jun 24, 2025
Kind
B2
Abstract

Systems, methods, and computer program products for electronic chat production are provided. One embodiment includes receiving 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; determining a set of models that model the set of time gaps, selecting an optimum model from the set of models; based on selecting the single Gaussian distribution as the optimum model, determining that the electronic chat comprises a single electronic chat, and storing the set of electronic chat messages as the single electronic chat.

Claims (62)

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

receiving 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;

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

determining a single Gaussian distribution of the set of time gaps; and

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

selecting the single Gaussian distribution as an optimum model from the set of models; and

based on selecting the single Gaussian distribution as the optimum model determining that the set of electronic chat messages are part of a same electronic chat; and

storing the set of electronic chat messages as a single electronic chat.

2. The method of claim 1 , wherein receiving the electronic chat comprising the set of electronic chat messages is based on a chat query criterion.

3. The method of claim 1 , wherein determining the Gaussian mixture model representing the 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 the 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 set of models comprises a plurality of Gaussian mixture models.

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

receiving 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;

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

determining a single Gaussian distribution of the set of time gaps; and

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

selecting the single Gaussian distribution as an optimum model from the set of models;

based on selecting the single Gaussian distribution as the optimum model, determining that the set of electronic chat messages are part of the same electronic chat; and

storing the set of electronic chat messages as a single electronic chat.

9. The computer program product of claim 8 , wherein receiving the set of electronic chat messages is based on a chat query criterion.

10. The computer program product of claim 8 , wherein determining the Gaussian mixture model representing the 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 the 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 set of models comprises a plurality of Gaussian mixture models.

15. An electronic discovery system comprising:

a processor;

a non-transitory, computer-readable medium storing a set of computer executable instructions that are executable by the processor, the set of computer executable instructions including instructions for:

receiving 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;

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

determining a single Gaussian distribution of the set of time gaps; and

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, wherein selecting the optimum model comprises selecting the single Gaussian distribution from the set of models;

based on selecting the single Gaussian distribution as the optimum model, determining that the set of electronic chat messages are part of the same electronic chat; and

storing the set of electronic chat messages as a single electronic chat.

16. The electronic discovery system of claim 15 , wherein receiving the set of electronic chat messages is based on a chat query criterion.

17. The electronic discovery system of claim 15 , wherein determining the Gaussian mixture model representing the 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 18 , 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 the 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 set of models comprises a plurality of Gaussian mixture models.

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 Jun 1, 2023
From: STADERMANN, JAN
To: OPEN TEXT HOLDINGS, INC.
Reel/Frame 063818/0022 →
Continuity (3)
Continuation 17389190 · Jul 29, 2021
Provisional Application 63220391 · Jul 9, 2021
Related Publication 20230291703A1 · Sep 14, 2023
References Cited (28)
US 7849147B2 · Rohall · 2010 [cited by applicant]
US 9344390B1 · Chandrasekar et al. · 2016 [cited by applicant]
US 10505875B1 · Jenks et al. · 2019 [cited by applicant]
US 10586266B2 · Fredrich · 2020 [cited by applicant]
US 11595337B2 · Stadermann · 2023 [cited by applicant]
US 11631056B2 · Carter et al. · 2023 [cited by applicant]
US 11700224B2 · Stadermann · 2023 [cited by applicant]
US 12177178B2 · Stadermann · 2024 [cited by applicant]
US 20070050388A1 · Martin · 2007 [cited by applicant]
US 20090144033A1 · Liu · 2009 [cited by examiner]
US 20120102037A1 · Ozonat · 2012 [cited by examiner]
US 20120123734A1 · Linde · 2012 [cited by examiner]
US 20150012111A1 · Contreras-Vidal · 2015 [cited by examiner]
US 20150228015A1 · Bhattacharya · 2015 [cited by examiner]
US 20160019659A1 · Doganata · 2016 [cited by examiner]
US 20160286667A1 · Fuessl · 2016 [cited by applicant]
US 20180144389A1 · Fredrich et al. · 2018 [cited by applicant]
US 20200344193A1 · Conley · 2020 [cited by examiner]
US 20210029065A1 · Erhart et al. · 2021 [cited by applicant]
US 20230291703A1 · Stadermann · 2023 [cited by examiner]
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. 17/389,194, mailed Oct. 20, 2023, 37 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. 17/389,194, mailed Apr. 5, 2024, 36 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. 17/389,194, mailed Jan. 23, 2025, 10 pages. [cited by applicant]
Office Action issued for U.S. Appl. No. 17/389,194, mailed Sep. 10, 2024, 30 pages. [cited by applicant]