IP Library Granted Patent US 10,943,295
Granted Patent B2
US 10,943,295 · App. 16/174,029 · Granted Mar 9, 2021

Credit repair by analysis of trade line properties

Inventor: Justin Randall Padawer (Bountiful, UT)
Assignee: PROGREXION IP, INC.
G06Q40/025G06Q40/02
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,943,295
App. No.
16/174,029
Granted
Mar 9, 2021
Kind
B2
Abstract

The automated generation of a unique letter or unique letters using one or more context variables for the letter. The contextual variables may represent author characteristics, audience characteristics, tone, word diversification, letter type, and so forth. Different entropy may be used for each letter to thereby generate a unique letter even if the context for the letters is the same. Nevertheless, each unique letter is suitable for the given context. If desired, the automatically generated letter may be further edited, for example, for grammatical, word choice, or legal content. Thus, the letter may appear to be custom drafted by a human for the context, whereas the letter was entirely or substantially computer-generated.

Claims (69)

1. A computer-implemented method that causes a computing system to generate a letter, the computing system comprising one or more processors and a memory storing computer-executable instructions that are executed by the one or more processors of the computing system for causing the computing system to perform the method, the method comprising:

generating a first random number;

selecting, based on the first random number, one text string from a first plurality of text strings;

generating a second random number;

selecting, based on the second random number, one text string from a second plurality of text strings;

generating a third random number;

selecting, based on the third random number, one text string from a third plurality of text strings;

obtaining a first set of rules that defines a mandatory ordering for each of the following letter portions: (a) the salutation of the letter, (b) the request for action in the letter, and (c) the signature block of the letter; and

generating the letter using at least the one text string selected from the first plurality of text strings, the one text string selected from the second plurality of text strings, and the one text string selected from the third plurality of text strings, wherein generating the letter is performed by evaluating the first set of rules against each of the following: (a) the one text string selected from the first plurality of text strings, (b) the one text string selected from the second plurality of text strings, and (c) the one text string selected from the third plurality of text strings.

2. The method of claim 1 , wherein the computing system further stores the following: (a) the first plurality of text strings, each of the first plurality of text strings being suitable for use in at least a first portion of a salutation in a letter, (b) the second plurality of text strings, each of the second plurality of text strings being suitable for use in at least a first portion of a request for action in a letter, and (c) the third plurality of text strings, each of the third plurality of text strings being suitable for use in at least a first portion of a signature block in a letter.

3. The method of claim 1 , wherein the computing system further stores a fourth plurality of text strings, each of the fourth plurality of text strings being suitable for use in at least a portion of a heading in a letter, the method further comprising:

generating a fourth random number;

deciding, based on the fourth random number, whether to include a heading in the letter; and

if, based on the fourth random number, a decision is made to include the heading in the letter:

generating a fifth random number;

selecting, based on the fifth random number, one text string from the fourth plurality of text strings; and

generating the letter also using the one text string selected from the fourth plurality of text strings.

4. The method of claim 3 , wherein a threshold is set for the fourth random number such that a decision to include the heading in the letter is made at least 80% of times in which the fourth random number is generated.

5. The method of claim 1 , wherein the computing system further stores a fourth plurality of text strings, each of the fourth plurality of text strings being suitable for use in at least a second portion of a salutation in a letter, the method further comprising:

generating a fourth random number;

selecting, based on the fourth random number, one text string from the fourth plurality of text strings; and

generating the letter also using the one text string selected from the fourth plurality of text strings.

6. The method of claim 1 , wherein the memory further stores a fourth plurality of text strings, each of the fourth plurality of text strings being suitable for use in at least a second portion of a request for action in a letter, the method further comprising:

generating a fourth random number;

selecting, based on the fourth random number, one text string from the fourth plurality of text strings; and

generating the letter also using the one text string selected from the fourth plurality of text strings.

7. The method of claim 1 , wherein the memory further stores a fourth plurality of text strings, each of the fourth plurality of text strings being suitable for use in at least a second portion of a signature block in a letter, the method further comprising:

generating a fourth random number;

selecting, based on the fourth random number, one text string from the fourth plurality of text strings; and

generating the letter also using the one text string selected from the fourth plurality of text strings.

8. The method of claim 1 , wherein said one text string from the first plurality of text strings is selected from the first plurality of text strings also based on a contextual variable, said one text string from the second plurality of text strings is selected from the second plurality of text strings also based on the contextual variable, and/or said one text string from the third plurality of text strings is selected from the third plurality of text strings also based on the contextual variable.

9. The method of claim 8 , wherein the contextual variable represents a tone for the letter.

10. The method of claim 8 , wherein the contextual variable represents an intended audience for the letter.

11. The method of claim 8 , wherein the contextual variable represents an attribute of a person on behalf of whom the letter is being generated.

12. The method of claim 8 wherein the contextual variable represents a type of the letter.

13. The method of claim 12 wherein the type of the letter is a credit repair letter.

14. The method of claim 1 , wherein the memory further stores (a) a fourth plurality of text strings, each of the fourth plurality of text strings being suitable for use in a header of a letter, (b) a fifth plurality of text strings, each of the fifth plurality of text strings being suitable for use in an introduction of a letter, (c) a sixth plurality of text strings, each of the sixth plurality of text strings being suitable for use in a conclusion of a letter, the method further comprising:

generating a fourth random number;

selecting, based on the fourth random number, one text string from the fourth plurality of text strings;

generating a fifth random number;

selecting, based on the fifth random number, one text string from the fifth plurality of text strings;

generating a sixth random number;

selecting, based on the sixth random number, one text string from the sixth plurality of text strings; and

generating the letter also using the one text string selected from the fourth plurality of text strings, the one text string selected from the fifth plurality of text strings, and the one text string selected from the sixth plurality of text strings.

15. The method of claim 1 , wherein there are sufficient numbers of text strings in the first plurality of text strings, the second plurality of text strings, and the third plurality of text strings so that the computing system is enabled to generate one of at least a thousand permutations of letters, including the letter, each letter in the at least the thousand permutations of letters being unique to all other letters in the at least the thousand permutations of letters.

16. The method of claim 1 , wherein there are sufficient numbers of text strings in the first plurality of text strings, the second plurality of text strings, and the third plurality of text strings so that the computing system is enabled to generate one of at least a million permutations of letters, including the letter, each letter in the at least the million permutations of letters being unique to all other letters in the at least the million permutations of letters.

17. The method of claim 5 , wherein said one text string from the first plurality of text strings is selected from the first plurality of text strings also based on a contextual variable, said one text string from the second plurality of text strings is selected from the second plurality of text strings also based on the contextual variable, said one text string from the third plurality of text strings is selected from the third plurality of text strings also based on the contextual variable, and/or said one text string from the fourth plurality of text strings is selected from the fourth plurality of text strings also based on the contextual variable.

18. The method of claim 17 , wherein the contextual variable represents a tone for the letter, an intended audience for the letter, an attribute of a person on behalf of whom the letter is being generated, or a type of the letter.

19. The method of claim 17 , wherein there are sufficient numbers of text strings in the first plurality of text strings, the second plurality of text strings, the third plurality of text strings, and the fourth plurality of strings such that the computing system is enabled to generate one of at least a thousand permutations of letters, including the letter, each letter in the at least the thousand permutations of letters being unique to all other letters in the at least the thousand permutations of letters.

20. A computing system comprising:

one or more hardware processors; and

one or more storage device storing computer-executable instructions that are executable by the one or more hardware processors to cause the computing system to generate a letter by performing the following:

generate a first random number;

select, based on the first random number, one text string from a first plurality of text strings;

generate a second random number;

select, based on the second random number, one text string from a second plurality of text strings;

generate a third random number;

select, based on the third random number, one text string from a third plurality of text strings;

obtain a first set of rules that defines a mandatory ordering for each of the following letter portions: (a) the salutation of the letter, (b) the request for action in the letter, and (c) the signature block of the letter; and

generate the letter using at least the one text string selected from the first plurality of text strings, the one text string selected from the second plurality of text strings, and the one text string selected from the third plurality of text strings, wherein generating the letter is performed by evaluating the first set of rules against each of the following: (a) the one text string selected from the first plurality of text strings, (b) the one text string selected from the second plurality of text strings, and (c) the one text string selected from the third plurality of text strings.

21. One or more hardware storage device storing computer-executable instructions that are executable by one or more hardware processors of a computing system for causing the computing system to generate a letter by performing the following:

generate a first random number;

select, based on the first random number, one text string from a first plurality of text strings;

generate a second random number;

select, based on the second random number, one text string from a second plurality of text strings;

generate a third random number;

select, based on the third random number, one text string from a third plurality of text strings;

obtain a first set of rules that defines a mandatory ordering for each of the following letter portions: (a) the salutation of the letter, (b) the request for action in the letter, and (c) the signature block of the letter; and

generate the letter using at least the one text string selected from the first plurality of text strings, the one text string selected from the second plurality of text strings, and the one text string selected from the third plurality of text strings, wherein generating the letter is performed by evaluating the first set of rules against each of the following: (a) the one text string selected from the first plurality of text strings, (b) the one text string selected from the second plurality of text strings, and (c) the one text string selected from the third plurality of text strings.

Assignments (11)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 10, 2024
From: PROGREXION IP, INC.
To: CREDIT.COM HOLDINGS, LLC
Reel/Frame 067061/0847 →
SECURITY INTEREST Recorded Feb 9, 2024
From: CREDIT.COM HOLDINGS, LLC
To: BLUE TORCH FINANCE LLC
Reel/Frame 066430/0706 →
SECURITY INTEREST Recorded Oct 19, 2023
From: PROGREXION IP, INC.; CREDIT.COM, INC.
To: CREDIT.COM HOLDINGS, LLC
Reel/Frame 065288/0385 →
SECURITY RELEASE - R/F 048788/0219 Recorded Jul 22, 2021
From: JEFFERIES FINANCE LLC, AS COLLATERAL AGENT
To: PROGREXION IP, INC.
Reel/Frame 056963/0806 →
SECURITY INTEREST Recorded Jul 21, 2021
From: PROGREXION IP, INC.
To: PROSPECT CAPITAL CORPORATION, AS THE COLLATERAL AGENT
Reel/Frame 056936/0075 →
SECURITY INTEREST Recorded Jul 21, 2021
From: PROGREXION IP, INC.
To: BLUE TORCH FINANCE LLC
Reel/Frame 056932/0408 →
ASSIGNMENT AND ASSUMPTION OF 1.5 LIEN PATENT SECURITY AGREEMENT Recorded Feb 2, 2021
From: H.I.G. PROGREXION, LLC
To: PROSPECT CAPITAL CORPORATION
Reel/Frame 055207/0647 →
1.5 LIEN PATENT SECURITY AGREEMENT Recorded May 28, 2020
From: PROGREXION IP, INC.
To: H.I.G. PROGREXION, LLC, AS COLLATERAL AGENT
Reel/Frame 052786/0286 →
SECURITY INTEREST Recorded Apr 3, 2019
From: PROGREXION IP, INC.
To: PROSPECT CAPITAL CORPORATION
Reel/Frame 048785/0642 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Apr 3, 2019
From: PROGREXION IP, INC.
To: JEFFERIES FINANCE LLC
Reel/Frame 048788/0219 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 29, 2018
From: PADAWER, JUSTIN RANDALL
To: PROGREXION IP, INC.
Reel/Frame 047344/0713 →
Continuity (5)
Continuation In Part 14611013 · Jan 30, 2015
Continuation In Part 13787552 · Mar 6, 2013
Continuation In Part 13772174 · Feb 20, 2013
Continuation 13626785 · Sep 25, 2012
Related Publication 20190205979A1 · Jul 4, 2019