DETAILED ACTION
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
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.
Claim 1 of 19/074,399
A computer-implemented method for natural language computation, comprising: matching an input sentence to a token; upon determining a match with the token, the token being a trigger sentence, executing a semantic rule associated with the trigger sentence using the input sentence; upon determining a match with the token, the token being a metalanguage sentence, using the input sentence: storing a new semantic rule; and storing an association between the new semantic rule and one or more defined trigger sentences; upon determining a match with the token, the token being a built-in sentence, executing one or more built-in functions associated with the built-in sentence using the input sentence.
Claim 1 of 12333259
A computer-implemented method for natural language computation, comprising: matching an input sentence to a token; upon determining a match with the token, the token being a trigger sentence, executing a semantic rule associated with the trigger sentence using the input sentence; upon determining a match with the token, the token being a metalanguage sentence, using the input sentence: storing a new semantic rule; generating one or more defined trigger sentences based on the input sentence, the generating of the one or more defined trigger sentences based on the input sentence being by, for each of the one or more defined trigger sentences, selecting a variable in the input sentence and defining the trigger sentence using the variable; and storing an association between the new semantic rule and the one or more defined trigger sentences; upon determining a match with the token, the token being a built-in sentence, executing one or more built-in functions associated with the built-in sentence using the input sentence; and displaying a data output at a user interface, the data output representing a result corresponding to the input sentence.
Claim 10 of 19/074,399
A computer-implemented system for natural language computation, comprising: a non-transitory computer memory; and at least one processor in communication with the non-transitory computer memory; wherein the non-transitory computer memory comprises instructions which, when executed by the at least one processor, carries out the steps of: matching an input sentence to a token; upon determining a match with the token, the token being a trigger sentence, executing a semantic rule associated with the trigger sentence using the input sentence; upon determining a match with the token, the token being a metalanguage sentence, using the input sentence: storing a new semantic rule; and storing an association between the new semantic rule and one or more defined trigger sentences; upon determining a match with the token, the token being a built-in sentence, executing one or more built-in functions associated with the built-in sentence using the input sentence.
Claim 9 of 12333259
A computer-implemented system for natural language computation, comprising: a non-transitory computer memory; and at least one processor in communication with the non-transitory computer memory; wherein the non-transitory computer memory comprises instructions which, when executed by the at least one processor, carries out the steps of: matching an input sentence to a token; upon determining a match with the token, the token being a trigger sentence, executing a semantic rule associated with the trigger sentence using the input sentence; upon determining a match with the token, the token being a metalanguage sentence, using the input sentence: storing a new semantic rule; generating one or more defined trigger sentences based on the input sentence, the generating of the one or more defined trigger sentences based on the input sentence being by, for each of the one or more defined trigger sentences, selecting a variable in the input sentence and defining the trigger sentence using the variable; and storing an association between the new semantic rule and one or more defined trigger sentences; upon determining a match with the token, the token being a built-in sentence, executing one or more built-in functions associated with the built-in sentence using the input sentence; and displaying a data output at a user interface, the data output representing a result corresponding to the input sentence.
Claim 18 of 19/074,399
A non-transitory computer-readable medium containing computer-readable instructions which, when executed by a computer processor, perform a method of: matching an input sentence to a token; upon determining a match with the token, the token being a trigger sentence, executing a semantic rule associated with the trigger sentence using the input sentence; upon determining a match with the token, the token being a metalanguage sentence, using the input sentence: storing a new semantic rule; and storing an association between the new semantic rule and one or more defined trigger sentences; upon determining a match with the token, the token being a built-in sentence, executing one or more built-in functions associated with the built-in sentence using the input sentence.
Claim 16 of 12333259
A non-transitory computer-readable medium containing computer-readable instructions which, when executed by a computer processor, perform a method of: matching an input sentence to a token; upon determining a match with the token, the token being a trigger sentence, executing a semantic rule associated with the trigger sentence using the input sentence; upon determining a match with the token, the token being a metalanguage sentence, using the input sentence: storing a new semantic rule; generating one or more defined trigger sentences based on the input sentence, the generating of the one or more defined trigger sentences based on the input sentence being by, for each of the one or more defined trigger sentences, selecting a variable in the input sentence and defining the trigger sentence using the variable; and storing an association between the new semantic rule and one or more defined trigger sentences; upon determining a match with the token, the token being a built-in sentence, executing one or more built-in functions associated with the built-in sentence using the input sentence; and displaying a data output at a user interface, the data output representing a result corresponding to the input sentence.
Claims 1, 10 & 18 of application number 19/074,399 (hereinafter referred to as ‘399) are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 9 & 16 of U.S. Patent No. 12333259 (hereinafter referred to as ‘259).
Although the claims at issue are not identical, they are not patentably distinct from each other because ‘399 claims 1, 10 & 18 are broader recitations of ‘259 claims 1, 9 & 16. Therefore, the recitations of ‘259 claims 1, 9 & 16 are encompassed by the recitations of ‘399 claims 1, 10 & 18.
Claim Rejections - 35 USC § 102
The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –
(a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention.
Claims 1-4, 6-7, 9-13, 15 & 17-18 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Winston, US Patent 10621390 B1.
Re Claim 1, Winston discloses a computer-implemented method for natural language computation (col. 4, lines 41-44: natural language), comprising: matching an input sentence to a token (col. 8, lines 1-10: sentence is broken down into smaller sentences which are read as the tokens); upon determining a match with the token, the token being a trigger sentence, executing a semantic rule associated with the trigger sentence using the input sentence (col. 11, line 65 through col. 12, line 10: sentence is used as a trigger when deem to match the rule trigger, wherein sentence can be broken down to smaller sentences as emphasized in (col. 8, lines 1-10)); upon determining a match with the token, the token being a metalanguage sentence (col. 11, lines 41-54: rule trigger to match meta entities), using the input sentence: storing a new semantic rule (claim 1: trigger rules along with sentences are all stored on the memory used to execute the program); and storing an association between the new semantic rule and one or more defined trigger sentences (claim 1: trigger rules along with sentences are all stored on the memory used to execute the program); upon determining a match with the token, the token being a built-in sentence, executing one or more built-in functions associated with the built-in sentence using the input sentence (abstract: summarization of the input story is carried out based on the aforementioned trigger rules and meta entities which are read as the bult-in functions).
Re Claim 2, Winston discloses the computer-implemented method of claim 1, the token being a trigger sentence, metalanguage sentence, or a built-in sentence (col. 11, line 65 through col. 12, line 10: sentence is used as a trigger when deem to match the rule trigger, wherein sentence can be broken down to smaller sentences as emphasized in (col. 8, lines 1-10). The token being used as a trigger sentence is selected from the Markush claim language).
Re Claim 3, Winston discloses the computer-implemented method of claim 1, the matching being evaluating a match between the input sentence and one or more trigger sentences (col. 11, line 65 through col. 12, line 10: sentence is used as a trigger when deem to match the rule trigger, wherein sentence can be broken down to smaller sentences as emphasized in (col. 8, lines 1-10)), then one or more metalanguage sentences (col. 11, lines 41-54: rule trigger to match meta entities), and then one or more built-in sentences until the match is determined (abstract: summarization of the input story is carried out based on the aforementioned trigger rules and meta entities which are read as the bult-in functions).
Re Claim 4, Winston discloses the computer-implemented method of claim 1, further comprising requesting creation of a new trigger sentence (col. 8, lines 1-10: sentence is broken down into smaller sentences which are read as the new tokens), the trigger sentence matching the input sentence (col. 11, line 65 through col. 12, line 10: sentence is used as a trigger when deem to match the rule trigger, wherein sentence can be broken down to smaller sentences as emphasized in (col. 8, lines 1-10: sentence is broken down into smaller sentences which are read as the tokens)).
Re Claim 6, Winston discloses the computer-implemented method of claim 1, the built-in function being selected from the group consisting of: semantic rule, non-semantic rule, metalanguage statement or function, function call, internal operation, synchronous function, asynchronous function, single step call, multi-step call, interactive, non-interactive, remote execution function, local CPU function, database function, web call, network call, cloud call, and any type of software or hardware computer function or instruction (claim 1: rules used in syntax-to-semantics mapping with system performed by a program with a memory and a computer processor used to execute the program; wherein semantic rule and/or software/hardware is selected from the Markush language).
Re Claim 7, Winston discloses the computer-implemented method of claim 1, the metalanguage sentence representing a request to associate one or more trigger sentences with an existing trigger sentence (claim 1: meta entities are identifies in the triggering of the rule, where the trigger rule is a trigger sentence (col. 11, line 65 through col. 12, line 10: sentence is used as a trigger when deem to match the rule trigger, wherein sentence can be broken down to smaller sentences as emphasized in (col. 8, lines 1-10))), the steps further comprising storing an association between the one or more trigger sentences and the semantic rule associated with the existing trigger sentence (claim 1: trigger rules along with sentences are all stored on the memory used to execute the program).
Re Claim 9, Winston discloses the computer-implemented method of claim 1, executing the semantic rule being by selecting a selected metalanguage sentence from one or more defined metalanguage sentences (col. 11, lines 41-54: rule trigger to match meta entities), the one or more defined metalanguage sentences corresponding to the trigger sentence (col. 11, lines 41-54: rule trigger to match meta entities).
Claim 10 has been analyzed and rejected according to claim 1.
Claim 11 has been analyzed and rejected according to claim 2.
Claim 12 has been analyzed and rejected according to claim 3.
Claim 13 has been analyzed and rejected according to claim 4.
Claim 15 has been analyzed and rejected according to claim 7.
Claim 17 has been analyzed and rejected according to claim 9.
Claim 18 has been analyzed and rejected according to claim 1.
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, 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.
The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows:
1. Determining the scope and contents of the prior art.
2. Ascertaining the differences between the prior art and the claims at issue.
3. Resolving the level of ordinary skill in the pertinent art.
4. Considering objective evidence present in the application indicating obviousness or nonobviousness.
Claims 5, 8, 14 & 16 are rejected under 35 U.S.C. 103 as being unpatentable over Winston, US Patent 10621390 B1 as applied to claim 1 above, in view of Anisimovich et al, US Patent Pub. 20200104354 A1.
Re Claim 5, Winston discloses the computer-implemented method of claim 1, but fails to disclose further comprising displaying a data output at a user interface, the data output representing a result corresponding to the input sentence. However, Anisimovich et al teaches the concept of a natural language processing system that displays its output via a display of a user interface (Anisimovich, abstract). Since Winston discloses that its output could be a textual output (Winston, col. 50, lines 20-29: textual output implies output has to be displayed on some sort of display), it would have been obvious to modify the Winston output to be displayed in a user interface as taught in Anisimovich for the purpose of seamlessly providing a visible output to a user.
Re Claim 8, the combined teachings of Winston and Anisimovich disclose the computer-implemented method of claim 5, the storing a new semantic rule further comprising receiving one or more additional input sentences and storing the new semantic rule using the one or more additional input sentences (Winston, claim 1: trigger rules along with sentences new/old are all stored on the memory used to execute the program).
Claim 14 has been analyzed and rejected according to claim 5.
Re Claim 16, the combined teachings of Winston and Anisimovich disclose the computer-implemented system of claim 14, the storing a new semantic rule further comprising receiving one or more additional input sentences and storing the new semantic rule using the one or more additional input sentences (Winston, claim 1: trigger rules along with sentences new/old are all stored on the memory used to execute the program).
Contact
Any inquiry concerning this communication or earlier communications from the examiner should be directed to GEORGE C MONIKANG whose telephone number is (571)270-1190. The examiner can normally be reached Mon. - Fri., 9AM-5PM, ALT. Fridays off.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Carolyn R Edwards can be reached at 571-270-7136. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/GEORGE C MONIKANG/Primary Examiner, Art Unit 2692 10/16/2026