# US 2026/0064778 A1 · Customizable document processing and retrieval system for enhanced artificial intelligence responses

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

- Number: US 2026/0064778 A1
- Document ID: US20260064778A1
- Status: Published application
- Kind: A1
- Application number: 18/822,575
- Filed: 2024-09-03
- Published: 2026-03-05
- Earliest claimed: 2024-09-03
- Assignees: Micro Focus LLC
- Applicants: Micro Focus LLC
- Inventors: Wen Lin; Hao Liu; Bing Zhang
- Web page: https://patentgrep.com/patent/US20260064778A1

## CPC

- G06F 16/93: Document management systems
- G06N 3/08: Learning methods
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Systems and methods are provided to execute chunking of documents in accordance with a resolver selected in accordance with one or more document elements of the document. A server or other computing device then chunks the document, which may be initially chunked in accordance with static rules, and re-chunked to maintain logical associations and meanings between the otherwise separate chunks.

## Claims

### Claim 1

A method of vectorizing a document, comprising:
chunking the document, in accordance with a resolver, into a number of chunks, wherein the resolver defines associations for portions of a documents type that comprise the document, and
wherein the resolver comprises two or more different resolver types;
vectorizing the number of chunks into a number of vectorized chunks;
providing the number of vectorized chunks to a data storage for storage therein;
retrieving the number of vectorized chunks;
receiving a query;
appending the number of vectorized chunks to the query;
providing the query to a large language model; and
receiving a response therefrom.

### Claim 2 (depends on 1)

The method of claim 1, wherein chunking the document, in accordance with the resolver, into the number of chunks comprises:
matching a first document element of the document to a first document element identifier;
matching a second document element of the document to a second document element identifier; and
upon an association rule determining the first document element identifier is associated with the second document element identifier, chunking the first document element and the second document element into a single chunk of the number of chunks.

### Claim 3 (depends on 2)

The method of claim 2, wherein at least one of the first document element identifier and the second document element identifier are determined in accordance with a file type of the document.

### Claim 4 (depends on 2)

The method of claim 2, wherein at least one of the first document element identifier and the second document element identifier are determined in accordance with a domain of the document.

### Claim 5 (depends on 2)

The method of claim 2, wherein the association rule is selected from a plurality of association rules in accordance with a user-provided intent of the document, and wherein the user-provided intent comprises an association between a number of association rules comprising the association rule.

### Claim 6 (depends on 1)

The method of claim 1, wherein the number of chunks is selected in accordance with a maximum chunk size for each of the number of chunks.

### Claim 7 (depends on 1)

The method of claim 1, further comprising selecting the resolver from a plurality of resolvers, the selection further comprising providing the document to an artificial intelligence trained to analyze the document and determine therefrom a closest matching resolver, wherein the artificial intelligence is trained to analyze the document comprising a closest domain.

### Claim 8

A system, comprising:
a network interface to a communication network; and
a microprocessor coupled to a computer memory comprising machine-readable instructions that when read by the microprocessor cause the microprocessor to perform:
accessing a document;
accessing a resolver,
wherein the resolver comprises two or more different resolver types;
chunking the document, in accordance with the resolver, into a number of chunks;
vectorizing the number of chunks into a number of vectorized chunks;
providing, via the network interface, the number of vectorized chunks to a data storage for storage therein;
retrieving the number of vectorized chunks;
receiving a query;
appending the number of vectorized chunks to the query;
providing the query to a large language model; and
receiving a response therefrom.

### Claim 9 (depends on 8)

The system of claim 8, wherein the number of chunks is selected in accordance with a maximum chunk size for each of the number of chunks.

### Claim 10 (depends on 8)

The system of claim 8, wherein the microprocessor further performs selecting the resolver from a plurality of resolvers, the selection further comprising providing the document to an artificial intelligence trained to analyze the document and determine therefrom a closest matching resolver, wherein the artificial intelligence is trained to analyze the document comprising a closest domain.

### Claim 11 (depends on 8)

The system of claim 8, wherein the microprocessor performs chunking the document, in accordance with the resolver, into the number of chunks, further comprising:
matching a first document element of the document to a first document element identifier;
matching a second document element of the document to a second document element identifier; and
upon an association rule determining the first document element identifier is associated with the second document element identifier, chunking the first document element and the second document element into a single chunk of the number of chunks.

### Claim 12 (depends on 11)

The system of claim 11, wherein at least one of the first document element identifier and the second document element identifier are determined in accordance with a file type of the document.

### Claim 13 (depends on 11)

The system of claim 11, wherein at least one of the first document element identifier and the second document element identifier are determined in accordance with a domain of the document.

### Claim 14 (depends on 11)

The system of claim 11, wherein the association rule is selected from a plurality of association rules in accordance with a user-provided intent of the document, and wherein the user-provided intent comprises an association between a number of association rules comprising the association rule.

### Claim 15 (depends on 11)

The system of claim 11, further comprising:
a user interface; and
wherein the microprocessor further performs:
receiving user inputs via the user interface to construct a template,
wherein the template associates at least one of a first training document element to the first document element identifier or a second training document element to the second document element identifier; and
storing the template as the resolver.

### Claim 16 (depends on 15)

The system of claim 15, further comprising receiving a user input comprising an intention.

### Claim 17 (depends on 16)

The system of claim 16, wherein the microprocessor further performs:
receiving a second query via the user interface; and
matching the second query to the intention and, in response, appending the number of vectorized chunks associated with the single chunk to the template stored as the resolver.

### Claim 18 (depends on 16)

The system of claim 16, wherein the microprocessor further performs:
receiving a second query via the user interface; and
failing to match the second query to the intention and, in response, appending the number of vectorized chunks associated with at least one of content or semantics to the template stored as the resolver.

### Claim 19

(canceled)

### Claim 20

A non-transitory computer-readable media comprising instructions that, when read by a microprocessor, cause the microprocessor to perform:
accessing a document;
accessing a resolver,
wherein the resolver comprises two or more different resolver types;
chunking the document, in accordance with the resolver, into a number of chunks;
vectorizing the chunks into a number of vectorized chunks;
providing the number of vectorized chunks to a data storage for storage therein;
retrieving the number of vectorized chunks;
receiving a query;
appending the number of vectorized chunks to the query;
providing the query to a large language model; and
receiving a response therefrom.

### Claim 21 (depends on 20)

The non-transitory computer-readable media of claim 20, wherein the number of chunks is selected in accordance with a maximum chunk size for each of the number of chunks.
