IP Library › Granted Patent US 10,003,559
Granted Patent B2
US 10,003,559 · App. 14/939,159 · Granted Jun 19, 2018

Aggregating redundant messages in a group chat

Inventors: Mohan Narayanswamy (Bangalore, IN); Uttam Setty (Bangalore, IN)
Assignee: International Business Machines Corporation
H04L51/12G06F17/2765G06F17/30705H04L51/16
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 10,003,559
App. No.
14/939,159
Granted
Jun 19, 2018
Kind
B2
Abstract

Embodiments of the present invention provide a method, system, and computer program product for aggregating redundant messages in a group chat. A computer may receive a plurality of messages in a group chat from one or more chat devices. The computer may extract a fact from each of the plurality of messages using natural language processing. The computer may identify redundant messages within the plurality of messages. The computer may aggregate the redundant messages into a combined message. The computer may provide the combined message to the group chat. A number of redundant messages aggregated in the combined message may be provided. The redundant messages may be provided.

Claims (60)

1. A method for aggregating similar messages in a group chat on a computer, the method comprising:

receiving, by the computer, a plurality of messages associated with the group chat from one or more chat devices, wherein the plurality of messages comprises at least a first message and a second message;

determining, by the computer, a common fact associated with the first message and the second message, wherein the determining comprises:

extracting facts from the plurality of messages based on natural language processing;

identifying a first fact associated with the first message and another fact associated with the second message; and

determining the common fact based on a commonality between the first fact and the another fact;

identifying, by the computer, redundant messages within the plurality of messages, wherein the redundant messages are associated with the common fact; and

aggregating, by the computer, the redundant messages into a combined message.

2. The method of claim 1 , further comprising:

providing the combined message to the group chat.

3. The method of claim 1 , further comprising:

providing a number of redundant messages aggregated into the combined message.

4. The method of claim 1 , further comprising:

providing the redundant messages to the group chat.

5. The method of claim 1 , wherein the combined message comprises a statement corresponding to the common fact associated with the redundant messages.

6. The method of claim 1 , further comprising:

providing a time stamp indicating a time at least one redundant message of the redundant messages is received.

7. The method of claim 1 , wherein at least one redundant message of the redundant messages comprises an uncommon fact.

8. The method of claim 1 , wherein the method further comprises performing at least one of the following:

aggregating, by the computer, a first portion of at least one redundant message associated with the common fact into the combined message; and

separating, by the computer, a second portion of at least one redundant message associated with an uncommon fact.

9. A computer program product for aggregating similar messages in a group chat, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a processor to cause a computer to perform a method comprising:

receiving, by the computer, a plurality of messages associated with the group chat from one or more chat devices, wherein the plurality of messages comprises at least a first message and a second message;

determining, by the computer, a common fact associated with the first message and the second message, wherein the determining comprises:

extracting facts from the plurality of messages based on natural language processing;

identifying a first fact associated with the first message and another fact associated with the second message; and

determining the common fact based on a commonality between the first fact and the another fact;

identifying, by the computer, redundant messages within the plurality of messages, wherein the redundant messages are associated with the common fact; and

aggregating, by the computer, the redundant messages into a combined message.

10. The computer program product of claim 9 , further comprising:

providing the combined message to the group chat.

11. The computer program product of claim 9 , further comprising:

providing a number of redundant messages aggregated into the combined message.

12. The computer program product of claim 9 , further comprising:

providing the redundant messages to the group chat.

13. The computer program product of claim 9 , wherein the combined message comprises a statement corresponding to the common fact of the redundant messages.

14. The computer program product of claim 9 , further comprising performing at least one of the following:

aggregating, by the computer, a first portion of at least one redundant message associated with the common fact into the combined message; and

separating, by the computer, a second portion of at least one redundant message associated with an uncommon fact.

15. A system for aggregating similar messages in a group chat, the computer system comprising:

one or more computer processors;

one or more computer-readable storage media;

program instructions stored on the one or more computer-readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising:

instructions to receive, by a computer, a plurality of messages associated with the group chat from one or more chat devices, wherein the plurality of messages comprises at least a first message and a second message;

instructions to determine, by the computer, a common fact associated with the first message and the second message, wherein the instructions to determine comprise:

instructions to extract facts from the plurality of messages based on natural language processing;

instructions to identify a first fact associated with the first message and another fact associated with the second message; and

instructions to determine the common fact based on a commonality between the first fact and the another fact;

instructions to identify, by the computer, redundant messages within the plurality of messages, wherein the redundant messages are associated with the common fact; and

instructions to aggregate, by the computer, the redundant messages into a combined message.

16. The system of claim 15 , further comprising:

instructions to provide the combined message to the group chat.

17. The system of claim 15 , further comprising:

instructions to provide a number of redundant messages aggregated into the combined message.

18. The system of claim 15 , further comprising:

instructions to provide the redundant messages to the group chat.

19. The system of claim 15 , wherein the combined message comprises a statement corresponding to the common fact of the redundant messages.

20. The system of claim 15 , wherein the program instructions further comprise at least one of the following:

instructions to aggregate, by the computer, a first portion of at least one redundant message associated with the common fact into the combined message; and

instructions to separate, by the computer, a second portion of at least one redundant message associated with an uncommon fact.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 12, 2015
From: NARAYANSWAMY, MOHAN; SETTY, UTTAM
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 037023/0416 →
Continuity (1)
Related Publication 20170142043A1 · May 18, 2017