# US 2024/0127379 A1 · Generating actionable information from documents

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0127379 A1
- Document ID: US20240127379A1
- Status: Published application
- Kind: A1
- Application number: 18/339,472
- Filed: 2023-06-22
- Published: 2024-04-18
- Earliest claimed: 2020-03-20
- Assignees: Codexo
- Applicants: Codexo
- Inventors: Sébastien HUPPE; Marc DANGEARD
- Web page: https://patentgrep.com/patent/US20240127379A1

## CPC

- G06Q 10/10: Office automation; Time management
- G06Q 50/18: Legal services
- G06F 16/345: {Summarisation for human users}
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/93: Document management systems
- G06F 40/117: Tagging; Marking up (details of markup languages G06F40/143); Designating a block; Setting of attributes (style sheets, e.g. eXtensible Stylesheet Language Transformation [XSLT], G06F40/154)
- G06F 40/289: Phrasal analysis, e.g. finite state techniques or chunking
- G06F 40/30: Semantic analysis
- G06Q 40/08: Insurance
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Systems and methods for creating actionable data from documents are described. In some implementations, the systems and methods deconstruct, or break up, documents into blocks (e.g., a paragraph or other segment or portion of text of the document) and store the blocks in a database. The systems and methods tag the blocks with intelligence about the content of the blocks. For example, the systems and methods can tag blocks with commitment markers or other information that identify the blocks as containing or reciting a commitment (e.g., a contractual provision, term, or obligation) within a contract document.

## Claims

### Claim 1

A method for generating a graph database of document blocks from multiple documents provided by an enterprise, the method comprising:
extracting one or more commitments from the multiple documents, wherein a commitment is represented by a block of a document;
tagging each of the blocks associated with the document with commitment markers, wherein a commitment marker relates a block to a commitment;
storing the tagged blocks in a graph database for the enterprise.

### Claim 2 (depends on 1)

The method of claim 1, wherein storing the tagged blocks in a graph database includes mapping the tagged blocks to the multiple documents via edges that connect nodes representing the tagged blocks and the multiple documents.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
performing at least one block of the tagged blocks to a workflow process of the enterprise.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
executing a smart contract using at least one block of the tagged blocks.

### Claim 5 (depends on 1)

The method of claim 1, wherein the multiple documents are legal contracts and the commitments are contractual clauses within the legal contracts.

### Claim 6

A non-transitory computer-readable medium whose contents, when executed by a computing system, cause the computing system to perform a method for generating a database of document blocks from multiple documents provided by an enterprise, the method comprising:
extracting multiple blocks from the multiple documents,
wherein a block includes a portion of text within a document;
tagging each of the blocks associated with the document with commitment markers, wherein a commitment marker relates a block to a commitment, and
wherein a commitment includes a provision identified in the portion of text;
storing the tagged blocks as commitments in a graph database for the enterprise,
wherein the graph database maps tagged blocks to documents from which the blocks are extracted.

### Claim 7 (depends on 6)

The non-transitory computer-readable medium of claim 6, wherein the graph database documents to other documents via the tagged blocks.
