IP Library › Granted Patent US 12,574,340
Granted Patent B2
US 12,574,340 · App. 18/534,809 · Granted Mar 10, 2026

System and method for automatic short message generation

Inventors: Charles T. Natoli (San Francisco, CA); Devin Patel (Boston, MA); Sofiane Hadji (Boston, MA); Gal Gila Korcia (Cambridge, MA); Nick Vessella (Rockland, MA); Robert Huselid (Stamford, CT); Andrew Piliero (Redwood City, CA); Tristan Mills (Cambridge, MA); Harsh Mehta (Boston, MA)
Assignee: Klaviyo, Inc.
H04L51/02G06Q30/0201H04L51/063H04L51/212
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,574,340
App. No.
18/534,809
Filed
Dec 11, 2023
Granted
Mar 10, 2026
Kind
B2
Art Unit
2447
USPC
709/206
Abstract

Apparatuses, methods, and systems for generating short messages for electronic messages of electronic marketing messages. One method includes receiving, by a server, information related to the electronic marketing message, receiving, by the server, a plurality of N short messages (text) generated based on the received information from a generative text engine model, reducing, by the server, the plurality of N short messages down to M short messages, displaying messages based on the M short messages to a merchant user, identifying merchant actions in response to the displaying of the messages based on the M short messages, and fine-tuning, by the server, the generative text engine model based on the identified merchant actions.

Claims (57)

1 . A computer-implemented method for generating text for short messages for electronic marketing messaging, comprising:

receiving, by a server, information related to the electronic marketing message;

receiving, by the server, a plurality of N short messages generated based on the received information from a generative text engine model;

reducing, by the server, the plurality of N short messages down to M short messages comprising:

determining similarity scores between each of the N short messages

eliminating one of any two short messages of the N short messages that are determined to have a similarity score greater than a first similarity threshold;

determining similarity scores between each of the N short messages and the received information;

eliminating short messages of the N short messages that are determined to have a similarity score greater than a second similarity threshold with the received information;

wherein the first similarity threshold is different than the second similarity threshold;

displaying messages based on the M short messages to a merchant user;

identifying merchant actions in response to the displaying of the messages based on the M short messages, comprising tracking, by the server, actions of the merchant user at a merchant server based on the messages displayed; and

fine-tuning, by the server, the generative text engine model based on the identified merchant actions, comprising:

assigning a quality rating to at least a portion of the messages based on the M short messages; and

supplementing data used to train the generative text engine model with quality ratings of the at least the portion of the messages based on the M short messages.

2 . The method of claim 1 , wherein the server is electronically connected to a merchant server of the merchant user, and electronically connected to a plurality of customer devices of customers of the merchant user, and further comprising:

displaying at least a portion of the messages based on the M short messages to one or more customers of the merchant user;

identifying customer actions in response to the displaying of the at least the portion of the messages based on the M short messages; and

further fine-tuning, by the server, the generative text engine model based on the identified customer actions.

3 . The method of claim 2 , wherein tuning the generative text engine model comprises:

assigning a second quality rating for each of the short messages displayed to the one or more customers based on the identified customer actions; and

supplementing data used to train the generative text engine model with the second quality ratings of the short messages displayed to the one or more customers.

4 . The method of claim 2 , wherein a filtering discriminator model performs at least a portion of the reducing of the N short messages down to the M short messages, and further comprising fine-tuning, by the server, the filtering discriminator model based on the identified customer actions.

5 . The method of claim 2 , wherein identifying the customer actions in response to the displaying of the at least the portion of the messages based on the M short messages comprises:

sensing the one or more customers visiting a physical location of the merchant, and the one or more customers purchasing a product or service of the merchant at the physical store location of the merchant.

6 . The method of claim 2 , wherein identifying the customer actions in response to the displaying of the at least the portion of the messages based on the M short messages comprises:

sensing combinations or sequences of customer actions; and

weighting the sensed customer actions based on the sensed customer actions; and

identifying a customer action for combinations of weighted customer actions exceeding a customer action threshold.

7 . The method of claim 2 , wherein identifying the customer actions in response to the displaying of the at least the portion of the messages based on the M short messages comprises:

identifying business locations visited by customers after receiving short messages;

rating different businesses with different customer action scores; and

identifying a customer action based on the ratings of the different businesses visited by the customers.

8 . The method of claim 2 , wherein identifying the customer actions in response to the displaying of the at least the portion of the messages based on the M short messages comprising:

tracking, by location and motion sensors of computing devices of the customers, locations and motions of the customers including tracking hand motions, direction of eyesight, and orientations of the customers;

identifying motions of a customer including how long the customer holds or looks at a specific product of the merchant;

determining a score of sensed customer actions based on sensed locations and motions of the customer; and

identifying a customer action based on the score.

9 . The method of claim 2 , wherein identifying the customer actions in response to the displaying of the at least the portion of the messages based on the M short messages comprises:

determining relationships between different customers by tracking locations of the different customers;

identifying customer friends or associates of the different customers based on location the tracking;

identifying commonalities of the different customers by identifying common locations, or common types of locations between the different customers; and

determining a success score of the M short messages based on a level of influence between the different customers.

10 . The method of claim 1 , wherein a filtering discriminator model performs at least a portion of the reducing of the plurality of N short messages down to the M short messages.

11 . The method of claim 10 , further comprising fine-tuning, by the server, the filtering discriminator model based on the identified merchant actions.

12 . The method of claim 1 , further comprising continuously updating the generative text engine model based on continuously generated quality ratings.

13 . The method of claim 1 , wherein reducing the plurality of N short messages down to M short messages comprises filtering the N short message to eliminate short messages based on content, including eliminating short messages that include inappropriate and politically sensitive words.

14 . The method of claim 1 , wherein reducing the plurality of N short messages down to M short messages comprises filtering the N short message to eliminate short messages based on content, including eliminating short messages that include identified prohibited context.

15 . The method of claim 1 , further comprising applying a fine-tuned enhancer model to enhance existing content for a selected one or more of the M short messages, wherein enhancing the content includes modifying or updating the existing content to include a branding voice of the merchant user, comprising personalizing the content for the merchant user to include the branding voice of the merchant user as determined by analyzing previous or past samples of short messages of the merchant user, and

wherein enhancing further includes adding emojis to the selected one or more of the M short messages comprising:

determining by training an enhancement model on historical short message-emoji pairs;

gathering an emoji selection by calling the enhancement model on the selected one or more of the M short messages; and

selected one or more of the M short messages according to predetermined patterns.

16 . The method of claim 15 , wherein personalizing the content for the merchant user includes personalizing the information related to the electronic marketing message before generating the N short messages, or personalizing content of the generated N short messages.

17 . The method of claim 1 , further comprising:

providing a merchant with a slider control that allows the merchant to adaptively adjust a tone of the M or N short messages comprising displaying the slider control on a user interface of the merchant allowing the merchant to adjust the tone of the M or N short messages, wherein endpoints of the slider include serious and fun.

18 . The method of claim 1 , further comprising applying a fine-tuned enhancer model to enhance existing content for a selected one or more of the M short messages, wherein enhancing the content includes modifying or updating the existing content to include a branding voice of the merchant user, comprising:

providing the merchant with a toggle that allows the merchant to selectively match a brand voice of current M or N short messages with a brand voice of past electronic messages.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 11, 2023
From: NATOLI, CHARLES; PATEL, DEVIN; HADJI, SOFIANE; KORCIA, GAL GILA; VESSELLA, NICK; HUSELID, ROBERT; PILIERO, ANDREW; MILLS, TRISTAN; MEHTA, HARSH
To: KLAVIYO, INC.
Reel/Frame 065824/0328 →
Continuity (2)
Continuation 18099133 · Jan 19, 2023
Related Publication 20240250922A1 · Jul 25, 2024
References Cited (97)
US 6424997B1 · Buskirk · 2002 [cited by applicant]
US 6549957B1 · Hanson · 2003 [cited by examiner]
US 7213202B1 · Kagle · 2007 [cited by applicant]
US 7257772B1 · Jones et al. · 2007 [cited by applicant]
US 7287218B1 · Knotz et al. · 2007 [cited by applicant]
US 7533090B2 · Agarwal et al. · 2009 [cited by applicant]
US 7752607B2 · Larab et al. · 2010 [cited by applicant]
US 7845950B2 · Driscoll et al. · 2010 [cited by applicant]
US 7975000B2 · Dixon et al. · 2011 [cited by applicant]
US 7975223B2 · Plumley et al. · 2011 [cited by applicant]
US 8250470B2 · Takashima · 2012 [cited by applicant]
US 8341224B2 · Kasetty et al. · 2012 [cited by applicant]
US 8434002B1 · Shah et al. · 2013 [cited by applicant]
US 8484156B2 · Hancsarik et al. · 2013 [cited by applicant]
US 8751327B2 · Park et al. · 2014 [cited by applicant]
US 9237233B2 · Soundar · 2016 [cited by applicant]
US 9430454B2 · Newman et al. · 2016 [cited by applicant]
US 9892420B2 · Sterns et al. · 2018 [cited by applicant]
US 10248657B2 · Prahlad et al. · 2019 [cited by applicant]
US 10331775B2 · Ryan et al. · 2019 [cited by applicant]
US 10614501B2 · Fredrich et al. · 2020 [cited by applicant]
US 10701005B2 · Nutt et al. · 2020 [cited by applicant]
US 10728200B2 · Miller et al. · 2020 [cited by applicant]
US 10817663B2 · Weald et al. · 2020 [cited by applicant]
US 11070511B2 · O'Brien et al. · 2021 [cited by applicant]
US 11144198B2 · Chen et al. · 2021 [cited by applicant]
US 11144980B2 · Fredrich et al. · 2021 [cited by applicant]
US 11265271B2 · Tetreault et al. · 2022 [cited by applicant]
US 11516158B1 · Luzhnica · 2022 [cited by examiner]
US 11880650B1 · Li et al. · 2024 [cited by applicant]
US 12299718B1 · Johnson et al. · 2025 [cited by applicant]
US 20050273705A1 · McCain · 2005 [cited by applicant]
US 20060225040A1 · Waddington · 2006 [cited by applicant]
US 20080178073A1 · Gao et al. · 2008 [cited by applicant]
US 20080189156A1 · Voda et al. · 2008 [cited by applicant]
US 20080249856A1 · Angell · 2008 [cited by examiner]
US 20090006936A1 · Parker et al. · 2009 [cited by applicant]
US 20090125518A1 · Bailor et al. · 2009 [cited by applicant]
US 20100281074A1 · Bailor et al. · 2010 [cited by applicant]
US 20110078246A1 · Dittmer-Roche · 2011 [cited by applicant]
US 20120042239A1 · O'Brien · 2012 [cited by applicant]
US 20120233554A1 · Vagell et al. · 2012 [cited by applicant]
US 20120294514A1 · Saunders et al. · 2012 [cited by applicant]
US 20130124956A1 · Hatfield et al. · 2013 [cited by applicant]
US 20140033101A1 · Rein et al. · 2014 [cited by applicant]
US 20140074591A1 · Allen · 2014 [cited by examiner]
US 20140278747A1 · Gumm · 2014 [cited by applicant]
US 20140282125A1 · Duneau · 2014 [cited by applicant]
US 20150363796A1 · Lehman et al. · 2015 [cited by applicant]
US 20160070717A1 · Bergner et al. · 2016 [cited by applicant]
US 20160117717A1 · Moreau et al. · 2016 [cited by applicant]
US 20160132472A1 · Campbell et al. · 2016 [cited by applicant]
US 20160189198A1 · Mckenzie · 2016 [cited by examiner]
US 20160241502A1 · Georgiou · 2016 [cited by applicant]
US 20170019697A1 · Hundemer · 2017 [cited by applicant]
US 20170091809A1 · Liu et al. · 2017 [cited by applicant]
US 20180027085A1 · Stanislaw et al. · 2018 [cited by applicant]
US 20180081868A1 · Willcock et al. · 2018 [cited by applicant]
US 20190043106A1 · Talmor et al. · 2019 [cited by applicant]
US 20190121827A1 · Boswell et al. · 2019 [cited by applicant]
US 20190197092A1 · Thiesen et al. · 2019 [cited by applicant]
US 20190228063A1 · El-Sherif et al. · 2019 [cited by applicant]
US 20200013092A1 · Liu et al. · 2020 [cited by applicant]
US 20200065857A1 · Lagi · 2020 [cited by examiner]
US 20200356624A1 · Cai et al. · 2020 [cited by applicant]
US 20210157974A1 · Xie · 2021 [cited by examiner]
US 20210217047A1 · Zhang · 2021 [cited by examiner]
US 20210224858A1 · Khoury · 2021 [cited by examiner]
US 20210389962A1 · Li · 2021 [cited by applicant]
US 20220036311A1 · Didrickson et al. · 2022 [cited by applicant]
US 20220113853A1 · Nostrini et al. · 2022 [cited by applicant]
US 20220188740A1 · Nazarali et al. · 2022 [cited by applicant]
US 20220335448A1 · Garg et al. · 2022 [cited by applicant]
US 20220414686A1 · Lawson et al. · 2022 [cited by applicant]
US 20230004711A1 · Bhatnagar et al. · 2023 [cited by applicant]
US 20230144617A1 · Karidi et al. · 2023 [cited by applicant]
US 20230298368A1 · Berger et al. · 2023 [cited by applicant]
US 20240144319A1 · Saidi et al. · 2024 [cited by applicant]
US 20240160902A1 · Padgett · 2024 [cited by examiner]
US 20240250922A1 · Natoli et al. · 2024 [cited by applicant]
US 20240273282A1 · Muralidharan · 2024 [cited by examiner]
US 20240428291A1 · Jain et al. · 2024 [cited by applicant]
US 20250111237A1 · Krishnamurthy · 2025 [cited by examiner]
US 20250131020A1 · Gupta · 2025 [cited by examiner]
US 20250323888A1 · Natoli et al. · 2025 [cited by applicant]
WO 0184383A2 · 2001 [cited by applicant]
WO 2008094712 · 2008 [cited by applicant]
WO 2016028831A1 · 2016 [cited by applicant]
11 Best Drag and Drop Word Press Page Builder Plugins, by Anna Fitzgerald, Nov. 13, 2020, pp. 1-21; https://blog.hubspot.com/website/top-5-free-drag-and-drop-wordpress-page-builder-plugins (Year: 2020). [cited by applicant]
Lindholm (A 3-way Merging Algorithm for Synchronizing Ordered Trees-the 3DM merging and differencing tool for XML, published Sep. 2001, pp. 1-205) (Year: 2001). [cited by applicant]
Lindholm (A Three-way Merge for XML Documents, published Oct. 2004, pp. 1-10) (Year: 2004). [cited by applicant]
Lindholm (XML Three-way Merge as a Reconciliation Engine for Mobile Data, published Sep. 2003, pp. 1-5) (Year: 2003). [cited by applicant]
P. Ghavare and P. Ahire, “Big Data Classification of Users Navigation and Behavior Using Web Server Logs,” 2018 Fourth International Conference on Computing Communication Control and Automation (ICCUBEA), Pune, India, 2… [cited by applicant]
P. He, X. Wen and W. Zheng, “A Novel Method for Filtering Group Sending Short Message Spam,” 2008 International Conference on Convergence and Hybrid Information Technology, Daejeon, Korea (South), 2008, pp. 60-65 (Year:… [cited by applicant]
S. Berger, R. Kjeldsen, C. Narayanaswami, C. Pinhanez, M. Podlaseck and M. Raghunath, “Using Symbiotic Displays to View Sensitive Information in Public,” Third IEEE International Conference on Pervasive Computing and Co… [cited by applicant]
WordPress Editor: Working With Blocks »Blocks, Jan. 1, 2021, pp. 1-6; https://wordpress.com/supporUwordpress-editor/blocks/ (Year: 2021). [cited by applicant]
Y.-S. Kim and S.-S. Kim, “Grant Model for Message Detour in Electronic Business System,” Future Generation Communication and Networking (FGCN 2007), Jeju, Korea (South), 2007, pp. 68-73 (Year: 2007). [cited by applicant]