# US 2024/0004906 A1 · Method of matching a set to evaluate and a reference list, corresponding matching engine and computer program

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

- Number: US 2024/0004906 A1
- Document ID: US20240004906A1
- Status: Published application
- Kind: A1
- Application number: 18/346,145
- Filed: 2023-06-30
- Published: 2024-01-04
- Earliest claimed: 2022-07-01
- Assignees: Orange
- Applicants: Orange
- Inventors: Géraldine DAMNATI
- Web page: https://patentgrep.com/patent/US20240004906A1

## CPC

- G06F 16/316: {Indexing structures}
- G06F 16/345: {Summarisation for human users}
- G06F 16/313: {Selection or weighting of terms for indexing}
- G06F 16/34: Browsing; Visualisation therefor (browsing or visualisation for clustering or classification G06F16/358)
- G06F 16/353: into predefined classes
- G06F 40/216: using statistical methods
- G06F 40/247: Thesauruses; Synonyms
- G06F 40/30: Semantic analysis
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method of matching a set to be evaluated and a reference list, the reference list being associated with a reference vector representative of the entries in the list. Such a method of matching includes: calculating a distance between the reference vector and a vector, associated with the set to evaluate, representative of elements contained in the set to evaluate, the elements comprising character strings and groups of character strings; for each entry in the reference list, calculating a first matching score for the set to evaluate and for the entry in the reference list, on the basis of the distance calculated between the reference vector and the vector associated with the set to evaluate; providing a list of entries from the reference list ordered according to the first calculated matching scores.

## Claims

### Claim 1

A method of matching a set to evaluate and a reference list, the reference list being associated with a reference vector representative of the entries in the list, wherein the method comprises:
calculating a distance between the reference vector and a vector, associated with the set to evaluate, representative of elements contained in the set to evaluate, the elements comprising character strings and groups of character strings;
for each entry in the reference list, calculating a first matching score for the set to evaluate and for the entry in the reference list, on the basis of the distance calculated between the reference vector and the vector associated with the set to evaluate; and
providing a list of entries from the reference list, ordered according to the first calculated matching scores.

### Claim 2 (depends on 1)

The matching method according to claim 1, wherein the method also comprises, for at least one element contained in the set to evaluate, calculating a centrality coefficient of the element, in the form of a sum of values of distance between the element and the other elements of the vector associated with the set to evaluate, weighted by a number of occurrences of the other elements in the set to evaluate.

### Claim 3 (depends on 1)

The matching method according to claim 1, wherein, for each entry in the reference list, the first matching score is calculated in the form of a weighted sum taking into account the distance calculated between the reference vector and the vector associated with the set to evaluate and the centrality coefficient of the at least one element.

### Claim 4 (depends on 1)

The matching method according to claim 1, wherein the method also comprises calculating a distance between the vector associated with the set to evaluate and a vector representative of constituents of the entries in the reference list.

### Claim 5 (depends on 2)

The matching method according to claim 2, wherein the method comprises:
for each constituent of the entries in the reference list, calculating a matching coefficient for the constituent, in the form of a weighted sum taking into account the distance calculated between the vector associated with the set to evaluate and the vector representative of constituents of the entries in the reference list, and the centrality coefficient of the at least one element; and
for at least one entry in the reference list, calculating a second matching score for the set to evaluate and the entry in the reference list, on the basis of the matching coefficients calculated for the constituents of the entry.

### Claim 6 (depends on 1)

The matching method according to claim 1, wherein the method further comprises, for at least some entries in the reference list, calculating an overall matching score by linearly combining the first and second matching scores,
and wherein, in the ordered list of entries in the reference list, the entries are sorted according to the overall score calculated.

### Claim 7 (depends on 1)

The matching method according to claim 1, wherein a number of reference list entries provided in the ordered list takes into account a parameter belonging to a group comprising:
a volume of the set to evaluate; and
a value from the overall scores calculated for the entries.

### Claim 8 (depends on 1)

The matching method according to claim 1, wherein at least some of the calculated distances between vectors take into account a semantic similarity between elements and/or entries of the vectors.

### Claim 9 (depends on 1)

A processing circuit comprising a processor and a memory, the memory storing program code instructions of a computer program for executing the matching method according to claim 1, when the computer program is executed by the processor.

### Claim 10

An engine for matching a set to evaluate and a reference list, the reference list being associated with a reference vector representative of the entries in the list, wherein the engine comprises a processor configured to:
calculate a distance between the reference vector and a vector, associated with the set to evaluate, representative of elements contained in the set to evaluate, the elements comprising character strings and groups of character strings;
for each entry in the reference list, calculate a first matching score for the set to evaluate and for the entry in the reference list, on the basis of the distance calculated between the reference vector and the vector associated with the set to evaluate; and
provide a list of entries from the reference list, ordered according to the first calculated matching scores.

### Claim 11 (depends on 10)

The matching engine according to claim 10, wherein the matching engine comprises a user interface and a module for displaying the ordered list of entries on the user interface.

### Claim 12 (depends on 10)

The matching engine according to claim 10, wherein the matching engine comprises a memory configured to store in combination the set to evaluate and first Q entries of the ordered list showing a first matching score higher than a determined matching score, where Q is a natural integer.

### Claim 13 (depends on 10)

The matching engine according to claim 10, wherein the processor is also configured to:
calculate a distance between the reference vector and a vector, associated with the set to evaluate, representative of elements contained in the set to evaluate, the elements comprising character strings and groups of character strings;
for each entry in the reference list, calculate a first matching score for the set to evaluate and for the entry in the reference list, on the basis of the distance calculated between the reference vector and the vector associated with the set to evaluate;
provide a list of entries from the reference list, ordered according to the first calculated matching scores; and
for at least one element contained in the set to evaluate, calculate a centrality coefficient of the element, in the form of a sum of values of distance between the element and the other elements of the vector associated with the set to evaluate, weighted by a number of occurrences of the other elements in the set to evaluate.
