IP Library › Granted Patent US 12,711,051
Granted Patent B2
US 12,711,051 · App. 18/462,071 · Granted Aug 18, 2026

Error checking for code

Inventors: Brian Mark Fields (Phoenix, AZ); Nathan L. Tofte (Downs, IL); Joseph Robert Brannan (Bloomington, IL); Vicki King (Bloomington, IL); Justin Davis (Bloomington, IL)
Assignee: STATE FARM MUTUAL AUTOMOBILE INSURANCE COMPANY
G06F11/3698G06F8/65G06F11/3604G06F11/3688H04L51/02G06Q40/08
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,711,051
App. No.
18/462,071
Filed
Sep 6, 2023
Granted
Aug 18, 2026
Kind
B2
Art Unit
2113
USPC
714/38.1
Abstract

Apparatuses, systems and methods are provided for checking code for errors. The apparatuses, systems and methods may send a target code and a prompt for code checking to a machine learning (ML) chatbot to cause the ML chatbot to check the target code for errors. The apparatuses, systems and methods may determine whether there is an error in the target code based at least partially on a response from the ML chatbot. The apparatuses, systems and methods may, responsive to determining that there is an error in the target code, determine, via an interaction with the ML chatbot, a solution to fix the error. The apparatuses, systems and methods may analyze the solution to determine a number of at least one of (i) a set of steps or (ii) a set of interactions required by the solution. The apparatuses, systems and methods may, responsive to determining that the number exceeds a predetermined threshold, fix the error by implementing the solution with respect to the target code.

Claims (80)

1 . A computer system for using a machine learning (ML) chatbot to check errors associated with a target code, the computer system comprising:

one or more processors; and

a memory storing executable instructions thereon that, when executed by the one or more processors, cause the one or more processors to:

receive, from a user device, an indication of the target code, wherein the target code includes a plurality of modules;

for each module of the plurality of modules, send a first prompt for code checking to a respective ML chatbot of a plurality of ML chatbots to cause the respective ML chatbot to check the module for errors;

for each module determined to be having an error:

extract, from a response from the respective ML chatbot, a module-specific solution for fixing the error;

send a second prompt to the respective ML chatbot to update the module based upon the error and the module-specific solution to the error;

determine whether the updated module fixes the error by:

(i) executing the updated module in connection with a test case in a test environment to generate an implementation result, wherein the test case checks for the error and is associated with an expected result defined by the test case, and

(ii) determining whether the implementation result complies with the expected result; and

responsive to determining that the implementation result does not comply with the expected result, send a third prompt to the respective ML chatbot to further update the updated module based upon the implementation result, and repeating steps (i) and (ii) with the further updated module;

responsive to determining that, for the each module determined to be having an error, a respective implementation result complies with a respective expected result, generate an overall solution to the error based upon one or more updated modules; and

transmit, to the user device, an indication of the overall solution for implementation by a user of the user device.

2 . The computer system of claim 1 , wherein to cause the respective ML chatbot to check the module for errors, the executable instructions, when executed by the one or more processors, cause the one or more processors to:

send the first prompt to cause the respective ML chatbot to check the module with the test case for errors.

3 . The computer system of claim 1 , wherein to update the module, the executable instructions, when executed by the one or more processors, cause the one or more processors to:

generate the second prompt based upon the module-specific solution;

send the second prompt to the ML chatbot to generate executable instructions associated with the module-specific solution; and

execute the executable instructions associated with the module-specific solution to update the module.

4 . The computer system of claim 1 , wherein the module-specific solution includes a first step and a second step, the second step comprising a plurality of action options, and wherein to update the module, the executable instructions, when executed by the one or more processors, further cause the one or more processors to:

send the second prompt to the ML chatbot to generate an intermediate updated version of the module based upon the first step;

implement the intermediate updated version of the module in the test environment to obtain an intermediate implementation result;

select an action option from the plurality of action options based upon the intermediate implementation result; and

send a fourth prompt to generate the updated version of the module based upon the selected action option.

5 . The computer system of claim 1 , wherein the executable instructions, when executed by the one or more processors, further cause the one or more processors to:

generate at least one of an image, an audio, or a video associated with the overall solution; and

present the at least one of the image, the audio, or the video to a user.

6 . A computer-implemented method for using a machine learning (ML) chatbot to check errors associated with a target code, the method comprising:

receiving, by one or more processors from a user device, an indication of the target code, wherein the target code includes a plurality of modules;

for each module of the plurality of modules, sending, by the one or more processors, a first prompt for code checking to a respective ML chatbot of a plurality of ML chatbots to cause the respective ML chatbot to check the module for errors;

for each module determined to be having an error;

extracting, by the one or more processors and from a response from the respective ML chatbot, a module-specific solution for fixing the error;

sending, by the one or more processors, a second prompt to the respective ML chatbot to update the module based upon the error and the module-specific solution to the error;

determining, by the one or more processors, whether the updated module fixes the error by:

(i) executing the updated module in connection with a test case in a test environment to generate an implementation result, wherein the test case checks for the error and is associated with an expected result defined by the test case, and

(ii) determining whether the implementation result complies with the expected result; and

responsive to determining that the implementation result does not comply with the expected result, sending, by the one or more processors, a third prompt to the respective ML chatbot to further update the updated module based upon the implementation result, and repeating steps (i) and (ii) with the further updated module;

responsive to determining that, for the each module determined to be having an error, a respective implementation result complies with a respective expected result, generating an overall solution to the error based upon one or more updated modules; and

transmitting, by the one or more processors and to the user device, an indication of the overall solution for implementation by a user of the user device.

7 . The computer-implemented method of claim 6 , wherein causing the respective ML chatbot to check the module for errors includes:

sending, by the one or more processors, the first prompt to cause the respective ML chatbot to check the module with the test case for errors.

8 . The computer-implemented method of claim 6 , wherein updating the module includes:

generating, by the one or more processors, the second prompt based upon the module-specific solution;

sending, by the one or more processors, the second prompt to the ML chatbot to generate executable instructions associated with the module-specific solution; and

executing, by the one or more processors, the executable instructions associated with the module-specific solution to update the module.

9 . The computer-implemented method of claim 6 , wherein the module-specific solution includes a first step and a second step, the second step comprising a plurality of action options, and wherein updating the module includes:

sending, by the one or more processors, the second prompt to the ML chatbot to generate an intermediate updated version of the module;

implementing, by the one or more processors, the intermediate updated version of the module in the test environment to obtain an intermediate implementation result;

selecting, by the one or more processors, an action option from the plurality of action options based upon the intermediate implementation result; and

sending a fourth prompt, by the one or more processors, to generate the updated version of the module based upon the selected action option.

10 . The computer-implemented method of claim 6 , further comprising:

generating, by the one or more processors, at least one of an image, an audio, or a video associated with the overall solution; and

presenting, by the one or more processors, the at least one of the image, the audio, or the video to a user.

11 . A non-transitory computer-readable storage medium comprising computer-readable instructions stored thereon for using a machine learning (ML) chatbot to check errors associated with a target code, wherein the computer-readable instructions when executed on one or more processors cause the one or more processors to:

receive, from a user device, an indication of the target code, wherein the target code includes a plurality of modules;

for each module of the plurality of modules, send a first prompt for code checking to a respective ML chatbot of a plurality of ML chatbots to cause the respective ML chatbot to check the module for errors;

for each module determined to be having an error:

extract, from a response from the respective ML chatbot, a module-specific solution for fixing the error;

send a second prompt to the respective ML chatbot to update the module based upon the error and the module-specific solution to the error;

determine whether the updated module fixes the error by:

(i) executing the updated module in connection with a test case in a test environment to generate an implementation result, wherein the test case checks for the error and is associated with an expected result defined by the test case, and

(ii) determining whether the implementation result complies with the expected result; and

responsive to determining that the implementation result does not comply with the expected result, send a third prompt to the respective ML chatbot to further update the updated module based upon the implementation result, and repeating steps (i) and (ii) with the further updated module;

responsive to determining that, for the each module determined to be having an error, a respective implementation result complies with a respective expected result, generate an overall solution to the error based upon one or more updated modules; and

transmit, to the user device, an indication of the overall solution for implementation by a user of the user device.

12 . The non-transitory computer-readable storage medium of claim 11 , wherein to cause the respective ML chatbot to check the module for errors, the computer-readable instructions, when executed by the one or more processors, further cause the one or more processors to:

send the first prompt to cause the respective ML chatbot to check the module with the test case to check for errors.

13 . The non-transitory computer-readable storage medium of claim 11 , wherein to update the module, the computer-readable instructions, when executed by the one or more processors, cause the one or more processors to:

generate the second prompt based upon the module-specific solution;

send the second prompt to the ML chatbot to generate executable instructions associated with the module-specific solution; and

execute the executable instructions associated with the module-specific solution to update the module.

14 . The non-transitory computer-readable storage medium of claim 11 , wherein the module-specific solution includes a first step and a second step, the second step comprising a plurality of action options, and wherein to update the module, the computer-readable instructions, when executed by the one or more processors, cause the one or more processors to:

send the second prompt to the ML chatbot to generate an intermediate updated version of the module based upon the first step;

implement the intermediate updated version of the module in the test environment to obtain an intermediate implementation result;

select an action option from the plurality of action options based upon the intermediate implementation result; and

send a fourth prompt to generate the updated version of the module based upon the selected action option.

15 . The non-transitory computer-readable storage medium of claim 11 , wherein the computer-readable instructions, when executed by the one or more processors, further cause the one or more processors to:

generate at least one of an image, an audio, or a video associated with the overall solution; and

present the at least one of the image, the audio, or the video to a user.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 12, 2023
From: FIELDS, BRIAN MARK; BRANNAN, JOSEPH ROBERT; DAVIS, JUSTIN; KING, VICKI; TOFTE, NATHAN L
To: STATE FARM MUTUAL AUTOMOBILE INSURANCE COMPANY
Reel/Frame 064872/0509 →
Continuity (5)
Provisional Application 63464073 · May 4, 2023
Provisional Application 63464061 · May 4, 2023
Provisional Application 63489843 · Mar 13, 2023
Provisional Application 63489852 · Mar 13, 2023
Related Publication 20240311271A1 · Sep 19, 2024
References Cited (214)
US 7698342B1 · Evans et al. · 2010 [cited by applicant]
US 8095393B2 · Seifert et al. · 2012 [cited by applicant]
US 8346563B1 · Hjelm · 2013 [cited by examiner]
US 9830748B2 · Rosenbaum · 2017 [cited by applicant]
US 9990782B2 · Rosenbaum · 2018 [cited by applicant]
US 10043217B1 · Bolden et al. · 2018 [cited by applicant]
US 10055793B1 · Call et al. · 2018 [cited by applicant]
US 10181159B1 · Allen et al. · 2019 [cited by applicant]
US 10217068B1 · Davis et al. · 2019 [cited by applicant]
US 10229394B1 · Davis et al. · 2019 [cited by applicant]
US 10269190B2 · Rosenbaum · 2019 [cited by applicant]
US 10387966B1 · Shah et al. · 2019 [cited by applicant]
US 10467824B2 · Rosenbaum · 2019 [cited by applicant]
US 10482554B1 · Vukich et al. · 2019 [cited by applicant]
US 10497250B1 · Hayward et al. · 2019 [cited by applicant]
US 10535104B1 · Mitchell et al. · 2020 [cited by applicant]
US 10579971B1 · Davis et al. · 2020 [cited by applicant]
US 10635751B1 · Relangi et al. · 2020 [cited by applicant]
US 10679296B1 · Devereaux et al. · 2020 [cited by applicant]
US 10769953B1 · Salles et al. · 2020 [cited by applicant]
US 11038821B1 · Harding et al. · 2021 [cited by applicant]
US 11087404B1 · Devereaux et al. · 2021 [cited by applicant]
US 11127081B1 · Kullman et al. · 2021 [cited by applicant]
US 11227452B2 · Rosenbaum · 2022 [cited by applicant]
US 11238506B1 · Tomlinson et al. · 2022 [cited by applicant]
US 11250515B1 · Feiteira et al. · 2022 [cited by applicant]
US 11407410B2 · Rosenbaum · 2022 [cited by applicant]
US 11438283B1 · White et al. · 2022 [cited by applicant]
US 11518391B1 · Sanchez · 2022 [cited by applicant]
US 11524707B2 · Rosenbaum · 2022 [cited by applicant]
US 11544807B1 · Breitweiser et al. · 2023 [cited by applicant]
US 11594083B1 · Rosenbaum · 2023 [cited by applicant]
US 11669907B1 · Behrens et al. · 2023 [cited by applicant]
US 11693726B2 · Lozano et al. · 2023 [cited by applicant]
US 11720903B1 · Henryson et al. · 2023 [cited by applicant]
US 11757807B2 · Bhardwaj et al. · 2023 [cited by applicant]
US 11783421B2 · Huls · 2023 [cited by applicant]
US 11790296B1 · Henryson et al. · 2023 [cited by applicant]
US 11818111B1 · Debolt · 2023 [cited by examiner]
US 11836805B1 · Culbertson et al. · 2023 [cited by applicant]
US 11837004B1 · Agrahari et al. · 2023 [cited by applicant]
US 11922515B1 · Lombard et al. · 2024 [cited by applicant]
US 12087152B1 · Buentello et al. · 2024 [cited by applicant]
US 12217606B1 · Cheng et al. · 2025 [cited by applicant]
US 12236377B2 · Sohum et al. · 2025 [cited by applicant]
US 20010027403A1 · Peterson et al. · 2001 [cited by applicant]
US 20010037265A1 · Kleinberg · 2001 [cited by applicant]
US 20020002475A1 · Freedman et al. · 2002 [cited by applicant]
US 20020112011A1 · Washington · 2002 [cited by applicant]
US 20030028448A1 · Joseph et al. · 2003 [cited by applicant]
US 20060212566A1 · Boujard et al. · 2006 [cited by applicant]
US 20080056473A1 · Kent et al. · 2008 [cited by applicant]
US 20090125320A1 · Bickett · 2009 [cited by applicant]
US 20090240531A1 · Hilborn · 2009 [cited by applicant]
US 20090287509A1 · Basak et al. · 2009 [cited by applicant]
US 20100145734A1 · Becerra et al. · 2010 [cited by applicant]
US 20110119574A1 · Rogers et al. · 2011 [cited by applicant]
US 20110295623A1 · Behringer et al. · 2011 [cited by applicant]
US 20110313794A1 · Feeney · 2011 [cited by applicant]
US 20120101852A1 · Albert · 2012 [cited by applicant]
US 20120124485A1 · Scherpa et al. · 2012 [cited by applicant]
US 20120143634A1 · Beyda et al. · 2012 [cited by applicant]
US 20120303390A1 · Brook et al. · 2012 [cited by applicant]
US 20130204619A1 · Berman · 2013 [cited by examiner]
US 20130218603A1 · Hagelstein et al. · 2013 [cited by applicant]
US 20130226624A1 · Blessman et al. · 2013 [cited by applicant]
US 20140094991A1 · Bouillet et al. · 2014 [cited by applicant]
US 20140100892A1 · Collopy et al. · 2014 [cited by applicant]
US 20140222469A1 · Stahl et al. · 2014 [cited by applicant]
US 20140358731A1 · Itte et al. · 2014 [cited by applicant]
US 20140379385A1 · Duncan et al. · 2014 [cited by applicant]
US 20150170288A1 · Harton et al. · 2015 [cited by applicant]
US 20150213556A1 · Haller, Jr. · 2015 [cited by applicant]
US 20150338235A1 · Schmidt et al. · 2015 [cited by applicant]
US 20150339759A1 · Pope et al. · 2015 [cited by applicant]
US 20160041069A1 · Huang et al. · 2016 [cited by applicant]
US 20160071217A1 · Edwards et al. · 2016 [cited by applicant]
US 20160086231A1 · Darey · 2016 [cited by applicant]
US 20160238397A1 · Caira et al. · 2016 [cited by applicant]
US 20160273181A1 · Smith · 2016 [cited by applicant]
US 20170004508A1 · Mansfield et al. · 2017 [cited by applicant]
US 20170060694A1 · Makhov et al. · 2017 [cited by applicant]
US 20170103346A1 · Bodell et al. · 2017 [cited by applicant]
US 20170132643A1 · Sagade et al. · 2017 [cited by applicant]
US 20170132666A1 · Slavin · 2017 [cited by applicant]
US 20170191848A1 · Jones · 2017 [cited by applicant]
US 20180047288A1 · Cordell et al. · 2018 [cited by applicant]
US 20180075538A1 · Konrardy et al. · 2018 [cited by applicant]
US 20180082683A1 · Chen et al. · 2018 [cited by applicant]
US 20180173999A1 · Renard · 2018 [cited by applicant]
US 20180293483A1 · Abramson et al. · 2018 [cited by applicant]
US 20180293660A1 · Rakshe et al. · 2018 [cited by applicant]
US 20180334176A1 · Park · 2018 [cited by applicant]
US 20190037077A1 · Konig et al. · 2019 [cited by applicant]
US 20190095822A1 · Rugel et al. · 2019 [cited by applicant]
US 20190114715A1 · Hessinger et al. · 2019 [cited by applicant]
US 20190122121A1 · Yu · 2019 [cited by applicant]
US 20190306327A1 · Matysiak · 2019 [cited by examiner]
US 20190332661A1 · Halprin et al. · 2019 [cited by applicant]
US 20190391827A1 · Simanovich et al. · 2019 [cited by applicant]
US 20200019893A1 · Lu · 2020 [cited by applicant]
US 20200042649A1 · Bakis et al. · 2020 [cited by applicant]
US 20200104876A1 · Chintakindi et al. · 2020 [cited by applicant]
US 20200143481A1 · Brown et al. · 2020 [cited by applicant]
US 20200154170A1 · Wu et al. · 2020 [cited by applicant]
US 20200167134A1 · Dey · 2020 [cited by examiner]
US 20200210490A1 · Hutchins · 2020 [cited by applicant]
US 20200274962A1 · Martin et al. · 2020 [cited by applicant]
US 20200285225A1 · Lankehanumaiah · 2020 [cited by examiner]
US 20200339160A1 · Rosenbaum · 2020 [cited by applicant]
US 20210064932A1 · Wang et al. · 2021 [cited by applicant]
US 20210073330A1 · Inagaki et al. · 2021 [cited by applicant]
US 20210117923A1 · Gray et al. · 2021 [cited by applicant]
US 20210152496A1 · Kim et al. · 2021 [cited by applicant]
US 20210200950A1 · Basu · 2021 [cited by examiner]
US 20210203784A1 · Konig et al. · 2021 [cited by applicant]
US 20210256616A1 · Hayward et al. · 2021 [cited by applicant]
US 20210271820A1 · Raghupatruni et al. · 2021 [cited by applicant]
US 20210273892A1 · Rakshit · 2021 [cited by applicant]
US 20210295203A1 · Liao et al. · 2021 [cited by applicant]
US 20210350357A1 · Lafontaine · 2021 [cited by applicant]
US 20210357771A1 · Flowers et al. · 2021 [cited by applicant]
US 20210357790A1 · Volkov et al. · 2021 [cited by applicant]
US 20210365955A1 · Galante et al. · 2021 [cited by applicant]
US 20210366048A1 · Westhues et al. · 2021 [cited by applicant]
US 20210374092A1 · Sahay · 2021 [cited by examiner]
US 20210383494A1 · Leise et al. · 2021 [cited by applicant]
US 20210390950A1 · Kumar et al. · 2021 [cited by applicant]
US 20210406938A1 · Thakral · 2021 [cited by applicant]
US 20220004630A1 · Almukaynizi et al. · 2022 [cited by applicant]
US 20220019496A1 · Lozano · 2022 [cited by examiner]
US 20220091957A1 · Szczepanik · 2022 [cited by examiner]
US 20220092893A1 · Rosenbaum · 2022 [cited by applicant]
US 20220094789A1 · Lau · 2022 [cited by examiner]
US 20220114594A1 · Nunes et al. · 2022 [cited by applicant]
US 20220136847A1 · Higuchi et al. · 2022 [cited by applicant]
US 20220176971A1 · Nordh · 2022 [cited by applicant]
US 20220198531A1 · Cleaver et al. · 2022 [cited by applicant]
US 20220261535A1 · Madaan et al. · 2022 [cited by applicant]
US 20220269583A1 · Plawecki · 2022 [cited by applicant]
US 20220279014A1 · Stokes et al. · 2022 [cited by applicant]
US 20220293107A1 · Leaman et al. · 2022 [cited by applicant]
US 20220300993A1 · Chaudhry et al. · 2022 [cited by applicant]
US 20220308943A1 · Srinivasan · 2022 [cited by examiner]
US 20220340148A1 · Rosenbaum · 2022 [cited by applicant]
US 20220366459A1 · Vieyra · 2022 [cited by applicant]
US 20230005070A1 · Nguyen et al. · 2023 [cited by applicant]
US 20230017739A1 · Feldman et al. · 2023 [cited by applicant]
US 20230023869A1 · Ganesan · 2023 [cited by examiner]
US 20230060300A1 · Rosenbaum · 2023 [cited by applicant]
US 20230064816A1 · Matsuoka et al. · 2023 [cited by applicant]
US 20230105564A1 · Breitweiser et al. · 2023 [cited by applicant]
US 20230108454A1 · Gidwaney et al. · 2023 [cited by applicant]
US 20230110941A1 · Makhija et al. · 2023 [cited by applicant]
US 20230116639A1 · Patt et al. · 2023 [cited by applicant]
US 20230140931A1 · Anderson et al. · 2023 [cited by applicant]
US 20230141853A1 · Vu et al. · 2023 [cited by applicant]
US 20230244938A1 · Wei · 2023 [cited by examiner]
US 20230259821A1 · Travalini et al. · 2023 [cited by applicant]
US 20230267512A1 · Isackson et al. · 2023 [cited by applicant]
US 20230267694A1 · Breitweiser et al. · 2023 [cited by applicant]
US 20230290502A1 · Zhi et al. · 2023 [cited by applicant]
US 20230298567A1 · Tan et al. · 2023 [cited by applicant]
US 20230316412A1 · Behrens et al. · 2023 [cited by applicant]
US 20230343149A1 · Volos et al. · 2023 [cited by applicant]
US 20230385939A1 · Tsuchiyma et al. · 2023 [cited by applicant]
US 20230410801A1 · Mishra · 2023 [cited by applicant]
US 20240073219A1 · Maizels et al. · 2024 [cited by applicant]
US 20240102814A1 · Karri et al. · 2024 [cited by applicant]
US 20240119424A1 · Lofvers et al. · 2024 [cited by applicant]
US 20240167864A1 · Donovan et al. · 2024 [cited by applicant]
US 20240168611A1 · Pham et al. · 2024 [cited by applicant]
US 20240248920A1 · Qiao et al. · 2024 [cited by applicant]
US 20240249557A1 · Chavali · 2024 [cited by examiner]
US 20240256780A1 · Douglas et al. · 2024 [cited by applicant]
US 20240371367A1 · Churgin et al. · 2024 [cited by applicant]
US 20240371376A1 · Bohl et al. · 2024 [cited by applicant]
US 20250013555A1 · Papadopoulos · 2025 [cited by examiner]
CA 3227939A1 · 2023 [cited by applicant]
CN 112164391A · 2021 [cited by applicant]
EP 2946168A1 · 2015 [cited by applicant]
EP 3239686A1 · 2017 [cited by applicant]
EP 3578433B1 · 2020 [cited by applicant]
EP 3730375B1 · 2021 [cited by applicant]
EP 3960576A1 · 2022 [cited by applicant]
EP 4190659A1 · 2023 [cited by applicant]
EP 4190660A1 · 2023 [cited by applicant]
IN 201741025968 · 2017 [cited by applicant]
KR 102148616B1 · 2020 [cited by applicant]
WO 2013059620A2 · 2013 [cited by applicant]
WO 2014111537A1 · 2014 [cited by applicant]
WO 2023021162A2 · 2023 [cited by applicant]
Dickson, How to create a private ChatGPT that interacts with your local documents, TechTalks. Retrieved from the Internet at: <URL:https://bdtechtalks.com/2023/06/01/create-privategpt-local-llm/> (Jun. 2023). [cited by applicant]
OpenPR Worldwide Public Relations, Press release, “Floatbot.AI Unveils Revolutionary Agent M—Generative AI (LLM or ChatGPT) Based Master Agent developer framework,” Web page downloaded from Internet at <https://www.open… [cited by applicant]
The Future of Car Insurance #2: How AI Is Transforming Auto Insurance for Companies and Drivers, Brogan Woodburn, Rashawn Mitchner, dated Jun. 22, 2023. (Year: 2023). [cited by applicant]
Anonymous, Roots Automation Introduces InsurGPT—the World's Most Advanced Generative AI Model for Insurance. Retrieved from the Internet at: https://ffnews.com/newsarticle/roots-automation-introduces-insurgpt-the-worlds… [cited by applicant]
Introducing Agent M—a powerful Large Language model or ChatGPT based Master Agent developer framework, powered by Floatbot platform, that lets you create multiple application-specific LLM-based Agent(s). Retrieved from … [cited by applicant]
Isenberg, The Compliance Tasks ChatGPT Can (and Can't) Handle, Ignites (published Apr. 3, 2023). [cited by applicant]
Morelli, Will ChatGPT, artificial intelligence replace financial professionals any time soon?, Insurance NewsNet. Retrieved from the Internet at: <https://insurancenewsnet.com/innarticle/will-chatgpt-artificial-intellig… [cited by applicant]
Morris, Morgan Stanley Developing Chatbot with OpenAI, Ignites (published Mar. 15, 2023). [cited by applicant]
Munk, Will AI models like ChatGPT take your insurance job?, Life Annuity Speciality (published Mar. 7, 2023). [cited by applicant]
Rengachary et al., ChatGPT: A Conversation About Underwriting and Life Insurance. Retrieved from the internet at: https://www.coverager.com/chatgpt-a-conversation-about-underwriting-and-life-insurance/ (published Apr. 3… [cited by applicant]
Smith, Insurer Zurich experiments with ChatGPT for claims and data mining, Financial Times (published Mar. 24, 2023). [cited by applicant]
Tuohy, What ChatGPT's Chores May Look Like in Life Insurance Industry, Life Annuity Specialist (published Apr. 21, 2023). [cited by applicant]
Wilson, Should Financial Services Companies Consider Open AI?, LIMRA.com MarketFacts (published Mar. 2023). [cited by applicant]
STIC EIC Search Report for U.S. Appl. No. 18/196,691 (Year: 2024). [cited by applicant]
Wang et al., Transfer learning-based query classification for intelligent building information spoken dialogue. Automation in Construction. Sep. 1, 2022; 141:104403. (Year: 2022). [cited by applicant]
“Encrypt Team,” “ChatGPT—AI Chat bot—A Complete Guide,” www.theencrypt.com 2022 (Year: 2022). [cited by applicant]
Hossen et al., Controlling home appliances adopting chatbot using machine learning approach. In International Conference on Intelligent Computing & Optimization, pp. 253-264, Springer International Publishing (Oct. 2022… [cited by applicant]
Jadhav et al., “Design and Development of Chatbot Based on Reinforcement Learning,” Chapter 12, https://doi.org/10.1002/9781119861850.ch12 2022 (Year: 2022). [cited by applicant]
Mleczko, K. (2021). Chatbot as a tool for knowledge sharing in the maintenance and repair processes. Multidisciplinary Aspects of Production Engineering, 4(1), 499-508. (Year: 2021). [cited by applicant]
U.S. Appl. No. 18/462,032 ip.com NPL Search History, Report Run Date: Jun. 14, 2025. [cited by applicant]
Sankaranarayanan et al., Flood prediction based on weather parameters using deep learning, Journal of Water and Climate Change, 2020 (Year: 2020). [cited by applicant]
Zhang et al., DIALOGPT : Large-Scale Generative Pre-training for Conversational Response Generation, A collaboration between Microsoft Research and Microsoft Dynamics 365 AI Research, pp. 270-278, Jul. 5- Jul. 10, 2020. [cited by applicant]