# US 12,762,161 B2 · 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 12,762,161 B2
- Document ID: US12762161B2
- Status: Granted
- Kind: B2
- Application number: 18/346,145
- Filed: 2023-06-30
- Published: 2024-01-04
- Granted: 2026-10-13
- Earliest claimed: 2022-07-01
- Assignees: Orange
- Applicants: Orange
- Inventors: Géraldine Damnati
- Web page: https://patentgrep.com/patent/US12762161B2

## CPC

- G06F 16/316: {Indexing structures}
- 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: 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 indexing a computer file with tags from a reference list, the reference list being associated with a reference vector representative of the tags in the reference list, wherein the method comprises, in a matching engine comprising a hardware processor:
associating textual content with the computer file;
automatic extracting, from the textual content associated with the computer file, character strings and groups of character strings corresponding to keywords;
calculating a distance between the reference vector and a vector associated with the computer file, the vector being representative of the keywords contained in the computer file;
for each tag in the reference list:
calculating a matching score for the keywords of the computer file and for the tag in the reference list, on the basis of the distance calculated between the reference vector and the vector associated with the computer file, the calculating of the matching score comprising:
for at least one keyword contained in the computer file, calculating a centrality coefficient of the keyword, in the form of a sum of values of distance between the keyword and the other keywords of the vector associated with the computer file, weighted by a number of occurrences of the other keywords in the computer file;
the matching score being calculated in the form of a weighted sum taking into account the distance calculated between the reference vector and the vector associated with the computer file and the centrality coefficient of the at least one keyword;
calculating a distance between the vector associated with the computer file and a vector representative of constituents of the tags in the reference list, the calculating of a distance comprising:
for each constituent of the tags 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 computer file and the vector representative of constituents of the tags in the reference list, and the centrality coefficient of the at least one keyword; and
for at least one tag in the reference list, calculating a second matching score for the computer file and the entry in the reference list, on the basis of the matching coefficients calculated for the constituents of the tag;
providing a list of tags from the reference list, ordered according to the calculated matching scores and second matching scores; and
automatic indexing of the computer file with tags in the ordered list of tags, without previous learning nor human intervention.

### Claim 2 (depends on 1)

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

### Claim 3 (depends on 2)

The indexing method according to claim 2, wherein a number of reference list tags provided in the ordered list takes into account a parameter belonging to a group comprising:
a volume of the computer file; and
a value from the overall scores calculated for the tags.

### Claim 4 (depends on 1)

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

### Claim 5 (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 indexing method according to claim 1, when the computer program is executed by the processor.

### Claim 6

An engine for indexing a computer file with tags from a reference list, the reference list being associated with a reference vector representative of the tags in the reference list, wherein the engine comprises a hardware processor configured to:
associate textual content with the computer file;
automatically extract, from the textual content associated with the computer file, character strings and groups of character strings corresponding to keywords;
calculate a distance between the reference vector and a vector associated with the computer file, the vector being representative of the keywords contained in the computer file;
for each tag in the reference list:
calculate a matching score for the keywords of the computer file and for the tag in the reference list, on the basis of the distance calculated between the reference vector and the vector associated with the computer file, the calculating of the matching score comprising:
for at least one keyword contained in the computer file, calculating a centrality coefficient of the keyword, in the form of a sum of values of distance between the keyword and the other keywords of the vector associated with the computer file, weighted by a number of occurrences of the other keywords in the computer file;
the matching score being calculated in the form of a weighted sum taking into account the distance calculated between the reference vector and the vector associated with the computer file and the centrality coefficient of the at least one keyword;
calculate a distance between the vector associated with the computer file and a vector representative of constituents of the tags in the reference list, the calculating of a distance comprising:
for each constituent of the tags 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 computer file and the vector representative of constituents of the tags in the reference list, and the centrality coefficient of the at least one keyword; and
for at least one tag in the reference list, calculating a second matching score for the computer file and the entry in the reference list, on the basis of the matching coefficients calculated for the constituents of the tag;
provide a list of tags from the reference list, ordered according to the calculated matching scores; and
automatically index the computer file with the tags in the ordered list of tags, without previous learning nor human intervention.

### Claim 7 (depends on 6)

The indexing engine according to claim 6, wherein the indexing engine comprises a user interface and a module for displaying the ordered list of tags on the user interface.

### Claim 8 (depends on 6)

The indexing engine according to claim 6, wherein the indexing 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.