# US 2026/0099532 A1 · Systems and methods for resolving large taxonomy selection

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

- Number: US 2026/0099532 A1
- Document ID: US20260099532A1
- Status: Published application
- Kind: A1
- Application number: 19/349,038
- Filed: 2025-10-03
- Published: 2026-04-09
- Earliest claimed: 2024-10-04
- Assignees: Elsevier, Inc.
- Applicants: Elsevier, Inc.
- Inventors: Seyedamin Tabatabaei; Georgios Tsatsaronis; Michael Parsons; Georgia Hellard Timm; Sarah Fancher; Gregory J. Gordon
- Web page: https://patentgrep.com/patent/US20260099532A1

## CPC

- G06F 16/35: Clustering; Classification
- G06F 16/322: {Trees}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for classifying a document into a hierarchical taxonomy associated with a corpus of documents, the document being associated with document information, the hierarchical taxonomy comprising a plurality of levels with each level comprising one or more nodes, each node comprising a label; the method may include inputting the taxonomy and the document information into a large language model, inputting a prompt into the large language model to cause the large language model to output one or more nodes of the taxonomy for classifying the document based on the document information, and classifying the document into each of the nodes output by the large language model.

## Claims

### Claim 1

A method for classifying a document into a hierarchical taxonomy associated with a corpus of documents, the document being associated with document information, the hierarchical taxonomy comprising a plurality of levels with each level comprising one or more nodes, each node comprising a label, the method comprising:
inputting the taxonomy and the document information into a large language model;
inputting a prompt into the large language model to cause the large language model to output one or more nodes of the taxonomy for classifying the document based on the document information; and
classifying the document into each of the nodes output by the large language model.

### Claim 2 (depends on 1)

The method of claim 1, wherein each node comprises a description.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
prior to inputting the taxonomy and the document information into the large language model, causing the large language model to generate a description for each node of the taxonomy based on the label of the node and a label of its parent node.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
prior to inputting the taxonomy and the document information into the large language model, expanding acronyms of the labels of the nodes in the taxonomy.

### Claim 5 (depends on 1)

The method of claim 1, wherein the document information comprises a title, an abstract, and one or more keywords.

### Claim 6 (depends on 1)

The method of claim 1, wherein:
the prompt causes the large language model to traverse top-level nodes of the taxonomy to identify nodes having labels relevant to the document based on the document information, and the method further comprises:
an iterative process of causing the large language model to identify relevant child nodes of nodes previously identified as relevant, the iterative process continuing until leaf nodes of the taxonomy are reached; and
classifying the document into each of the labels associated with the leaf nodes of the taxonomy identified as relevant.

### Claim 7 (depends on 1)

The method of claim 1, wherein the prompt causes the large language model to output a node for classifying the document if the label of the node is relevant to the document and a label of the node's parent node is relevant to the document.

### Claim 8 (depends on 1)

The method of claim 1, wherein the prompt causes the large language model to:
determine a relevancy score for each node of the taxonomy based on a similarity between the label of the node and the document information;
rank the leaf nodes of the taxonomy based on the relevancy score of each leaf node; and
output a predetermined number of the highest-ranking leaf nodes.

### Claim 9 (depends on 8)

The method of claim 8, wherein the prompt causes the large language model to rank the leaf nodes of the taxonomy based on the relevancy score of each leaf node and the relevancy score of the parent node of each leaf node.

### Claim 10 (depends on 8)

The method of claim 8, wherein the prompt causes the large language model to rank the leaf nodes of the taxonomy based on the relevancy score of each leaf and the relevancy score of each ancestor node of each leaf node.

### Claim 11 (depends on 1)

The method of claim 1, wherein the prompt causes the large language model to:
determine whether each leaf node of the taxonomy is relevant to the document based on the document information;
for each leaf node determined to be relevant, determine whether its parent node is relevant to the document based on the document information; and
output each leaf node for which the leaf node and its parent node are determined to be relevant to the document.

### Claim 12 (depends on 1)

The method of claim 1, further comprising:
determining a first embedding of the document information;
determining a second embedding of the label of each node;
determining a cosine similarity between the first embedding of the document information and the second embedding of the label of each node;
removing each node from the taxonomy having a cosine similarity value lower than a predetermined threshold to determine a pruned taxonomy; and
inputting the pruned taxonomy and the document information into the large language model.

### Claim 13 (depends on 1)

The method of claim 1, further comprising:
prompting the large language model to determine a predetermined number of the most relevant nodes output by the large language model for classifying the document; and
classifying the document into each of the determined most relevant nodes.

### Claim 14 (depends on 1)

The method of claim 1, further comprising:
prompting the large language model to determine the most relevant node output by the large language model for classifying the document among sibling nodes having the same parent; and
classifying the document into the most relevant nodes among the sibling nodes.

### Claim 15

A system for classifying a document into a hierarchical taxonomy associated with a corpus of documents, the document being associated with document information, the hierarchical taxonomy comprising a plurality of levels with each level comprising one or more nodes, each node comprising a label, the system comprising:
one or more processors; and
a non-transitory, processor-readable storage medium comprising one or more programming instructions stored thereon that, when executed, causes the one or more processors to:
input the taxonomy and the document information into a large language model;
input a prompt into the large language model to cause the large language model to output one or more nodes of the taxonomy for classifying the document based on the document information; and
classify the document into each of the nodes output by the large language model.

### Claim 16 (depends on 15)

The system of claim 15, wherein:
the prompt causes the large language model to traverse top-level nodes of the taxonomy to identify nodes having labels relevant to the document based on the document information, and the programming instructions further cause the one or more processors to:
perform an iterative process of causing the large language model to identify relevant child nodes of nodes previously identified as relevant, the iterative process continuing until leaf nodes of the taxonomy are reached; and
classify the document into each of the labels associated with the leaf nodes of the taxonomy identified as relevant.

### Claim 17 (depends on 15)

The system of claim 15, wherein the prompt causes the large language model to output a node for classifying the document if the label of the node is relevant to the document and a label of the node's parent node is relevant to the document.

### Claim 18 (depends on 15)

The system of claim 15, wherein the prompt causes the large language model to:
determine a relevancy score for each node of the taxonomy based on a similarity between the label of the node and the document information;
rank the leaf nodes of the taxonomy based on the relevancy score of the nodes; and
output a predetermined number of the highest-ranking leaf nodes.

### Claim 19 (depends on 15)

The system of claim 15, wherein the prompt causes the large language model to:
determine whether each leaf node of the taxonomy is relevant to the document based on the document information;
for each leaf node determined to be relevant, determine whether its parent node is relevant to the document based on the document information; and
output each leaf node for which the leaf node and its parent node are determined to be relevant to the document.

### Claim 20 (depends on 15)

The system of claim 15, wherein the programming instructions further cause the one or more processors to:
determine a first embedding of the document information;
determine a second embedding of the label of each node;
determine a cosine similarity between the first embedding of the document information and the second embedding of the label of each node;
remove each node from the taxonomy having a cosine similarity value lower than a predetermined threshold to determine a pruned taxonomy; and
input the pruned taxonomy and the document information into the large language model.
