IP Library Granted Patent US 12,380,276
Granted Patent B2
US 12,380,276 · App. 17/448,409 · Granted Aug 5, 2025

Capturing a subjective viewpoint of a financial market analyst via a machine-learned model

Inventors: Anthony Tassone (Saint Charles, IL); Tejas Shastry (Chicago, IL)
Assignee: VOXSMART LIMITED
G06F40/30G06N5/022G10L15/1815G10L15/22G06Q40/06
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,380,276
App. No.
17/448,409
Filed
Sep 22, 2021
Granted
Aug 5, 2025
Kind
B2
Art Unit
2681
USPC
704/9
Abstract

Systems and methods herein provide for establishing a subjective viewpoint in text. In one embodiment, a method includes identifying intents and metrics in each of a plurality of texts, calculating a sentiment score for each text based on the identified intents and metrics of each text, and calculating a disfluency score for each text to weight the sentiment score of each text. The method also includes training the machine learning model with the texts, and processing a subsequent text through the trained machine learning model to determine a sentiment score of the subsequent text.

Claims (34)

1. A method of establishing a subjective viewpoint of a text with a machine learning model, the method comprising:

identifying intents and metrics in each text of a plurality of texts;

calculating a sentiment score for each said text based on the identified intents and metrics of each said text;

calculating a disfluency score for each said text;

weighting the sentiment score of each said text based on the disfluency score;

training the machine learning model with the plurality of texts to create a trained machine learning model; and

processing a subsequent text through the trained machine learning model to determine a subsequent text sentiment score of the subsequent text.

2. The method of claim 1 , wherein: each said sentiment score is on a scale of −1 to +1, with −1 being most negative and +1 being most positive.

3. The method of claim 1 , wherein: identifying the intents and the metrics in each said text of the plurality of texts further comprises identifying the intents and the metrics in each said text of the plurality of texts via supervised learning.

4. The method of claim 1 , wherein: the disfluency score is a measure of a degree of fluency within each said text.

5. The method of claim 4 , wherein: repetitive words and filler words are identified by the model as disfluencies.

6. The method of claim 5 , further comprising: computing a ratio of the disfluencies to a total number of words to calculate the disfluency score for each said text.

7. The method of claim 1 , further comprising: transcribing a plurality of speech conversations with a natural language processor to correspondingly generate the plurality of texts.

8. A system for establishing a subjective viewpoint of a text with a machine learning model, the system comprising:

a database operable to store a plurality of texts that have each been labeled with identified intents and metrics;

a natural language processor operable to calculate a sentiment score for each text of the plurality of texts based on the identified intent labels and metrics of each said text, calculate a disfluency score for each said text, weight the sentiment score of each said text based on the disfluency score, train the machine learning model with the plurality of texts, and process a subsequent text through the trained machine learning model to determine a subsequent text sentiment score of the subsequent text.

9. The system of claim 8 , wherein: each said sentiment score is on a scale of −1 to +1, with −1 being most negative and +1 being most positive.

10. The system of claim 8 , wherein: the natural language processor is further operable to identify the intents and the metrics in each said text of the plurality of texts further via supervised learning.

11. The system of claim 8 , wherein: the disfluency score is a measure of a degree of fluency within each said text.

12. The system of claim 11 , wherein: repetitive words and filler words are identified by the model as disfluencies.

13. The system of claim 12 , further comprising: computing a ratio of the disfluencies to a total number of words to calculate the disfluency score for each said text.

14. The system of claim 8 , wherein: the natural language processor is further operable to transcribe a plurality of speech conversations to correspondingly generate the plurality of texts.

15. A non-transitory computer readable medium comprising instructions that, when executed by a processor, direct the processor to implement a machine learning model and to establish a subjective viewpoint of a text with the machine learning model, the instructions further directing the processor to:

identify intents and metrics in each text of a plurality of texts;

calculate a sentiment score for each said text based on the identified intents and metrics of each said text;

calculate a disfluency score for each said text;

weight the sentiment score of each said text based on the disfluency score;

train the machine learning model with the plurality of texts to create a trained machine learning model; and

process a subsequent text through the trained machine learning model to determine a subsequent text sentiment score of the subsequent text.

16. The non-transitory computer readable medium of claim 15 , wherein: each said sentiment score is on a scale of −1 to +1, with −1 being most negative and +1 being most positive.

17. The non-transitory computer readable medium of claim 15 , further comprising instructions that direct the processor to: identify the intents and the metrics in each of the plurality of texts further via supervised learning.

18. The non-transitory computer readable medium of claim 15 , wherein: the disfluency score is a measure of a degree of fluency within each said text.

19. The non-transitory computer readable medium of claim 18 , wherein: repetitive words and filler words are identified by the model as disfluencies.

20. The non-transitory computer readable medium of claim 19 , further comprising instructions that direct the processor to: compute a ratio of the disfluencies to a total number of words to calculate the disfluency score for each said text.

Assignments (3)
SECURITY INTEREST Recorded Oct 14, 2024
From: VOXSMART LIMITED
To: HSBC UK BANK PLC
Reel/Frame 068886/0008 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 23, 2024
From: GREEN KEY TECHNOLOGIES, INC.
To: VOXSMART LIMITED
Reel/Frame 068055/0225 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 29, 2022
From: TASSONE, ANTHONY; SHASTRY, TEJAS
To: GREEN KEY TECHNOLOGIES INC.
Reel/Frame 059769/0370 →
Continuity (2)
Provisional Application 63081778 · Sep 22, 2020
Related Publication 20220092268A1 · Mar 24, 2022
References Cited (64)
US 3296374A · Clapper · 1967 [cited by applicant]
US 7409349B2 · Wang et al. · 2008 [cited by applicant]
US 7447654B2 · Ben-Levy et al. · 2008 [cited by applicant]
US 7475046B1 · Foley et al. · 2009 [cited by applicant]
US 7533054B2 · Hausman et al. · 2009 [cited by applicant]
US 7536335B1 · Weston et al. · 2009 [cited by applicant]
US 7610549B2 · Vignet · 2009 [cited by applicant]
US 7643998B2 · Yuen et al. · 2010 [cited by applicant]
US 7685048B1 · Hausman et al. · 2010 [cited by applicant]
US 7689495B1 · Kim et al. · 2010 [cited by applicant]
US 7822672B2 · Hausman · 2010 [cited by applicant]
US 8019665B2 · Hausman · 2011 [cited by applicant]
US 8099352B2 · Berger et al. · 2012 [cited by applicant]
US 8321465B2 · Berger et al. · 2012 [cited by applicant]
US 8504483B2 · Foley et al. · 2013 [cited by applicant]
US 8682723B2 · Parsons et al. · 2014 [cited by applicant]
US 8788397B2 · Berger et al. · 2014 [cited by applicant]
US 8878853B2 · Baransky et al. · 2014 [cited by applicant]
US 9330659B2 · Ju et al. · 2016 [cited by applicant]
US 9728184B2 · Xue et al. · 2017 [cited by applicant]
US 9760566B2 · Heck et al. · 2017 [cited by applicant]
US 9774553B2 · Krka et al. · 2017 [cited by applicant]
US 9794206B2 · Shan et al. · 2017 [cited by applicant]
US 9870424B2 · Neystadt et al. · 2018 [cited by applicant]
US 10417340B2 · Applegate et al. · 2019 [cited by applicant]
US 10554817B1 · Sullivan · 2020 [cited by examiner]
US 10586556B2 · Caskey et al. · 2020 [cited by applicant]
US 10630560B2 · Adylov et al. · 2020 [cited by applicant]
US 10657962B2 · Zhang et al. · 2020 [cited by applicant]
US 20090292638A1 · Hausman · 2009 [cited by applicant]
US 20100121880A1 · Ursitti et al. · 2010 [cited by applicant]
US 20110270732A1 · Ritter et al. · 2011 [cited by applicant]
US 20130081056A1 · Hu et al. · 2013 [cited by applicant]
US 20130173247A1 · Hodson · 2013 [cited by applicant]
US 20130211880A1 · Kannan et al. · 2013 [cited by applicant]
US 20140006248A1 · Toffee · 2014 [cited by applicant]
US 20140081823A1 · Phadnis et al. · 2014 [cited by applicant]
US 20140114978A1 · Chatterjee et al. · 2014 [cited by applicant]
US 20140207651A1 · Toffey et al. · 2014 [cited by applicant]
US 20140289249A1 · Davis et al. · 2014 [cited by applicant]
US 20150310862A1 · Dauphin et al. · 2015 [cited by applicant]
US 20160217488A1 · Ward et al. · 2016 [cited by applicant]
US 20160301652A1 · Turski et al. · 2016 [cited by applicant]
US 20170132703A1 · Oomman et al. · 2017 [cited by applicant]
US 20180006973A1 · Hays et al. · 2018 [cited by applicant]
US 20180075147A1 · Bagheri et al. · 2018 [cited by applicant]
US 20180233139A1 · Finkelstein et al. · 2018 [cited by applicant]
US 20180239495A1 · Sharifi et al. · 2018 [cited by applicant]
US 20190108270A1 · Dunne et al. · 2019 [cited by applicant]
US 20190121907A1 · Brunn et al. · 2019 [cited by applicant]
US 20190318725A1 · Le Roux et al. · 2019 [cited by applicant]
US 20190325898A1 · O'Hart Kinney · 2019 [cited by examiner]
US 20200159826A1 · Lev Tov · 2020 [cited by examiner]
US 20200210907A1 · Ulizio et al. · 2020 [cited by applicant]
EP 2813983A1 · 2014 [cited by applicant]
Adams, Paige, et al., “Chapter 6: Conversational Thread Extraction and Topic Detection in Text-Based Chat”, Semantic Computing, edited by Sheu et al., © 2010 IEEE, pp. 87-113. [cited by applicant]
Elsner, Micha, et al., “Bounding and Comparing Methods for Correlation Clustering Beyond ILP”, NAACL HLT Workshop on Integer Linear Programming for Natural Language Processing, Boulder, CO, Jun. 2009, pp. 19-27. [cited by applicant]
Nicoletti, Maties, et al., “TopChat: encyclopedia-based topic identification from chat logs”, ASAI 2011, Cordoba, Argentina, Aug. 29-30, 2011, 12 pages. [cited by applicant]
Shen, Dou, et al., “Thread Detection in Dynamic Text Message Streams”, SIGIR '06, Seattle, WA, Aug. 6-11, 2006, pp. 35-42. [cited by applicant]
David M. Blei, et al.; “Latent Dirichlet Allocation”; Abstract; Jan. 2003; http://jmlr.csail.mit.edu/papers/v3/blei03a.html. [cited by applicant]
Liangjie Hong, et al.; “Empirical Study of Topic Modeling in Twitter”; SOMA '10 Proceedings of the First Workshop on Social Media Analytics; Washington DC; Jul. 25-28, 2010; 2 pages. [cited by applicant]
Micha Elsner, et al.; “Disentangling Chat”; Computational Linguistics; Association for Computational Linguistics; 2010; vol. 36, No. 3; 22 pages. [cited by applicant]
“Message Mining extracts price quotes from Bloomberg communications for use in applications”, bloomberg/ enterprise, 2016, 2 pages. [cited by applicant]
“AI at Bloomberg”, https://www.techatbloomberg.com/ai/, printed Jan. 6, 2021, 9 pages. [cited by applicant]