IP Library Granted Patent US 12,204,573
Granted Patent B2
US 12,204,573 · App. 18/210,296 · Granted Jan 21, 2025

System and method to avoid sending a message to the unintended recipient

Inventors: Kuppappa Harijan (Bengaluru, IN); Madhusudhan Srinivasan (Bangalore, IN)
Assignee: Adeia Guides Inc.
G06F16/3344G06F16/322G06F16/335H04L51/046H04L51/224
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,204,573
App. No.
18/210,296
Granted
Jan 21, 2025
Kind
B2
Abstract

Methods and systems are described for preventing a message from being sent to an unintended recipient. A first context data structure is generated for a first conversation, a second context data structure is created for a second conversation, and then a message input is received as intended for the first conversation. The message is correlated with each of the first context data structures and the second context data structure to determine a relevance score corresponding to each of the first and second conversation. The relevance scores are compared and if the relevance score for the first conversation is greater than the relevance score for the second conversation, the message is sent; however, if the relevance score for the second conversation is greater than the relevance score for the first conversation, the message is not sent and the message is prevented from being sent to, for example, an unintended recipient.

Claims (50)

1. A method of determining whether a message should be prevented from being sent to an unintended recipient, the method comprising:

accessing a first conversation data structure, the first conversation data structure comprising (1) messages transmitted via a network to or from a first recipient and (2) first conversation time data;

accessing a second conversation data structure, the second conversation data structure comprising (1) messages transmitted via the network to or from a second recipient, and not transmitted to or from the first recipient, and (2) second conversation time data;

receiving, via input to a user interface, a request to transmit a message via the network to the first recipient, wherein the second recipient is not identified in the request to transmit the message, and wherein the message corresponds to a message data structure;

determining a first relevance score for the first recipient based on (1) a comparison of the message data structure to the first conversation data structure, and (2) a first time gap between the message and a latest entry in the first conversation data structure, such that the first relevance score is inversely proportional to the first time gap;

determining a second relevance score for the second recipient who is not identified in the request to transmit the message based on (1) a comparison of the message data structure to the second conversation data structure, and (2) a second time gap between the message and a latest entry in the second conversation data structure, such that the second relevance score is inversely proportional to the second time gap;

in response to determining that the first relevance score exceeds the second relevance score, allowing transmission via the network of the message to the first recipient; and

in response to determining that the first relevance score does not exceed the second relevance score:

preventing transmission via the network of the message to the first recipient; and

providing an alert via the user interface indicating that the message may not be intended for a first conversation.

2. The method of claim 1 , wherein determining the first relevance score further comprises determining the first relevance score based on correlating message time data with the first conversation time data, and wherein determining the second relevance score further comprises correlating the message time data with the second conversation time data.

3. The method of claim 1 , wherein determining the first relevance score further comprises weighting based on a comparison of the first conversation time data and message time data.

4. The method of claim 1 , wherein determining the second relevance score further comprises weighting based on a comparison of the second conversation time data and message time data.

5. The method of claim 1 , wherein the first conversation data structure and the second conversation data structure each comprise at least one of an array, matrix, stack, linked list, tree, queue or string.

6. The method of claim 1 , wherein the first conversation, a second conversation, and the message are text-based.

7. The method of claim 1 , further comprising:

comparing each of the first relevance score and the second relevance score to a predetermined threshold;

creating a third conversation based on the message if the first relevance score and the second relevance score do not meet or exceed the predetermined threshold; and

sending the message in the third conversation.

8. A system for preventing a message from being sent to an unintended recipient, the system comprising:

memory configured to store a first conversation data structure and a second conversation data structure, wherein, the first conversation data structure comprises (1) messages transmitted via a network to or from a first recipient, and (2) first conversation time data, and the second conversation data structure comprises (1) messages transmitted via the network to or from a second recipient, and not transmitted to or from the first recipient, and (2) second conversation time data;

input/output circuitry configured to receive, via input to a user interface, a request to transmit a message via the network to the first recipient, wherein the second recipient is not identified in the request to transmit the message, and wherein the message corresponds to a message data structure; and

processing circuitry configured to:

determine a first relevance score for the first recipient based on (1) a comparison of the message data structure to the first conversation data structure, and (2) a first time gap between the message and a latest entry in the first conversation data structure, such that the first relevance score is inversely proportional to the first time gap;

determine a second relevance score for the second recipient who is not identified in the request to transmit the message based on (1) a comparison of the message data structure to the second conversation data structure, and (2) a second time gap between the message and a latest entry in the second conversation data structure, such that the second relevance score is inversely proportional to the second time gap;

in response to determining that the first relevance score exceeds the second relevance score, allow transmission via the network of the message to the first recipient; and

in response to determining that the first relevance score does not exceed the second relevance score;

prevent transmission via the network of the message to the first recipient; and

cause an alert to be provided via the user interface indicating that the message may not be intended for a first conversation.

9. The system of claim 8 , wherein the processing circuitry is configured to correlate message time data with first conversation time data and correlate the message time data with second conversation time data.

10. The system of claim 8 , wherein the processing circuitry is configured to determine the first relevance score by weighting based on a comparison of the first conversation time data and message time data.

11. The system of claim 8 , wherein the processing circuitry is configured to determine the second relevance score by weighting based on a comparison of the second conversation time data and message time data.

12. The system of claim 8 , wherein the first conversation data structure and the second conversation data structure each comprise at least one of an array, matrix, stack, linked list, tree, queue or string.

13. The system of claim 8 , wherein the processing circuitry is further configured to:

compare each of the first relevance score and the second relevance score to a predetermined threshold;

create a third conversation based on the message if the first relevance score and the second relevance score do not meet or exceed the predetermined threshold; and

send the message in the third conversation.

14. The system of claim 8 , wherein the first conversation, a second conversation, and the message are text-based.

15. A method of determining whether a message should be prevented from being sent to an unintended recipient, the method comprising:

accessing a first conversation with a first recipient, the first conversation comprising messages transmitted via a network to or from the first recipient and first conversation time data;

accessing a second conversation with a second recipient, the second conversation comprising messages transmitted via the network to or from the second recipient and not transmitted to or from the first recipient, and second conversation time data;

receiving a request to transmit a message via the network to the first recipient, wherein the second recipient is not identified in the request to transmit the message;

determining a first relevance score for the first recipient based on keywords or topics associated with the message and a first time gap between the message and a latest entry in the first conversation, such that the first relevance score is inversely proportional to the first time gap;

determining a second relevance score for the second recipient who is not identified in the request to transmit the message based on the keywords or topics associated with the message and a second time gap between the message and a latest entry in the second conversation, such that the second relevance score is inversely proportional to the second time gap;

determining whether the first relevance score exceeds the second relevance score;

in response to determining that the first relevance score exceeds the second relevance score, allowing transmission via the network of the message in the first conversation; and

in response to determining that the first relevance score does not exceed the second relevance score, preventing transmission over the network of the message in the first conversation and providing an alert via a user interface indicating that the first conversation may not be correct;

comparing each of the first relevance score and the second relevance score to a predetermined threshold;

based on determining that the first relevance score and the second relevance score each do not meet or exceed the predetermined threshold, creating a third conversation based on the message; and

sending the message in the third conversation.

Assignments (2)
CHANGE OF NAME Recorded Oct 3, 2024
From: ROVI GUIDES, INC.
To: ADEIA GUIDES INC.
Reel/Frame 069106/0178 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 15, 2023
From: HARIJAN, KUPPAPPA; SRINIVASAN, MADHUSUDHAN
To: ROVI GUIDES, INC.
Reel/Frame 063962/0868 →
Continuity (2)
Continuation 16407347 · May 9, 2019
Related Publication 20230409619A1 · Dec 21, 2023
References Cited (35)
US 7774421B2 · Dubovsky et al. · 2010 [cited by applicant]
US 8275839B2 · Auerbach et al. · 2012 [cited by applicant]
US 9262751B1 · Wheeler · 2016 [cited by applicant]
US 10346411B1 · Deselaers · 2019 [cited by examiner]
US 10666695B2 · Weinwurm · 2020 [cited by examiner]
US 10796338B2 · Cohn et al. · 2020 [cited by applicant]
US 11303599B2 · Thomas · 2022 [cited by examiner]
US 11528244B2 · Balasubramanian · 2022 [cited by examiner]
US 11720612B2 · Harijan et al. · 2023 [cited by applicant]
US 20080250114A1 · Dubovsky et al. · 2008 [cited by applicant]
US 20100318620A1 · Bansal et al. · 2010 [cited by applicant]
US 20100332602A1 · O'Sullivan · 2010 [cited by examiner]
US 20120124483A1 · Zuckerberg et al. · 2012 [cited by applicant]
US 20120215861A1 · Smith et al. · 2012 [cited by applicant]
US 20130097526A1 · Stovicek et al. · 2013 [cited by applicant]
US 20150058428A1 · Caskey · 2015 [cited by examiner]
US 20160080291A1 · Caliendo et al. · 2016 [cited by applicant]
US 20160112359A1 · Allen · 2016 [cited by examiner]
US 20160156581A1 · Li et al. · 2016 [cited by applicant]
US 20160173421A1 · Alshinnawi · 2016 [cited by examiner]
US 20160308814A1 · Meister · 2016 [cited by examiner]
US 20160366088A1 · Abou Mahmoud · 2016 [cited by examiner]
US 20170206545A1 · Gupta et al. · 2017 [cited by applicant]
US 20180054367A1 · Bastide · 2018 [cited by examiner]
US 20180176167A1 · Herger · 2018 [cited by examiner]
US 20180315418A1 · Bolsakovas · 2018 [cited by examiner]
US 20190020606A1 · Vasudeva et al. · 2019 [cited by applicant]
US 20190166121A1 · Colby et al. · 2019 [cited by applicant]
US 20190361934A1 · Rogynskyy et al. · 2019 [cited by applicant]
US 20200106630A1 · Bourassa et al. · 2020 [cited by applicant]
US 20200151620A1 · Chao · 2020 [cited by examiner]
US 20200226217A1 · Anders · 2020 [cited by examiner]
US 20200274842A1 · Delaney · 2020 [cited by examiner]
US 20230179556A1 · Rieseberg · 2023 [cited by examiner]
International Search Report and Written Opinion in PCT/US2020/032096 dated Aug. 18, 2020. [cited by applicant]