IP Library Granted Patent US 12,271,926
Granted Patent B2
US 12,271,926 · App. 17/657,687 · Granted Apr 8, 2025

Methods and systems for automated generation of personalized messages

Inventors: Marco Lagi (Medford, MA); Vedant Misra (Cambridge, MA); Kevin M. Walsh (Marion, MA); Scott Judson (Boston, MA)
Assignee: HubSpot, Inc.
G06Q30/0254G06F16/9535G06F16/9538G06N7/01G06N20/00G06Q30/0269
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,271,926
App. No.
17/657,687
Filed
Apr 1, 2022
Granted
Apr 8, 2025
Kind
B2
Examiner
DAGNEW, SABA
Art Unit
3621
USPC
705/14.52
Abstract

A system includes a set of crawlers that find and retrieve documents from an information network, an information extraction system, a knowledge graph storing nodes and edges that connect them, wherein each node represents a respective entity of a corresponding entity type of a plurality of entity types, and wherein the knowledge graph further stores event data relating to events detected by the information extraction system, a machine learning system that trains models that are used in connection with at least one of entity extraction, event extraction, recipient identification, and content generation, a lead scoring system that scores the relevance of information to an individual and references information in the knowledge graph, and a content generation system that generates content of a personalized message to a recipient who is an individual for which the lead scoring system has determined a threshold level of relevance.

Claims (63)

1. A computer-implemented method comprising:

dynamically updating a knowledge data structure to reflect a new entity identified by a crawler of a crawling system extracting information from an external data source over a communication network by:

identifying, by a machine learning system utilizing a classification model, the new entity from the information extracted by the crawler; and

dynamically updating the knowledge structure for the new entity by creating a new node and a new edge between the new node and an existing node within the knowledge data structure, wherein the new node represents the new entity and the new edge represents a new relationship identified by the machine learning system between the new entity and an existing entity represented by the existing node, wherein the knowledge structure is populated with:

entity data representing business entities and individual entities stored as objects within a customer relationship database (CRM) system and tracked using the knowledge structure;

relationship data of relationships between the business entities and individual entities; and

event data relating to events associated with the business entities and individual entities, wherein the event data is associated by the knowledge structure with the new node and the new edge connecting the new node to the existing node based upon the event data specifying an event that occurred between the new entity represented by the new node and the existing entity represented by the existing node;

determining, by a processing system using attributes of an ideal recipient identified based upon an objective of a message and historical data related to outcomes associated with previously sent messages generated to achieve the objective of the message, a recipient list based on a recipient profile and the knowledge data structure that stores entity data relating to entities and relationships between the entities;

generating and providing, by the processing system, a personalized message personalized to an individual in the recipient list based on the entity data and the relationships, wherein the processing system automatically generates the personalized message by:

automatically inferring a message template from historical data of users;

constructing personalized content based upon an objective of communicating with the individual; and

populating the message template with the personalized content to automatically generate the personalized message, wherein the message template is populated with directed content generated using the event data associated by the knowledge structure with the new node and the new edge.

2. The method of claim 1 , wherein the recipient list identifies individuals that are more likely to result in a successful outcome given the recipient profile and information represented in the knowledge data structure.

3. The method of claim 1 , wherein the knowledge data structure stores a plurality of nodes and a plurality of edges that connect respective nodes from the plurality of nodes, wherein each node represents a respective entity of a respective entity type and each edge corresponds to a respective relationship of a respective relationship type.

4. The method of claim 1 , wherein the knowledge data structure stores event data relating to a plurality of detected events relating to the entities and the relationships represented in the knowledge data structure; and the method further comprising:

extracting, by the processing system, a new event corresponding to the new entity, wherein extracting the new relationship is further based on the new event.

5. The method of claim 4 , wherein the new event is extracted using an event classification model that is trained to identify events indicated in documents.

6. The method of claim 1 , comprising:

utilizing a lead scoring system to filter entities from the knowledge data structure using an ideal recipient profile to create the recipient list, wherein lead scores are assigned to the entities using a lead scoring model.

7. The method of claim 1 , wherein the new entity is extracted using a classification model that is trained to identify entities indicated in digital documents crawled by the crawler.

8. The method of claim 1 , wherein the recipient profile indicates attributes of an ideal recipient of the message to be sent on behalf of a user.

9. The method of claim 8 , wherein the determining the recipient list comprises filtering one or more entities from the entities represented in the knowledge data structure based on the attributes.

10. The method of claim 8 , wherein the determining the recipient list comprises, for each individual of a subset of the individuals represented in the knowledge data structure, determining a lead score of each individual based on the attributes of the recipient profile using a machine-learned scoring model.

11. The method of claim 10 , wherein the lead score of each individual is further based on an event related to an organization of each individual.

12. The method of claim 1 , wherein the generating the personalized message for the individual comprises:

generating directed content based on retrieved entity data retrieved from the knowledge data structure, wherein the directed content comprises a phrase with information corresponding to the retrieved entity data, wherein the personalized message is generated based upon the directed content and the message template.

13. The method of claim 12 , wherein the directed content is generated based on a machine-learned generative model that is trained to generate text given entity data of an entity and a particular objective of the personalized message, and wherein message data indicates the particular objective of the personalized message.

14. The method of claim 1 , wherein the knowledge data structure stores event data relating to a plurality of detected events relating to the entities and the relationships represented in the knowledge data structure, wherein the personalized message is generated using directed content and the message template, and wherein the directed content is derived from the event data.

15. The method of claim 14 , wherein the directed content is generated based on a machine-learned generative model that is trained to generate text given a particular objective of the personalized message and the event data relating to a known event that occurred with respect to an entity and the particular objective of the personalized message, and wherein message data indicates the particular objective of the personalized message.

16. The method of claim 1 , wherein the processing system uses natural language processing to extract the new entity from one or more digital documents obtained from the crawler.

17. A system comprising:

memory comprising instructions; and

a processor configured to execute the instructions to perform operations comprising:

dynamically updating a knowledge data structure to reflect a new entity identified by a crawler of a crawling system extracting information from an external data source over a communication network by:

identifying, by a machine learning system utilizing a classification model, the new entity from the information extracted by the crawler; and

dynamically updating the knowledge structure for the new entity by creating a new node and a new edge between the new node and an existing node within the knowledge data structure, wherein the new node represents the new entity and the new edge represents a new relationship identified by the machine learning system between the new entity and an existing entity represented by the existing node, wherein the knowledge structure is populated with:

entity data representing business entities and individual entities stored as objects within a customer relationship database (CRM) system and tracked using the knowledge structure;

relationship data of relationships between the business entities and individual entities; and

event data relating to events associated with the business entities and individual entities, wherein the event data is associated by the knowledge structure with the new node and the new edge connecting the new node to the existing node based upon the event data specifying an event that occurred between the new entity represented by the new node and the existing entity represented by the existing node;

determining, by a processing system using attributes of an ideal recipient identified based upon an objective of a message and historical data related to outcomes associated with previously sent messages generated to achieve the objective of the message, a recipient list based on a recipient profile and the knowledge data structure that stores entity data relating to entities and relationships between the entities;

generating and providing, by the processing system, a personalized message personalized to an individual in the recipient list based on the entity data and the relationships, wherein the processing system automatically generates the personalized message by:

automatically inferring a message template from historical data of users;

constructing personalized content based upon an objective of communicating with the individual; and

populating the message template with the personalized content to automatically generate the personalized message, wherein the message template is populated with directed content generated using the event data associated by the knowledge structure with the new node and the new edge.

18. The system of claim 17 , wherein the knowledge data structure stores event data relating to the entities, and wherein the event data is used to generate the personalized message.

19. The system of claim 17 , wherein the crawler obtains digital documents include documents obtained from public internet websites.

20. The system of claim 17 , wherein the crawler is seeded with a set of resource identifiers from which to obtain digital documents.

21. A computer-implemented method comprising:

dynamically updating a knowledge data structure to reflect a new entity identified by a crawler of a crawling system extracting information from an external data source over a communication network by:

identifying, by a machine learning system utilizing a classification model, the new entity from the information extracted by the crawler; and

dynamically updating the knowledge structure for the new entity by creating a new node and a new edge between the new node and an existing node within the knowledge data structure, wherein the new node represents the new entity and the new edge represents a new relationship identified by the machine learning system between the new entity and an existing entity represented by the existing node, wherein the knowledge structure is populated with:

entity data representing business entities and individual entities stored as objects within a customer relationship database (CRM) system and tracked using the knowledge structure;

relationship data of relationships between the business entities and individual entities; and

event data relating to events associated with the business entities and individual entities, wherein the event data is associated by the knowledge structure with the new node and the new edge connecting the new node to the existing node based upon the event data specifying an event that occurred between the new entity represented by the new node and the existing entity represented by the existing node;

determining, by a processing system using attributes of an ideal recipient identified based upon an objective of a message and historical data related to outcomes associated with previously sent messages generated to achieve the objective of the message, a recipient list based on a recipient profile and the knowledge data structure that stores entity data relating to entities and relationships between the entities;

generating and providing, by the processing system, a personalized message personalized to an individual in the recipient list based on the entity data and the relationships, wherein the processing system automatically generates the personalized message by:

automatically inferring a message template from historical data of users;

constructing personalized content based upon an objective of communicating with the individual; and

populating the message template with the personalized content to automatically generate the personalized message, wherein the message template is populated with directed content generated using the event data associated by the knowledge structure with the new node and the new edge.

22. The method of claim 21 , wherein the knowledge data structure stores event data relating to a plurality of detected events, and wherein the personalized message is generated based upon the event data.

23. The method of claim 22 , further comprising:

extracting, by the processing system, a new event corresponding to the new entity, wherein extracting the new relationship is further based on the new event.

24. The method of claim 21 , wherein the knowledge data structure stores a plurality of nodes and a plurality of edges that connect respective nodes from the plurality of nodes, wherein each node represents a respective entity of a respective entity type and each edge corresponds to a respective relationship of a respective relationship type.

Assignments (2)
SECURITY INTEREST Recorded Feb 12, 2026
From: HUBSPOT, INC.
To: BANK OF AMERICA, N.A.
Reel/Frame 074818/0036 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 7, 2022
From: LAGI, MARCO; MISRA, VEDANT; WALSH, KEVIN; JUDSON, SCOTT
To: HUBSPOT, INC.
Reel/Frame 059537/0543 →
Continuity (4)
Continuation 16668696 · Oct 30, 2019
Continuation PCTUS2018032348 · May 11, 2018
Provisional Application 62504549 · May 11, 2017
Related Publication 20220222703A1 · Jul 14, 2022
References Cited (195)
US 7136941B2 · Nguyen et al. · 2006 [cited by applicant]
US 7539697B1 · Akella · 2009 [cited by examiner]
US 7580982B2 · Owen et al. · 2009 [cited by applicant]
US 7584114B2 · Estrada et al. · 2009 [cited by applicant]
US 7792835B2 · Bohannon et al. · 2010 [cited by applicant]
US 7831676B1 · Nagar · 2010 [cited by applicant]
US 7984297B2 · Bohannon et al. · 2011 [cited by applicant]
US 7992145B2 · Emerson et al. · 2011 [cited by applicant]
US 8006261B1 · Haberman et al. · 2011 [cited by applicant]
US 8224902B1 · Glasser et al. · 2012 [cited by applicant]
US 8442969B2 · Gross · 2013 [cited by applicant]
US 8594618B2 · Meyer et al. · 2013 [cited by applicant]
US 8706800B1 · Ahmed et al. · 2014 [cited by applicant]
US 8719356B2 · Dillingham et al. · 2014 [cited by applicant]
US 9304862B2 · Simon et al. · 2016 [cited by applicant]
US 9305104B2 · Wu et al. · 2016 [cited by applicant]
US 9317816B2 · Zeng et al. · 2016 [cited by applicant]
US 9356947B2 · Shraim et al. · 2016 [cited by applicant]
US 9852453B2 · Tuatini · 2017 [cited by examiner]
US 10115060B2 · Chestnut et al. · 2018 [cited by applicant]
US 10217058B2 · Gamon et al. · 2019 [cited by applicant]
US 10387559B1 · Wendt et al. · 2019 [cited by applicant]
US 10496678B1 · Tang · 2019 [cited by examiner]
US 10771425B2 · Kebinger et al. · 2020 [cited by applicant]
US 10826866B2 · Kramer et al. · 2020 [cited by applicant]
US 10853082B1 · Aleti et al. · 2020 [cited by applicant]
US 10867003B2 · O'Donnell et al. · 2020 [cited by applicant]
US 10911394B2 · Kramer et al. · 2021 [cited by applicant]
US 10931623B2 · O'Brien et al. · 2021 [cited by applicant]
US 10992780B1 · Rudrappa et al. · 2021 [cited by applicant]
US 11070511B2 · O'Brien et al. · 2021 [cited by applicant]
US 11165741B2 · O'Brien et al. · 2021 [cited by applicant]
US 11200581B2 · Williams et al. · 2021 [cited by applicant]
US 11240193B2 · O'Brien et al. · 2022 [cited by applicant]
US 20020099697A1 · Jensen-Grey · 2002 [cited by applicant]
US 20020152254A1 · Teng · 2002 [cited by applicant]
US 20020199194A1 · Ali · 2002 [cited by applicant]
US 20030097617A1 · Goeller et al. · 2003 [cited by applicant]
US 20030208472A1 · Pham · 2003 [cited by applicant]
US 20040034652A1 · Hofmann · 2004 [cited by applicant]
US 20040111327A1 · Kidd · 2004 [cited by applicant]
US 20040122803A1 · Dom et al. · 2004 [cited by applicant]
US 20040260621A1 · Foster · 2004 [cited by applicant]
US 20050160166A1 · Kraenzel · 2005 [cited by applicant]
US 20050188028A1 · Brown et al. · 2005 [cited by applicant]
US 20050210111A1 · Fukudome · 2005 [cited by applicant]
US 20050265319A1 · Clegg et al. · 2005 [cited by applicant]
US 20060095556A1 · Arnold et al. · 2006 [cited by applicant]
US 20060212931A1 · Shull et al. · 2006 [cited by applicant]
US 20060224673A1 · Stern et al. · 2006 [cited by applicant]
US 20060242140A1 · Wnek · 2006 [cited by applicant]
US 20070011073A1 · Gardner et al. · 2007 [cited by applicant]
US 20070136430A1 · Qureshi et al. · 2007 [cited by applicant]
US 20070203996A1 · Davitz et al. · 2007 [cited by applicant]
US 20070299777A1 · Shraim et al. · 2007 [cited by applicant]
US 20080027951A1 · Bohannon et al. · 2008 [cited by applicant]
US 20080034432A1 · Bohannon et al. · 2008 [cited by applicant]
US 20080168269A1 · Wilson · 2008 [cited by applicant]
US 20080172606A1 · White · 2008 [cited by applicant]
US 20090013041A1 · Farmer et al. · 2009 [cited by applicant]
US 20090019003A1 · Bohannon et al. · 2009 [cited by applicant]
US 20090119268A1 · Bandaru et al. · 2009 [cited by applicant]
US 20090138711A1 · Heimbigner · 2009 [cited by applicant]
US 20090248813A1 · Sawhney · 2009 [cited by applicant]
US 20100161506A1 · Bosenick et al. · 2010 [cited by applicant]
US 20100161735A1 · Sharma · 2010 [cited by applicant]
US 20100186088A1 · Banerjee et al. · 2010 [cited by applicant]
US 20100228777A1 · Imig et al. · 2010 [cited by applicant]
US 20100235915A1 · Memon et al. · 2010 [cited by applicant]
US 20100312837A1 · Bodapati et al. · 2010 [cited by applicant]
US 20110029504A1 · King et al. · 2011 [cited by applicant]
US 20110149725A1 · Zhao et al. · 2011 [cited by applicant]
US 20110179067A1 · Dalvi et al. · 2011 [cited by applicant]
US 20110258218A1 · Hayes et al. · 2011 [cited by applicant]
US 20120053887A1 · Nurmi · 2012 [cited by applicant]
US 20120191546A1 · Phelan et al. · 2012 [cited by applicant]
US 20120197862A1 · Woytowitz et al. · 2012 [cited by applicant]
US 20120198056A1 · Shama et al. · 2012 [cited by applicant]
US 20120202449A1 · Meyer et al. · 2012 [cited by applicant]
US 20120316904A1 · Eder · 2012 [cited by applicant]
US 20120324580A1 · Glasser et al. · 2012 [cited by applicant]
US 20130007627A1 · Monaco · 2013 [cited by applicant]
US 20130047034A1 · Salomon et al. · 2013 [cited by applicant]
US 20130054622A1 · Karmarkar et al. · 2013 [cited by applicant]
US 20130073336A1 · Heath · 2013 [cited by applicant]
US 20130138555A1 · Shishkov · 2013 [cited by applicant]
US 20130238715A1 · Sanyal et al. · 2013 [cited by applicant]
US 20130339456A1 · Nikolayev et al. · 2013 [cited by applicant]
US 20140006139A1 · Aggarwal et al. · 2014 [cited by applicant]
US 20140025683A1 · Howland et al. · 2014 [cited by applicant]
US 20140025763A1 · Furlong et al. · 2014 [cited by applicant]
US 20140105508A1 · Arora · 2014 [cited by applicant]
US 20140108309A1 · Frank et al. · 2014 [cited by applicant]
US 20140156681A1 · Lee et al. · 2014 [cited by applicant]
US 20140214974A1 · Kurzanski et al. · 2014 [cited by applicant]
US 20140236663A1 · Smith · 2014 [cited by applicant]
US 20140258169A1 · Wong et al. · 2014 [cited by applicant]
US 20140279622A1 · Bharadwaj et al. · 2014 [cited by applicant]
US 20140280453A1 · Mattison et al. · 2014 [cited by applicant]
US 20140280614A1 · Alakuijala et al. · 2014 [cited by applicant]
US 20140328172A1 · Kumar et al. · 2014 [cited by applicant]
US 20140351261A1 · Aswani · 2014 [cited by examiner]
US 20140372363A1 · Chestnut et al. · 2014 [cited by applicant]
US 20140372566A1 · Milne et al. · 2014 [cited by applicant]
US 20150006647A1 · Steinberg et al. · 2015 [cited by applicant]
US 20150019910A1 · Simon et al. · 2015 [cited by applicant]
US 20150032826A1 · Gunaratnam · 2015 [cited by applicant]
US 20150032827A1 · Tyler et al. · 2015 [cited by applicant]
US 20150081611A1 · Shivakumar · 2015 [cited by applicant]
US 20150100896A1 · Shmarovoz et al. · 2015 [cited by applicant]
US 20150154664A1 · Dawson et al. · 2015 [cited by applicant]
US 20150188874A1 · Feinstein · 2015 [cited by applicant]
US 20150237061A1 · Shraim et al. · 2015 [cited by applicant]
US 20150248490A1 · Myslinski · 2015 [cited by applicant]
US 20150286357A1 · Penha et al. · 2015 [cited by applicant]
US 20150312187A1 · Menna et al. · 2015 [cited by applicant]
US 20150324469A1 · Keyngnaert et al. · 2015 [cited by applicant]
US 20150347924A1 · Zeng et al. · 2015 [cited by applicant]
US 20150379018A1 · Gur et al. · 2015 [cited by applicant]
US 20150381552A1 · Vijay et al. · 2015 [cited by applicant]
US 20160012364A1 · Filgueiras · 2016 [cited by applicant]
US 20160020917A1 · Tuatini et al. · 2016 [cited by applicant]
US 20160026720A1 · Lehrer et al. · 2016 [cited by applicant]
US 20160036750A1 · Yuan · 2016 [cited by applicant]
US 20160048548A1 · Thomas · 2016 [cited by examiner]
US 20160063560A1 · Hameed et al. · 2016 [cited by applicant]
US 20160078455A1 · O'Donnell et al. · 2016 [cited by applicant]
US 20160119260A1 · Ghafourifar et al. · 2016 [cited by applicant]
US 20160156858A1 · Lee et al. · 2016 [cited by applicant]
US 20160180248A1 · Regan · 2016 [cited by applicant]
US 20160226808A1 · Lin · 2016 [cited by applicant]
US 20160232540A1 · Gao et al. · 2016 [cited by applicant]
US 20160307191A1 · Turgeman et al. · 2016 [cited by applicant]
US 20160315969A1 · Goldstein · 2016 [cited by applicant]
US 20160359793A1 · Kraios · 2016 [cited by applicant]
US 20160371288A1 · Le Biannic · 2016 [cited by examiner]
US 20170005954A1 · Shaltiel et al. · 2017 [cited by applicant]
US 20170031894A1 · Bettersworth et al. · 2017 [cited by applicant]
US 20170068982A1 · Vangala et al. · 2017 [cited by applicant]
US 20170103439A1 · Kolb et al. · 2017 [cited by applicant]
US 20170103441A1 · Kolb et al. · 2017 [cited by applicant]
US 20170186042A1 · Wong et al. · 2017 [cited by applicant]
US 20170221089A1 · Zhu et al. · 2017 [cited by applicant]
US 20170255862A1 · Li · 2017 [cited by examiner]
US 20170264577A1 · Ganin et al. · 2017 [cited by applicant]
US 20170289287A1 · Modi et al. · 2017 [cited by applicant]
US 20170317962A1 · Chen · 2017 [cited by applicant]
US 20170337569A1 · Sasson · 2017 [cited by applicant]
US 20170344711A1 · Liu · 2017 [cited by examiner]
US 20170353410A1 · Gonzales · 2017 [cited by applicant]
US 20180039696A1 · Zhai · 2018 [cited by examiner]
US 20180097759A1 · Brechbuhl et al. · 2018 [cited by applicant]
US 20180097828A1 · Coskun · 2018 [cited by applicant]
US 20180103004A1 · Demir · 2018 [cited by examiner]
US 20180121986A1 · Akkiraju et al. · 2018 [cited by applicant]
US 20180137203A1 · Hennekey et al. · 2018 [cited by applicant]
US 20180219818A1 · Kramer et al. · 2018 [cited by applicant]
US 20180219819A1 · O'Brien et al. · 2018 [cited by applicant]
US 20180219820A1 · Kramer et al. · 2018 [cited by applicant]
US 20180219829A1 · Kebinger et al. · 2018 [cited by applicant]
US 20180219830A1 · O'Brien et al. · 2018 [cited by applicant]
US 20180336495A1 · Chestnut et al. · 2018 [cited by applicant]
US 20190347668A1 · Williams et al. · 2019 [cited by applicant]
US 20200036673A1 · O'Brien et al. · 2020 [cited by applicant]
US 20200065857A1 · Lagi et al. · 2020 [cited by applicant]
US 20200067861A1 · Leddy et al. · 2020 [cited by applicant]
US 20200210867A1 · Banis et al. · 2020 [cited by applicant]
US 20200244615A1 · O'Brien et al. · 2020 [cited by applicant]
US 20210349960A1 · Hennekey et al. · 2021 [cited by applicant]
US 20210352037A1 · O'Brien et al. · 2021 [cited by applicant]
US 20210357375A1 · Urdiales et al. · 2021 [cited by applicant]
US 20210357378A1 · Urdiales et al. · 2021 [cited by applicant]
US 20220067750A1 · Williams et al. · 2022 [cited by applicant]
US 20220092028A1 · Layton et al. · 2022 [cited by applicant]
WO 2016156858A1 · 2016 [cited by applicant]
WO 2018089619A1 · 2018 [cited by applicant]
WO 2018140975A1 · 2018 [cited by applicant]
WO 2018209254A1 · 2018 [cited by applicant]
Givens, Brien , “Bounded Knapsack Algorithm”, www.codeproject.com,https://www.codeproject.com/Articles/706838/Bounded-Knapsack-Algorithm, Jan. 8, 2014, 5 pages. [cited by applicant]
Godiksen, Brian , “Best Practices with Sender Policy Framework (SPF)”, www.socketlabs.com,https://www.socketlabs.com/blog/best-practices-sender-policy-framework-spf/, Sep. 14, 2017, 16 pages. [cited by applicant]
Gorrell, Amy , “How to Build Your SPF Record in 5 Simple Steps”, validity.com, https://www.validity.com/blog/how-to-build-your-spf-record-in-5-simple-steps/, Feb. 9, 2019, 3 pages. [cited by applicant]
PCT/US18/32348 , “International Application Serial No. PCT/US18/32348, International Preliminary Report on Patentability mailed Nov. 21, 2019”, HubSpot, Inc., 9 pages. [cited by applicant]
PCT/US18/32348 , “International Application Serial No. PCT/US18/32348, International Search Report and Written Opinion mailed Jul. 30, 2018”, HubSpot, Inc., 10 Pages. [cited by applicant]
PCT/US2017/060835 , “International Application Serial No. PCT/US2017/060835, International Preliminary Report on Patentability mailed May 23, 2019”, HubSpot, Inc., 7 pages. [cited by applicant]
PCT/US2017/060835 , “International Application Serial No. PCT/US2017/060835, International Search Report and Written Opinion mailed Feb. 14, 2018”, HubSpot Inc., 12 pages. [cited by applicant]
PCT/US2018/016038 , “International Application Serial No. PCT/US2018/016038, International Preliminary Report on Patentability mailed Aug. 8, 2019”, HubSpot, Inc., 8 pages. [cited by applicant]
PCT/US2018/016038 , “International Application Serial No. PCT/US2018/016038, International Search Report and the Written Opinion mailed May 29, 2018.”, Hubspot Inc., 12 pages. [cited by applicant]
PCT/US2018/016038 , “International Application Serial No. PCT/US2018/016038, Invitation to Pay Additional Fees and, Where Applicable, Protest Fee mailed on Apr. 2, 2018”, Hubspot Inc., 3 pages. [cited by applicant]
Qureshi , et al., “Improving the Performance of Crawler Using Body Text Normalization”, 2 Compusoft 7, 2013, pp. 215, 216. [cited by applicant]
U.S. Appl. No. 17/121,300, filed Dec. 14, 2020, Pending, U.S. Appl. No. 17/121,300. [cited by applicant]
U.S. Appl. No. 17/655,320, filed Mar. 17, 2022, Pending, U.S. Appl. No. 17/655,320. [cited by applicant]
U.S. Appl. No. 17/654,519, filed Mar. 11, 2022, Pending, U.S. Appl. No. 17/654,519. [cited by applicant]
U.S. Appl. No. 17/654,535, filed Mar. 11, 2022, Pending, U.S. Appl. No. 17/654,535. [cited by applicant]
U.S. Appl. No. 17/654,542, filed Mar. 11, 2022, Pending, U.S. Appl. No. 17/654,542. [cited by applicant]
U.S. Appl. No. 17/654,544, filed Mar. 11, 2022, Pending, U.S. Appl. No. 17/654,544. [cited by applicant]