# US 2025/0147989 A1 · Entity linking and filtering using efficient search tree and machine learning representations

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

- Number: US 2025/0147989 A1
- Document ID: US20250147989A1
- Status: Published application
- Kind: A1
- Application number: 19/014,340
- Filed: 2025-01-09
- Published: 2025-05-08
- Earliest claimed: 2022-04-19
- Assignees: Sap SE
- Applicants: Sap SE
- Inventors: Sundeep Gullapudi; Rajesh Vellore Arumugam; Matthias Frank; Wei Xia
- Web page: https://patentgrep.com/patent/US20250147989A1

## CPC

- G06F 16/322: {Trees}
- G06F 16/90344: {by using string matching techniques}
- G06F 16/332: Query formulation
- G06F 16/3334: {Selection or weighting of terms from queries, including natural language queries}
- G06F 40/284: Lexical analysis, e.g. tokenisation or collocates
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Methods, systems, and computer-readable storage media for a ML system that reduces a number of target items from consideration as potential matches to a query item using token embeddings and a search tree.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A computer-implemented method for matching a query item to one or more target items using machine learning (ML) models, the method being executed by one or more processors and comprising:
prior to matching a query item to one or more target items of a superset of target items during inference, providing a set of target items from the superset of target items by:
for a first query item token of the query item:
identifying, within a search space, at least one target item token that is sufficiently similar to the first query item token, and
associating the first query item token with a revised search space within a tracker, the tracker comprising an array data structure that is initialized with a set of null values, associating the first query item token with the revised search space within the tracker comprises replacing a null value with a search space index indicating where the first query item token was found in the search space, and wherein the revised search space is provided in a queue of search spaces, a length of the queue being defined by a window parameter;
determining, based on the length between the items being within a window size of the window parameter, a set of matched item tokens indicating one of a match and a partial match between a query item token and a target item token;
defining the set of target items from the set of matched item tokens; and
executing inference to match the query item to one or more target items in the set of target items to provide inference results, the inference results indicating a match between the query item and at least one target item in the set of target items.

### Claim 22 (depends on 21)

The method of claim 21, wherein the search space is defined within a search tree comprising a set of nodes, each node representative of a respective target item token in a set of target item tokens.

### Claim 23 (depends on 21)

The method of claim 21, wherein the revised search space comprises a search sub-space of the search space.

### Claim 24 (depends on 21)

The method of claim 21, further comprising determining that no target item tokens represented in the revised search space is sufficiently similar to a second query item token, and in response, comparing a second query item token embedding to target item token embeddings of target items tokens included within an alternative search space present in the queue.

### Claim 25 (depends on 24)

The method of claim 24, further comprising, for the second query item token comparing a second query item token embedding to target item token embeddings of target items tokens included within the revised search space.

### Claim 26 (depends on 21)

The method of claim 21, wherein a first query item token embedding is determined by a first ML model, and the at least one target item token that is sufficiently similar to the first query item token is identified by comparing the first query item token embedding to target item token embeddings of target items tokens included within the search space.

### Claim 27 (depends on 26)

The method of claim 26, wherein, during a training phase, the first ML model is fine-tuned based on sets of perturbations, each set of perturbations corresponding to an item token.

### Claim 28 (depends on 21)

The method of claim 21, wherein executing inference to match the query item to one or more target items in the set of target items to provide inference results comprises processing the query item and target items of the set of target items through a second ML model that outputs the inference results.

### Claim 29 (depends on 21)

The method of claim 21, wherein a number of target items in the set of target items being less than a number of target items in the superset of target items.
