IP Library › Granted Patent US 12,229,522
Granted Patent B2
US 12,229,522 · App. 18/515,025 · Granted Feb 18, 2025

Text reduction and analysis interface to a text generation modeling system

Inventors: Marcin Gajek (Berkeley, CA); Shang Gao (Knoxville, TN); Divyanshu Murli (Seattle, WA); Ryan Walker (Lancaster, PA); Walter DeFoor (Rockville, MD); Javed Qadrud-Din (Union City, CA)
Assignee: Casetext, Inc.
G06F40/40G06F16/3329G06F40/289G06F40/205
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,229,522
App. No.
18/515,025
Granted
Feb 18, 2025
Kind
B2
Abstract

A query request identifying a query and a plurality of text portions for determining an answer to the query may be received. Relevance scores corresponding with respective ones of the text portions may be determined based on application of one or more machine learning models to the respective text portion and the query. A subset of the text portions may be selected based on the relevance scores. A response message to the query request including an answer to the query in natural language text generated by a large language model based on the first subset of text portions may be determined.

Claims (44)

1. A method comprising:

receiving via a communication interface a request to generate a timeline based on a plurality of input documents;

determining a plurality of event identification prompts via a processor, an event identification prompt of the plurality of event identification prompts being determined by replacing a designated one or more fillable portions of an event identification prompt template with a respective text portion of the plurality of input documents, the event identification prompt and the event identification prompt template each including a natural language event identification instruction to identify events based on the respective text portion;

identifying an initial plurality of event entries based on novel text generated by a generative language model executing the natural language event identification instruction in the plurality of event identification prompts;

determining a deduplicated plurality of event entries based on the initial plurality of event entries; and

transmitting to a client machine a timeline generation message that includes an instruction for generating the timeline, the instruction including information for representing the deduplicated plurality of event entries on the timeline.

2. The method recited in claim 1 , wherein the event identification prompt includes a natural language notability instruction instructing the generative language model to generate text characterizing notability of the events.

3. The method recited in claim 2 , wherein an initial event entry of the initial plurality of event entries includes a notability text portion characterizing notability of the initial event entry.

4. The method recited in claim 1 , wherein the event identification prompt includes a date portion that identifies a date on which the event identification prompt is created.

5. The method recited in claim 1 , wherein identifying the initial plurality of event entries involves parsing structured text generated in accordance with a predetermined output format identified in a natural language output format portion of the event identification prompt template.

6. The method recited in claim 1 , the method further comprising:

transmitting the plurality of event identification prompts to a remote text generation system; and

receiving from the remote text generation system a corresponding plurality of completed event identification prompts generated by the generative language model based on the plurality of event identification prompts.

7. The method recited in claim 1 , wherein determining the deduplicated plurality of event entries comprises:

determining an event deduplication prompt via the processor by replacing one or more fillable portions of an event deduplication prompt template with the initial plurality of event entries, the event deduplication prompt and the event deduplication prompt template each including a natural language event deduplication instruction to deduplicate the initial plurality of event entries.

8. The method recited in claim 7 , wherein the deduplicated plurality of event entries are determined based on deduplicated event text generated by the generative language model executing the natural language event deduplication instruction in the event deduplication prompt.

9. The method recited in claim 7 , the method further comprising:

transmitting the event deduplication prompt to a remote text generation system; and

receiving from the remote text generation system a completed event deduplication prompt by the generative language model based on the event deduplication prompt.

10. A system comprising:

a communication interface configured to receive a request to generate a timeline based on a plurality of input documents;

a processor configured to determine a plurality of event identification prompts, an event identification prompt of the plurality of event identification prompts being determined by replacing a designated one or more fillable portions of an event identification prompt template with a respective text portion of the plurality of input documents, the event identification prompt and the event identification prompt template each including a natural language event identification instruction to identify events based on the respective text portion;

memory configured to store an initial plurality of event entries identified based on novel text generated by a generative language model executing the natural language event identification instruction in the plurality of event identification prompts, wherein the processor is further configured to determine a deduplicated plurality of event entries based on the initial plurality of event entries, and wherein the communication interface is further configured to transmit to a client machine a timeline generation message that includes an instruction for generating the timeline, the instruction including information for representing the deduplicated plurality of event entries on the timeline.

11. The system recited in claim 10 , wherein the event identification prompt includes a natural language notability instruction instructing the generative language model to generate text characterizing notability of the events.

12. The system recited in claim 11 , wherein an initial event entry of the initial plurality of event entries includes a notability text portion characterizing notability of the initial event entry.

13. The system recited in claim 10 , wherein the event identification prompt includes a date portion that identifies a date on which the event identification prompt is created.

14. The system recited in claim 10 , wherein identifying the initial plurality of event entries involves parsing structured text generated in accordance with a predetermined output format identified in a natural language output format portion of the event identification prompt template.

15. The system recited in claim 10 , wherein determining the deduplicated plurality of event entries comprises:

determining an event deduplication prompt via the processor by replacing one or more fillable portions of an event deduplication prompt template with the initial plurality of event entries, the event deduplication prompt and the event deduplication prompt template each including a natural language event deduplication instruction to deduplicate the initial plurality of event entries.

16. The system recited in claim 15 , wherein the deduplicated plurality of event entries are determined based on deduplicated event text generated by the generative language model executing the natural language event deduplication instruction in the event deduplication prompt.

17. One or more non-transitory computer-readable media having instructions stored thereon for performing a method, the method comprising:

receiving via a communication interface a request to generate a timeline based on a plurality of input documents;

determining a plurality of event identification prompts via a processor, an event identification prompt of the plurality of event identification prompts being determined by replacing a designated one or more fillable portions of an event identification prompt template with a respective text portion of the plurality of input documents, the event identification prompt and the event identification prompt template each including a natural language event identification instruction to identify events based on the respective text portion;

identifying an initial plurality of event entries based on novel text generated by a generative language model executing the natural language event identification instruction in the plurality of event identification prompts;

determining a deduplicated plurality of event entries based on the initial plurality of event entries; and

transmitting to a client machine a timeline generation message that includes an instruction for generating the timeline, the instruction including information for representing the deduplicated plurality of event entries on the timeline.

18. The non-transitory computer-readable media recited in claim 17 , wherein the event identification prompt includes a natural language notability instruction instructing the generative language model to generate text characterizing notability of the events, wherein an initial event entry of the initial plurality of event entries includes a notability text portion characterizing notability of the initial event entry.

19. The non-transitory computer-readable media recited in claim 17 , the method further comprising:

transmitting the plurality of event identification prompts to a remote text generation system; and

receiving from the remote text generation system a corresponding plurality of completed event identification prompts generated by the generative language model based on the plurality of event identification prompts.

20. The non-transitory computer-readable media recited in claim 17 , wherein determining the deduplicated plurality of event entries comprises:

determining an event deduplication prompt via the processor by replacing one or more fillable portions of an event deduplication prompt template with the initial plurality of event entries, the event deduplication prompt and the event deduplication prompt template each including a natural language event deduplication instruction to deduplicate the initial plurality of event entries, wherein the deduplicated plurality of event entries are determined based on deduplicated event text generated by the generative language model executing the natural language event deduplication instruction in the event deduplication prompt, the method further comprising:

transmitting the event deduplication prompt to a remote text generation system; and

receiving from the remote text generation system a completed event deduplication prompt by the generative language model based on the event deduplication prompt.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 21, 2023
From: GAJEK, MARCIN; GAO, SHANG; MURLI, DIVYANSHU; WALKER, RYAN; DEFOOR, WALTER; QADRUD-DIN, JAVED
To: CASETEXT, INC.
Reel/Frame 065635/0597 →
Continuity (3)
Continuation 18333320 · Jun 12, 2023
Provisional Application 63487185 · Feb 27, 2023
Related Publication 20240289559A1 · Aug 29, 2024
References Cited (153)
US 7257766B1 · Koppel et al. · 2007 [cited by applicant]
US 7293012B1 · Solaro et al. · 2007 [cited by applicant]
US 7567953B2 · Kadayam et al. · 2009 [cited by applicant]
US 8380710B1 · Finne et al. · 2013 [cited by applicant]
US 8635228B2 · Shahabi et al. · 2014 [cited by applicant]
US 8812291B2 · Brants et al. · 2014 [cited by applicant]
US 9146967B2 · Dean et al. · 2015 [cited by applicant]
US 10565639B1 · Ghamsari et al. · 2020 [cited by applicant]
US 11086949B1 · Desai · 2021 [cited by examiner]
US 11263188B2 · Arnold et al. · 2022 [cited by applicant]
US 11281976B2 · Dua et al. · 2022 [cited by applicant]
US 11288444B2 · Munro et al. · 2022 [cited by applicant]
US 11314811B1 · Hume et al. · 2022 [cited by applicant]
US 11321329B1 · Shih et al. · 2022 [cited by applicant]
US 11481416B2 · Dua et al. · 2022 [cited by applicant]
US 11765207B1 · McCarthy · 2023 [cited by applicant]
US 11797610B1 · Ferrucci et al. · 2023 [cited by applicant]
US 11860914B1 · Qadrud-Din et al. · 2024 [cited by applicant]
US 11861320B1 · Gajek et al. · 2024 [cited by applicant]
US 11861321B1 · O'kelly et al. · 2024 [cited by applicant]
US 11972223B1 · DeFoor et al. · 2024 [cited by applicant]
US 11995411B1 · Qadrud-Din et al. · 2024 [cited by applicant]
US 12067366B1 · Heller et al. · 2024 [cited by applicant]
US 12111858B1 · Radhakrishnan · 2024 [cited by examiner]
US 20020169595A1 · Agichtein et al. · 2002 [cited by applicant]
US 20040215606A1 · Cossock · 2004 [cited by applicant]
US 20050108219A1 · Huerga · 2005 [cited by applicant]
US 20060074865A1 · Merrigan et al. · 2006 [cited by applicant]
US 20070022109A1 · Imielinski et al. · 2007 [cited by applicant]
US 20070266331A1 · Bicker et al. · 2007 [cited by applicant]
US 20090083248A1 · Liu et al. · 2009 [cited by applicant]
US 20100145673A1 · Cancedda · 2010 [cited by applicant]
US 20110125734A1 · Duboue et al. · 2011 [cited by applicant]
US 20120030201A1 · Pickering et al. · 2012 [cited by applicant]
US 20130073995A1 · Piantino · 2013 [cited by examiner]
US 20140067374A1 · Wilkins et al. · 2014 [cited by applicant]
US 20140129559A1 · Estes · 2014 [cited by examiner]
US 20140172907A1 · Dubbels et al. · 2014 [cited by applicant]
US 20140358889A1 · Shmiel et al. · 2014 [cited by applicant]
US 20150026212A1 · Fink et al. · 2015 [cited by applicant]
US 20150169574A1 · Bau · 2015 [cited by examiner]
US 20150370421A1 · Joshi · 2015 [cited by examiner]
US 20160078149A1 · Gaucher et al. · 2016 [cited by applicant]
US 20160196351A1 · Bank · 2016 [cited by examiner]
US 20170286849A1 · Myslinski · 2017 [cited by applicant]
US 20170351754A1 · Devarakonda · 2017 [cited by examiner]
US 20180075011A1 · Allen et al. · 2018 [cited by applicant]
US 20180322110A1 · Rhodes et al. · 2018 [cited by applicant]
US 20180329987A1 · Tata et al. · 2018 [cited by applicant]
US 20190042551A1 · Hwang · 2019 [cited by applicant]
US 20190286753A1 · Feng et al. · 2019 [cited by applicant]
US 20190311064A1 · Chakraborty et al. · 2019 [cited by applicant]
US 20190347563A1 · Bruno et al. · 2019 [cited by applicant]
US 20200019642A1 · Dua et al. · 2020 [cited by applicant]
US 20200065346A1 · Boni et al. · 2020 [cited by applicant]
US 20200159783A1 · Shlyunkin et al. · 2020 [cited by applicant]
US 20200243076A1 · Kim · 2020 [cited by applicant]
US 20200342036A1 · Fowlkes et al. · 2020 [cited by applicant]
US 20200342862A1 · Gao et al. · 2020 [cited by applicant]
US 20200364403A1 · Choi et al. · 2020 [cited by applicant]
US 20210056261A1 · Sullivan et al. · 2021 [cited by applicant]
US 20210081499A1 · Rakshit et al. · 2021 [cited by applicant]
US 20210124876A1 · Kryscinski et al. · 2021 [cited by applicant]
US 20210271823A1 · De Ridder · 2021 [cited by applicant]
US 20210326428A1 · Edwards et al. · 2021 [cited by applicant]
US 20210374341A1 · Krause et al. · 2021 [cited by applicant]
US 20210406475A1 · Tang et al. · 2021 [cited by applicant]
US 20210406735A1 · Nahamoo et al. · 2021 [cited by applicant]
US 20220051479A1 · Agarwal et al. · 2022 [cited by applicant]
US 20220092095A1 · Shukla et al. · 2022 [cited by applicant]
US 20220164397A1 · Escalona et al. · 2022 [cited by applicant]
US 20220180051A1 · Lillemo et al. · 2022 [cited by applicant]
US 20220197958A1 · Volynets et al. · 2022 [cited by applicant]
US 20220253447A1 · Boytsov et al. · 2022 [cited by applicant]
US 20220261429A1 · Refaeli et al. · 2022 [cited by applicant]
US 20220284174A1 · Galitsky · 2022 [cited by applicant]
US 20220300718A1 · Chen et al. · 2022 [cited by applicant]
US 20220318230A1 · Sikka et al. · 2022 [cited by applicant]
US 20220318255A1 · Fei et al. · 2022 [cited by applicant]
US 20220357929A1 · Vijayaraghavan et al. · 2022 [cited by applicant]
US 20220366127A1 · Desh et al. · 2022 [cited by applicant]
US 20220374459A1 · Liu et al. · 2022 [cited by applicant]
US 20220382975A1 · Gu et al. · 2022 [cited by applicant]
US 20230034011A1 · Sarkar et al. · 2023 [cited by applicant]
US 20230080674A1 · Attali et al. · 2023 [cited by applicant]
US 20230108863A1 · Gunasekara et al. · 2023 [cited by applicant]
US 20230121711A1 · Chhaya et al. · 2023 [cited by applicant]
US 20230237277A1 · Reza et al. · 2023 [cited by applicant]
US 20230245051A1 · Vuyyuri et al. · 2023 [cited by applicant]
US 20230274084A1 · Modani et al. · 2023 [cited by applicant]
US 20230316001A1 · Araki · 2023 [cited by applicant]
US 20230351105A1 · Mammen · 2023 [cited by applicant]
US 20240202452A1 · Schillace · 2024 [cited by examiner]
US 20240242037A1 · Heller et al. · 2024 [cited by applicant]
US 20240273309A1 · Heller et al. · 2024 [cited by applicant]
US 20240289363A1 · Qadrud-Din et al. · 2024 [cited by applicant]
US 20240289561A1 · Qadrud-Din et al. · 2024 [cited by applicant]
US 20240303421A1 · Fabian et al. · 2024 [cited by applicant]
US 20240303424A1 · Reddy et al. · 2024 [cited by applicant]
CN 109213870A · 2019 [cited by applicant]
JP 2021152837A · 2021 [cited by applicant]
KR 101868421B1 · 2018 [cited by applicant]
WO 2024151396A1 · 2024 [cited by applicant]
U.S. Appl. No. 18/154,175, filed Jan. 13, 2023, Jake Heller. [cited by applicant]
U.S. Appl. No. 18/169,701, filed Feb. 15, 2023, Jake Heller. [cited by applicant]
U.S. Appl. No. 18/169,707, filed Feb. 15, 2023, Jake Heller. [cited by applicant]
U.S. Appl. No. 18/329,035, filed Jun. 5, 2023, Javed Qadrud-Din. [cited by applicant]
U.S. Appl. No. 18/329,039, filed Jun. 5, 2023, Javed Qadrud-Din. [cited by applicant]
U.S. Appl. No. 18/344,344, filed Jun. 29, 2023, Brian O'Kelly. [cited by applicant]
U.S. Appl. No. 18/362,733, filed Jul. 31, 2023, Walter DeFoor. [cited by applicant]
U.S. Appl. No. 18/362,738, filed Jul. 31, 2023, Walter DeFoor. [cited by applicant]
U.S. Appl. No. 18/450,776, filed Aug. 16, 2023, Alan deLevie. [cited by applicant]
Aggarwal, Vi nay, et al. “Clause Rec: A Clause Recommendation Framework for AI-aided Contract Authoring.” arXiv preprint arXiv :2110.15794 (2021), pp. 1-7 (Year: 2021). [cited by applicant]
U.S. Appl. No. 18/154,175, Final Office Action mailed Jun. 29, 2023, 22 pgs. [cited by applicant]
U.S. Appl. No. 18/154,175, Non Final Office Action mailed Apr. 21, 2023, 20 pgs. [cited by applicant]
U.S. Appl. No. 18/169,701, Final Office Action mailed Jun. 29, 2023, 42 pgs. [cited by applicant]
U.S. Appl. No. 18/169,701, Non Final Office Action mailed May 3, 2023, 38 pgs. [cited by applicant]
U.S. Appl. No. 18/169,707, Non Final Office Action mailed May 10, 2023, 33 pgs. [cited by applicant]
U.S. Appl. No. 18/329,035, Notice of Allowance mailed Aug. 25, 2023, 21 pgs. [cited by applicant]
U.S. Appl. No. 18/333,320, Non Final Office Action mailed Aug. 7, 2023, 13 pgs. [cited by applicant]
U.S. Appl. No. 18/333,320, Notice of Allowance mailed Aug. 22, 2023, 13 pgs. [cited by applicant]
U.S. Appl. No. 18/344,344, Notice of Allowance mailed Aug. 30, 2023, 10 pgs. [cited by applicant]
U.S. Appl. No. 18/362,738, Non Final Office Action mailed Oct. 24, 2023, 15 pgs. [cited by applicant]
Arruda, Andrew. “An ethical obligation to use artificial intelligence: An examination of the use of artificial intelligence in law and the model rules of professional responsibility.” Am. J. Trial Advoc. 40 (2016), pp. … [cited by applicant]
Chalkidis, Ilias, et al. “Legal-Bert: The muppets straight out of law school.” arXiv preprint arXiv:2010.02559 (2020), pp. 1-7 (Year: 2020). [cited by applicant]
Chen et al. (“Data Extraction via Semantic Regular Expression Synthesis.” arXiv preprint arXiv:2305.10401 (May 17, 2023)) (Year: 2023). [cited by applicant]
Definition of Database at dictionary.com, available at https://web.archive.org/web/20221213223226/https://www.dictionary.com/ browse/database (archived on Dec. 13, 2022) (Year: 2022). [cited by applicant]
Joshi, Sagar, et al. “Investigating Strategies for Clause Recommendation.” arXiv preprint arXiv:2301.10716 (Jan. 21, 2023), pp. 1-10 (Year: 2023). [cited by applicant]
Kolt, Noam. “Predicting consumer contracts.” Berkeley Tech. LJ 37 (2022), pp. 71-138. (Year: 2022). [cited by applicant]
Lam, Kwok-Yan, et al. “Applying Large Language Models for Enhancing Contract Drafting.” (Jun. 19, 2023), pp. 1-11 (Year: 2023). [cited by applicant]
Lewis, Patrick et al. Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks. Facebook AI Research, University College London; New York University; Apr. 12, 2021. [cited by applicant]
Phelps, Teresa, and Kevin Ashley. ““Alexa, Write a Memo”: The Promise and Challenges of AI and Legal Writing.” Legal Writing: J. Legal Writing Inst. 26 (2022), pp. 329-387 (Year: 2022). [cited by applicant]
Trummer, Immanuel. “CodexDB: Generating Code for Processing SOL Queries using GPT-3 Codex.” arXiv preprint arXiv: 2204.08941 (2022), pp. 1-7 (Year: 2022). [cited by applicant]
Wang, Shuyue, and P. Jin. “A Brief Summary of Prompting in Using GPT Models.” (Apr. 2023), pp. 1-14 (Year: 2023). [cited by applicant]
U.S. Appl. No. 18/169,707, Final Office Action mailed Jan. 4, 2024, 38 pgs. [cited by applicant]
U.S. Appl. No. 18/169,707, Non Final Office Action mailed Apr. 19, 2024, 31 pgs. [cited by applicant]
U.S. Appl. No. 18/169,707, Notice of Allowance mailed Sep. 16, 2024, 21 pgs. [cited by applicant]
U.S. Appl. No. 18/329,039, Notice of Allowance mailed Jan. 22, 2024, 8 pgs. [cited by applicant]
U.S. Appl. No. 18/362,733, Final Office Action mailed May 31, 2024, 46 pgs. [cited by applicant]
U.S. Appl. No. 18/362,733, Non Final Office Action mailed Oct. 17, 2024, 33 pgs. [cited by applicant]
U.S. Appl. No. 18/362,738, Notice of Allowance mailed Jan. 4, 2024, 10 pgs. [cited by applicant]
U.S. Appl. No. 18/515,014, Non Final Office Action mailed Jul. 2, 2024, 10 pgs. [cited by applicant]
Barsha et al., “Natural Language Interface to Database by Regular Expression Generation.” 2021 5th International Conference on Electrical Information and Communication Technology (EICT). IEEE, (Year: 2021). [cited by applicant]
International Application Serial No. PCT/US23/84899, Search Report and Written Opinion mailed May 21, 2024, 12 pgs. [cited by applicant]
International Application Serial No. PCT/US23/84903, Search Report and Written Opinion mailed Apr. 26, 2024, 9 pgs. [cited by applicant]
International Application Serial No. PCT/US23/84905, Search Report and Written Opinion mailed Apr. 26, 2024, 10 pgs. [cited by applicant]
International Application Serial No. PCT/US23/84915, Search Report and Written Opinion mailed Apr. 24, 2024, 9 pgs. [cited by applicant]
International Application Serial No. PCT/US24/24021, Search Report and Written Opinion mailed May 16, 2024, 7 pgs. [cited by applicant]
International Application Serial No. PCT/US24/24038, Search Report and Written Opinion mailed Jul. 30, 2024, 21 pgs. [cited by applicant]
International Application Serial No. PCT/US24/24047, Search Report and Written Opinion mailed Jul. 24, 2024, 9 pgs. [cited by applicant]
Trummer, Immanuel. “CodexDB: Generating Code for Processing QL Queries using GPT-3 Codex.” arXiv preprint arXiv: 2204.08941 (2022), pp. 1-7 (Year:2022). [cited by applicant]
Wang, Wenjin, et al. “Layout and task aware instruction prompt for zero-shot document image question answering.” arXiv preprint arXiv:2306.00526 (Jun. 1, 2023), pp. 1-11 (Year: 2023). [cited by applicant]
Zhang, Yanzhe, et al. “Llavar: Enhanced visual instruction tuning for text-rich image understanding.” arXiv preprint arXiv: 2306.17107 (Jun. 29, 2023), pp. 1-21 (Year: 2023). [cited by applicant]
Cited By (6)
US 12,549,499 US 12,670,327 US 12,675,512 US 12,701,093 US 12,737,434 US 12,737,558