IP Library Granted Patent US 12,353,829
Granted Patent B2
US 12,353,829 · App. 17/647,615 · Granted Jul 8, 2025

Dynamically generating documents using natural language processing and dynamic user interface

Inventor: Simon Booth (Washington, DC)
Assignee: Rowan TELS Corp.
G06F40/289G06F40/14G06F40/166G06F40/284G06F40/40
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,353,829
App. No.
17/647,615
Filed
Jan 11, 2022
Granted
Jul 8, 2025
Kind
B2
Art Unit
2659
USPC
704/9
Abstract

Disclosed are systems, apparatuses, processes, and computer-readable media to convert apparatus and method claims into patent application disclosure. A process includes receiving a claim to be included in a patent application; separating the claim into a plurality of regions based on breakpoint; analyzing each region using a natural language processor; identifying at least one phrase within each region; determining a type of the at least one phrase, the type of phrasing including one of a functional phrase and an descriptive phrase; and creating text for the at least one phrase to be used in a complete sentence based on the type of the at least one phrase. The disclosed method can create content irrespective of statutory type of the claim and different methods and user interfaces to convert claims into descriptions.

Claims (62)

1. A computer-implemented method comprising:

displaying, by a processor, a user interface to generate a patent application based on claims;

receiving, by the processor via the user interface, a claim to be included in the patent application;

separating, by the processor, the claim into a plurality of regions based on a breakpoint;

transmitting, by the processor to a natural language processor (NLP) server, the plurality of regions, wherein the NLP server generates a set of NLP tokens, which each NLP token includes a plurality of grammatical relationships;

receiving, by the processor, the set of NLP tokens associated with the plurality of regions;

identifying, by the processor, at least one phrase within each region, wherein the at least one phrase is associated with a subset of NLP tokens of the set of NLP tokens;

determining, by the processor, a root token of the subset of NLP tokens;

determining, by the processor, a type of the at least one phrase based on the root token, the type of phrase including one of a functional phrase and a descriptive phrase, wherein the type of the at least one phrase is based on the root token of the at least one phrase, and wherein the descriptive phrase describes an object and the functional phrase describes a function of the object;

in response to receiving text modifying a first phrase via the user interface, creating, by the processor, a modified text to be used in a complete sentence based on the type of the at least one phrase from the apparatus claim; and

updating, by the processor, the first phrase to include the modified text;

creating, by the processor, the patent application including the complete sentence generated based on the type of the at least one phrase.

2. The computer-implemented method of claim 1 , further comprising:

identifying, by the processor, NLP tokens in results of the natural language processor server that are immaterial to creating sentences from the claim.

3. The computer-implemented method of claim 1 , further comprising:

identifying, by the processor, whether the at least one phrase includes a subject based on whether a noun corresponding to the subject occurs before a verb, wherein the text to be used in the complete sentence includes the subject of the at least one phrase.

4. The computer-implemented method of claim 3 , further comprising:

identifying, by the processor, a leading phrase prior to the at least one phrase having a context that incorporates the at least one phrase, wherein the text to be used in the complete sentence has a subject corresponding to the context.

5. The computer-implemented method of claim 4 , further comprising:

determining, by the processor, whether a subject of the complete sentence corresponds to the subject in the at least one phrase or the context of the at least one phrase,

wherein, when the subject of the complete sentence corresponds to the context of the at least one phrase, the subject of the complete sentence is a child element that defines the context.

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

identifying, by the processor, a second phrase in a corresponding region including the at least one phrase;

determining, by the processor, a type of the second phrase; and

creating, by the processor, text for the second phrase to be used in a second complete sentence based on the type of the second phrase.

7. The computer-implemented method of claim 1 , further comprising:

receiving, by the processor, a first input to delete the at least one phrase;

receiving, by the processor, a second input to create a third phrase based on a region of selected text, the second input including a type of the third phrase; and

creating, by the processor, text for the third phrase to be used in a third complete sentence based on the type of the third phrase.

8. The computer-implemented method of claim 1 , further comprising:

determining, by the processor, a statutory category of the claim based on types of phrases.

9. The computer-implemented method of claim 1 , further comprising:

determining, by the processor, a statutory category of the claim based on a first noun in the claim, wherein the statutory category comprise a method claim based on the first noun including a keyword and the statutory category comprises an apparatus based on the first noun not including the keyword.

10. The computer-implemented method of claim 1 , wherein identifying the at least one phrase comprises:

separating, by the processor, a region into groups of words based on punctuation in the region;

separately analyzing, by the processor, each group of words using the natural language processor server; and

determining, by the processor, whether to merge any group of words based on a group corresponding to one of an adposition phrase and a token corresponding to a conjunction.

11. The computer-implemented method of claim 1 , wherein determining the type of the at least one phrase comprises:

determining, by the processor, whether the root token of the at least one phrase corresponds to a noun or a verb.

12. The computer-implemented method of claim 11 , wherein determining the type of the at least one phrase further comprises:

when the root token corresponds to the noun, the type of the at least one phrase corresponds to the descriptive phrase.

13. The computer-implemented method of claim 11 , wherein determining the type of the at least one phrase further comprises:

when the root token corresponds to the verb, the type of the at least one phrase corresponds to the functional phrase.

14. The computer-implemented method of claim 13 , further comprising:

determining, by the processor, whether the at least one phrase includes an object of the verb; and

when the at least one phrase does not include the object, determining, by the processor, the type of phrase corresponds to the descriptive phrase.

15. The computer-implemented method of claim 11 , wherein creating the text for the at least one phrase comprises:

identifying, by the processor, a first token corresponding to one of a first noun and a first verb in the at least one phrase;

analyzing, by the processor, the at least one phrase; and

generating, by the processor, the complete sentence based on the analysis of the at least one phrase, the type of the at least one phrase, and whether the first token corresponds to the noun or the verb.

16. The computer-implemented method of claim 15 , wherein analyzing the at least one phrase comprises:

determining, by the processor, whether the at least one phrase includes an open clausal phrase; and

when the at least one phrase includes the open clausal phrase, extracting the open clausal phrase and identifying a subject for the complete sentence.

17. The computer-implemented method of claim 15 , wherein analyzing the at least one phrase comprises:

identifying, by the processor, a second token corresponding the first verb in the at least one phrase;

determining, by the processor, whether the second token corresponds to a gerund; and

when the second token corresponds to the gerund, extracting a verb phrase including the first verb.

18. The computer-implemented method of claim 1 , further comprising:

determining, by the processor, whether the at least one phrase ends in a transitional phrase; and

when the at least one phrase ends in the transitional phrase, determining, by the processor, that the at least one phrase comprises a linking phrase that further defines a prior phrase based on a phrase immediately following the linking phrase.

19. The computer-implemented method of claim 8 , further comprising:

when the statutory category of the claim corresponds to a system or device, generating, by the processor, a method claim based on phrases in the claim.

Assignments (6)
RELEASE OF SECURITY INTEREST IN SPECIFIED INTELLECTUAL PROPERTY [RF 68892 0761] Recorded Mar 4, 2026
From: WILMINGTON TRUST, NATIONAL ASSOCIATION
To: CLARIVATE ANALYTICS (COMPUMARK) INC.; CLARIVATE ANALYTICS (US) LLC; CLARIVATE ANALYTICS (COMPUMARK) LIMITED; CLARIVATE ANALYTICS (UK) LIMITED; DNSTINATION INC.; DOMAIN FORTRESS INC.; MARKMONITOR CORPORATE SERVICES INC.; MARKMONITOR INC.; MICROPATENT LLC; CAMELOT UK BIDCO LIMITED; DECISION RESOURCES, INC.; DR/DECISION RESOURCES, LLC; CPA GLOBAL (FIP) LLC; INNOGRAPHY, INC.; CPA GLOBAL (FTF) INC.; CPA GLOBAL (LANDON IP) INC.; MASTER DATA CENTER, INC.; PATENT RESOURCES GROUP, INC.; IPFOLIO CORPORATION; OLCOTT INTERNATIONAL & CO., L.L.C.; PROQUEST LLC; EX LIBRIS (USA) INC.; INNOVATIVE INTERFACES INCORPORATED; ROWAN TELS CORP.; GLOBAL QMS, INC.
Reel/Frame 075063/0219 →
PATENT SECURITY AGREEMENT (CA) Recorded Sep 13, 2024
From: ROWAN TELS CORP.
To: BANK OF AMERICA, N.A. AS COLLATERAL AGENT
Reel/Frame 068892/0481 →
PATENT SECURITY AGREEMENT (2021 INDENTURE) Recorded Sep 13, 2024
From: ROWAN TELS CORP.
To: WILMINGTON TRUST, NATIONAL ASSOCIATION AS COLLATERAL AGENT
Reel/Frame 068892/0689 →
PATENT SECURITY AGREEMENT (2019 INDENTURE) Recorded Sep 13, 2024
From: ROWAN TELS CORP.
To: WILMINGTON TRUST, NATIONAL ASSOCIATION AS COLLATERAL AGENT
Reel/Frame 068892/0761 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 20, 2022
From: BOOTH, SIMON; MCKNIGHT, BRIAN; ISAACSON, TOM; AUSTIN, SHELTON; DURBIN, GREGORY
To: POLSINELLI PC
Reel/Frame 061150/0701 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 20, 2022
From: POLSINELLI PC
To: ROWAN TELS CORP.
Reel/Frame 061150/0716 →
Continuity (2)
Provisional Application 63193981 · May 27, 2021
Related Publication 20220382983A1 · Dec 1, 2022
References Cited (20)
US 10417341B2 · Schick et al. · 2019 [cited by applicant]
US 10747953B1 · Priyadarshi · 2020 [cited by applicant]
US 20080178114A1 · Milton · 2008 [cited by applicant]
US 20080313528A1 · Chang · 2008 [cited by applicant]
US 20090210828A1 · Kahn · 2009 [cited by applicant]
US 20130042170A1 · Milton, Jr. · 2013 [cited by examiner]
US 20130198092A1 · Dugan · 2013 [cited by examiner]
US 20130317994A1 · Tran · 2013 [cited by applicant]
US 20170075877A1 · Lepeltier · 2017 [cited by applicant]
US 20180173811A1 · Aragon y Willems · 2018 [cited by applicant]
US 20180232361A1 · Schick · 2018 [cited by applicant]
US 20180341630A1 · DeVries · 2018 [cited by examiner]
US 20180365781A1 · Tsai · 2018 [cited by applicant]
US 20190057074A1 · Carey · 2019 [cited by applicant]
US 20190340217A1 · Tran · 2019 [cited by examiner]
US 20200151393A1 · Schick · 2020 [cited by examiner]
US 20210012444A1 · Carey · 2021 [cited by applicant]
US 20230123328A1 · Gorman · 2023 [cited by examiner]
Lillemo, Shawn, “Become a Superhero—2019 IPO annual Meeting Patent Drafting Automation”; Harrity & Harrity; https://www.youtube.com/watch?v=egdRXS8iQeo. [cited by applicant]
Parapatics, Peter and Michael Dittenbach. “Patent claims decomposition for improved information extraction.” In Current Challenges in Patent Information Retrieval, pp. 197-216. Springer, Berlin, Heidelberg, 2011. (Year:… [cited by applicant]