DETAILED ACTION
Acknowledgments
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
This action is in reply to the application filed on 05/28/2024.
Claims 1-12 are currently pending and have been examined.
Claim Rejections - 35 USC § 101
35 U.S.C. 101 reads as follows:
Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.
Claims 1-12 are rejected under 35 U.S.C. 101 because the claimed invention is directed to non-patent eligible subject matter because the claim(s) as a whole, considering all claim elements both individually and in combination, do not amount to significantly more than an abstract idea.
Step 1:
The claims recite a process, system, apparatus, article of manufacture, and/or a nontransitory storage medium with instructions, each of which are proper statutory categories.
Step 2A (prong 1):
Claim 1 (representative of claims 5 and 9):
The claim limitations are grouped as shown immediately following:
receiving a structured query from a log; (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people including following rules or instructions)
finding structured-query, natural-language-query training pairs that have a semantically similar structured query to the received structured query in a training set; (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people including following rules or instructions)
training a machine learning instance using the structured-query, natural-language-query training pairs; (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people including following rules or instructions)
providing the received structured query to the machine learning instance after being trained; (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people including following rules or instructions)
in response to providing the received structured query to the machine learning instance, receiving a natural language query from the machine learning instance; (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people including following rules or instructions)
validating the received natural language query; (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people including following rules or instructions)
adding the received structured query and the validated natural language query as a training pair to the training set. (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people including following rules or instructions)
Additional dependent claims 2-4, 6-8, and 10-12 do not appear remedy the deficiency.
Step 2A (prong 2):
Claim 1 (representative of claims ):
… a machine learning server
… a system
…a memory
…at least one hardware processor
…a non-transitory computer-readable medium
These remaining claim limitations are delineated as shown immediately preceding. The abstract idea is not integrated into a practical application. There are no improvements to the functioning of a computer, other technology or technical field, a particular machine is not cited, nothing is transformed to a different state or thing, the abstract idea is not more than a drafting effort designed to monopolize the abstract idea. The claim merely uses a computer as a tool to perform the abstract idea, which is generally linked to a particular field of use, in this case, marketing and advertising. Thus, these limitations are recited at a high-level of generality (i.e., as a generic processor and memory performing a generic computer function of processing and storing data) such that it amounts no more than mere instructions to apply the exception using a generic computer component – MPEP 2106.05(f). Further, receiving data, evaluating data and distributing data are data gathering and data outputting, which has no effect on technology and does no more than generally link the use of the judicial exception to a particular technological environment or field of use – see MPEP 2106.05(h).
Step 2B:
The claim limitations do not provide an Inventive Concept. The claim limitations do not recite additional elements that amount to significantly more that the abstract idea because the additional elements of the system comprising a computer processor, computer readable storage medium with instructions, and a memory configured to store information, each recited at a high level of generality in a computer network which only perform the universal computer functions of accessing, receiving, storing, and processing data, transmitting and presenting information. Taking the elements both individually and as an ordered combination, the function performed by the computer at each step of the process is purely orthodox. Using a computer to obtain and display data are some of the most basic functions of a computer. As shown, the individual limitations claimed are some of the most rudimentary functions of a computer. The technical solution described in this invention does not alter hardware structure or its routine, does not transform the character of the information being processed, does not identify a novel source or type of data, does not advance the functionality of a computer as a tool, and does not incorporate specific rules enabling the computer to accomplish innovative utilities. In summary, the individual step and/or component does no more than require a general computer to perform standard computer functions. As discussed above with respect to integration of the abstract idea into a practical application, the additional element of a computer devices amounts to no more than mere instructions to apply the exception using a generic computer component - requiring the use of software to tailor information and provide it to the user on a generic computer, Intellectual Ventures I LLC v. Capital One Bank (USA), 792 F.3d 1363, 1370-71, 115 USPQ2d 1636, 1642 (Fed. Cir. 2015).
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13.
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer.
Claims 1-12 are provisionally rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-21 of copending Application No. 18/028714 (hereinafter reference application). Each of the reference application as well as this presently claimed invention are directed towards training machine learning mechanisms to translate natural queries into queries suitable for non-natural-language-query databases.
Independent claims 1, 5, and 9 of this current application recite:
A method for training a machine learning server instance, comprising:
receiving a structured query from a log;
finding structured-query, natural-language-query training pairs that have a semantically similar structured query to the received structured query in a training set;
training a machine learning instance using the structured-query, natural-language-query training pairs;
providing the received structured query to the machine learning instance after being trained;
in response to providing the received structured query to the machine learning instance, receiving a natural language query from the machine learning instance; validating the received natural language query;
adding the received structured query and the validated natural language query as a training pair to the training set.
Independent claims 1, 8, and 15 of the reference application differ since it further recites additional claim limitations including:
providing the NL query as an input to the pre-trained large language model instance; and
using the pre-trained large language model instance to generate the answer to the NL query,
However, it would have been obvious to a person of ordinary skill in the art to modify claims 1, 5, and 9 of the instant application to include a large language model resulting generally in the claims of the present application since the claims of the present application and the claims recited in the reference application actually perform a similar function. It is well settled that the omission of an element and its function is an obvious expedient if the remaining elements perform the same function as before. In re Karlson, 136 USPQ 184 (CCPA 1963). Also note Ex parte Rainu, 168 USPQ 375 (Bd. App. 1969). Omission of a reference element whose function is not needed would be obvious to one of ordinary skill in the art.
In this case, the limitation as claimed by the invention is merely an improvement over a base device, product, or method as taught by the references. The specifications also teach a comparable device improved in the same way. The technical ability existed to improve the base device in the same way and the result of the improvement is predictable. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Consequently, it would have been obvious to one of ordinary skill in the art at the effective filing date to combine/modify the method of instant application with the technique of reference application because there is a recognized problem or need in the art including market pressure, design need, etc., and there are a finite number of identified predictable solutions. Accordingly, those in the art could have pursued known solutions with reasonable expectation of success. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Fundamentally, in the competitive business climate, there is a profit-driven motive to maximize the profitability of goods and services that are provided or marketed to customers. Enterprises typically use business planning to make decisions in order to maximize profits.
This is a provisional nonstatutory double patenting rejection because the patentably indistinct claims have not in fact been patented.
Claim Rejections - 35 USC § 103
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102 of this title, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
Claims 1, 5, and 9 are rejected under U.S.C. 103 as being unpatentable over Lee et al. (USPGP 2020/0334233 A1), hereinafter LEE, in view of Cenciotti et al. (USPGP 2022/0207038 A1), hereinafter CENCIOTTI.
Claim 1:
LEE as shown below discloses the following limitations:
receiving a structured query from a log; (see at least paragraphs 0022, 0021, 0017, 0044)
finding structured-query, natural-language-query training pairs that have a semantically similar structured query to the received structured query in a training set; (see at least paragraphs 0022, 0021, 0017, 0044)
training a machine learning instance using the structured-query, natural-language-query training pairs; providing the received structured query to the machine learning instance after being trained; (see at least paragraphs 0022, 0021, 0017, 0044)
LEE does not specifically disclose:
in response to providing the received structured query to the machine learning instance, receiving a natural language query from the machine learning instance;
validating the received natural language query;
adding the received structured query and the validated natural language query as a training pair to the training set.
However, CENCIOTTI, in at least paragraphs 0043 and 0045 does. In this case, each of the elements claimed are all shown by the prior art of record but not combined as claimed. However, the technical ability exists to combine the elements as claimed and the results of the combination are predictable. Therefore, when combined, the elements perform the same function as they did separately. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Consequently, it would have been obvious to one of ordinary skill in the art at the effective filing date to combine/modify the method of LEE with the technique of CENCIOTTI because, “Information retrieval is the activity of obtaining information system resources that are relevant to an information need from a collection of those resources. Searches can be based on full-text or other content-based indexing. Information retrieval is the science of searching for information in a document, searching for documents themselves, searching for associated metadata. The searched for information may include varying combinations of texts, images, and sounds. Moreover, the searched for information may include structured and/or unstructured data and may be stored in one or more databases accessible by a computer system. An information retrieval system is a software system that provides access to data, stores data, and manages data. Examples of information retrieval systems include widely used internet search engines.” (CENCIOTTI: paragraph 0002). Additionally, there is a recognized problem or need in the art including market pressure, design need, etc., and there are a finite number of identified predictable solutions. Accordingly, those in the art could have pursued known solutions with reasonable expectation of success. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Fundamentally, in the competitive business climate, there is a profit-driven motive to maximize the profitability of goods and services that are provided or marketed to customers. Enterprises typically use business planning to make decisions in order to maximize profits.
Claims 2-4, 6-8, and 10-12 are rejected under U.S.C. 103 as being unpatentable over LEE/CENCIOTTI, and further in view of Ramakrishnan et al. (USPGP 2022/0121964 A1), hereinafter RAMAKRISHNAN.
Claims 2-4:
The combination of LEE/CENCIOTTI discloses the limitations as shown in the rejections above. RAMAKRISHNAN further discloses the following limitations:
wherein the machine learning instance is an instance of GENERATIVE PRE-TRAINED TRANSFORMER 3 (GPT3).
wherein finding structured-query, natural-language-query training pairs that have a semantically similar structured query to the received structured query can be performed using a machine learning classifier that has been trained to classify pairs of structured queries as being similar or not similar to classify each combination of. each received structured query; and each structured query of each possible training pair.
wherein finding structured-query, natural-language-query training pairs that have a semantically similar structured query to the received structured query can be performed based on a semantic search.
See at least paragraph 0023, 0025, 0028, 0052, and 0053. In this case, each of the elements claimed are all shown by the prior art of record but not combined as claimed. However, the technical ability exists to combine the elements as claimed and the results of the combination are predictable. Therefore, when combined, the elements perform the same function as they did separately. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Consequently, it would have been obvious to one of ordinary skill in the art at the effective filing date to combine/modify the method of LEE/CENCIOTTI with the technique of RAMAKRISHNAN because, “Today, a variety of information from a variety of sources may be used in some manner to analyze, visualize, forecast, leverage, etc. various social, political, geographical, regulatory, business, or like segments to facilitate or support intelligent approaches for business decision-making, performance management, market research, situational awareness, or the like. For example, information may be used by project or performance management applications to deliver tailored approaches helping to gain a competitive advantage by improving work-flow or operating procedures, acquiring business insights, assessing risks or opportunities, creating or maintaining regulatory compliance infrastructure, or the like.” (RAMAKRISHNAN: paragraph 0003). Additionally, there is a recognized problem or need in the art including market pressure, design need, etc., and there are a finite number of identified predictable solutions. Accordingly, those in the art could have pursued known solutions with reasonable expectation of success. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Fundamentally, in the competitive business climate, there is a profit-driven motive to maximize the profitability of goods and services that are provided or marketed to customers. Enterprises typically use business planning to make decisions in order to maximize profits.
CONCLUSION
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
Non-Patent Literature:
Frieda Rong. “Extrapolating to Unnatural Language Processing with GPT-3's In-context Learning: The Good, the Bad, and the Mysterious.” (May 28, 2021). Retrieved online 07/28/2026. Extrapolating to Unnatural Language Processing with GPT-3’s In-context Learning: The Good, the Bad, and the Mysterious | SAIL Blog
Relevancy: “What is in-context learning? Informally, in-context learning describes a different paradigm of “learning” where the model is fed input normally as if it were a black box, and the input to the model describes a new task with some possible examples while the resulting output of the model reflects that new task as if the model had “learned”. While imprecise, the term is meant to capture common behaviour that was noted in the GPT-3 paper by OpenAI as a phenomenon that GPT-3 displayed with surprising consistency.” (Abstract/Introduction)
Data Science. “Natural Language to SQL query.” (May 14, 2018). Retrieved online 07/28/2026. https://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=&ved=2ahUKEwiilIrjmvWVAxVmN2IAHUJUEXIQFnoECBgQAQ&url=https%3A%2F%2Fdatascience.stackexchange.com%2Fquestions%2F31617%2Fnatural-language-to-sql-query&usg=AOvVaw2BCcyeAzTURDwBJrVGnrpq&opi=89978449
Ming Zhou et al. “Progress in Neural NLP: Modeling, Learning, and Reasoning.” (March 2020). Retrieved online 07/28/2026.
Relevancy: “Natural language processing (NLP) is a subfield of artificial intelligence that focuses on enabling computers to understand and process human languages. In the last five years, we have witnessed the rapid development of NLP in tasks such as machine translation, question-answering, and machine reading comprehension based on deep learning and an enormous volume of annotated and unannotated data. In this paper, we will review the latest progress in the neural network-based NLP framework (neural NLP) from three perspectives: modeling, learning, and reasoning. In the modeling section, we will describe several fundamental neural network-based modeling paradigms, such as word embedding, sentence embedding, and sequence-to-sequence modeling, which are widely used in modern NLP engines. In the learning section, we will introduce widely used learning methods for NLP models, including supervised, semi-supervised, and unsupervised learning; multitask learning; transfer learning; and active learning. We view reasoning as a new and exciting direction for neural NLP, but it has yet to be well addressed. In the reasoning section, we will review reasoning mechanisms, including the knowledge, existing non-neural inference methods, and new neural inference methods. We emphasize the importance of reasoning in this paper because it is important for building interpretable and knowledge-driven neural NLP models to handle complex tasks. At the end of this paper, we will briefly outline our thoughts on the future directions of neural NLP.” (Abstract/Introduction)
Foreign Art:
ADIWARDANA et al. “Computing System For Generating Contextual Text With Interpretability, Has Processor For Processing Intermediate Text Strings With Machine-learned Language Model To Generate Output Text String Comprising Output Text Tokens.” (WO 2022/246194 A1)
Relevancy: “The system has a non-transitory computer-readable medium collectively storing a machine-learned language model (14) that performs textual analysis in service of contextual text generation. A processor obtains a contextual text string (12) comprising contextual text tokens, and processes the text string with the language model to generate intermediate text strings (16) comprising intermediate text tokens, where the intermediate text string comprises textual analysis of the contextual string that supports an output text string (18). The intermediate string comprises a tool token that invokes use of a structural tool (15) to access additional information not included in the string.” (Abstract/Introduction)
HU et al. “Method For Realizing Machine Learning Based On Structured Query Language Statement By Server, Involves Sending Task Flow Information To Target Computing Service Frame, And Executing Target Machine Learning Task According To Task Elements And Task Process Information.” (CN 113780570 A)
Relevancy: “The method involves obtaining (S11) structured query language statement corresponding to a target machine learning task. Grammar identification process is performed (S12) to the structured query Language sentence. Target key information of the target machine learning task is determined. Task flow information is generated (S13) based on the target key information to generate a task flow information for the target task. The task flow information is sent (S14) to a target computing service frame such that the target computing service framework obtains the task elements required for the task process information. The target machine learning task is executed according to the task elements and the task process information.” (Abstract/Introduction)
HYUK et al. “Method Of Converting Natural Language Query Into Structured Query Language (SQL) Query, Involves Verifying Second SQL Queries, And Comparing Second SQL Queries With Third SQL Queries Corresponding To Natural Language Queries Of Training Data To Train SQL Conversion Model.” (EP 4187400 A1)
Relevancy: “The method involves labeling (S310) natural language queries included in training data. The natural language queries are converted (S320) into second SQL queries by applying the natural language queries to an SQL conversion model. The second SQL queries are verified (S330). The second SQL queries are compared (S350) with third SQL queries corresponding to the natural language queries of the training data to train the SQL conversion model. Multiple keywords included in the natural language queries are extracted. The keywords are labeled with corresponding tags. The SQL conversion model is generated for generating second SQL queries on the basis of natural language queries, a database schema, and labeled tags of the training data. The natural language queries of the training data are converted into the second SQL queries on the basis of the SQL conversion model.” (Abstract/Introduction)
Any inquiry of a general nature or relating to the status of this application or concerning this communication or earlier communications from the Examiner should be directed to James A. Reagan (james.reagan@uspto.gov) whose telephone number is 571.272.6710. The Examiner can normally be reached Monday through Friday from 9 AM to 5 PM. If attempts to reach the examiner by telephone are unsuccessful, the Examiner’s supervisor, John Hayes, can be reached at 571.272.6708.
Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://portal.uspto.gov/external/portal/pair . Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866.217.9197 (toll-free).
Any response to this action should be mailed to:
Commissioner for Patents
PO Box 1450
Alexandria, Virginia 22313-1450
or faxed to 571-273-8300.
Hand delivered responses should be brought to the United States Patent and Trademark Office Customer Service Window:
Randolph Building
401 Dulany Street
Alexandria, VA 22314.
/JAMES A REAGAN/Primary Examiner, Art Unit 3697
james.reagan@uspto.gov
571.272.6710 (Office)
571.273.6710 (Desktop Fax)