# US 2021/0342658 A1 · Polysemant meaning learning and search result display

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

- Number: US 2021/0342658 A1
- Document ID: US20210342658A1
- Status: Published application
- Kind: A1
- Application number: 17/265,151
- Filed: 2019-07-30
- Published: 2021-11-04
- Earliest claimed: 2018-08-01
- Assignees: Beijing Sankuai Online Technology Co., Ltd
- Applicants: Beijing Sankuai Online Technology Co., Ltd
- Inventors: Hongsheng CHEN
- Web page: https://patentgrep.com/patent/US20210342658A1

## CPC

- G06N 3/088: Non-supervised learning, e.g. competitive learning
- G06F 16/3347: {using vector based model}
- G06F 18/2113: by ranking or filtering the set of features, e.g. using a measure of variance or of feature cross-correlation
- G06F 18/213: Feature extraction, e.g. by transforming the feature space; Summarisation; Mappings, e.g. subspace methods
- G06F 18/2163: {Partitioning the feature space}
- G06F 18/22: Matching criteria, e.g. proximity measures
- G06F 18/23: Clustering techniques
- G06N 20/00: Machine learning
- G06F 16/35: Clustering; Classification
- G06F 16/383: using metadata automatically derived from the content
- G06F 40/30: Semantic analysis
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A polysemant meaning learning method is provided. The method includes extracting a plurality of first target terms and at least one adjacent term combinations of each first target term; obtaining a capsule network model by training by taking the encoding of each first target term as an input vector and the encoding of each adjacent term combination corresponding to each first target term as an output vector; when a to-be-recognized second target term is recognized, inputting the second target term into the capsule network model, and determining a plurality of obtained intermediate vectors as feature vectors of the second target term; and clustering the feature vectors with a cosine similarity greater than a similarity threshold to generate representative terms of one or more categories and determining one or more meanings of the one or more categories.

## Claims

### Claim 1

A polysemant meaning learning method, comprising:
extracting a plurality of first target terms and one or more adjacent term combinations of each first target term from a to-be-learned text set;
respectively encoding each first target term and each adjacent term combination according to a word bank of the to-be-learned text set;
obtaining a capsule network model by training by taking the encoding of each first target term as an input vector and the encoding of each adjacent term combination corresponding to each first target term as an output vector;
when a to-be-recognized second target term is recognized, inputting the second target term into the capsule network model, and determining a plurality of obtained intermediate vectors as feature vectors of the second target term; and
clustering the feature vectors with a cosine similarity greater than a similarity threshold to generate representative terms of one or more categories to which the feature vectors of the second target term belong, and determining one or more meanings of the second target term according to the representative terms of one or more categories to which the feature vectors of the second target term belong.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the intermediate vectors are first intermediate vectors, and the capsule network model comprises at least:
an input layer, configured to input P-dimensional input vectors;
an intermediate layer, configured to convert the input vectors into M N-dimensional first intermediate vectors;
a routing layer, configured to convert the first intermediate vectors into P-dimensional second intermediate vectors; and
an output layer, configured to convert the second intermediate vectors into P-dimensional output vectors,
wherein P is a quantity of terms in the word bank of the to-be-learned text set, M is a preset maximum quantity of meanings, and N is a preset quantity of features.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the extracting a plurality of first target terms and one or more adjacent term combinations of each first target term from a to-be-learned text set comprises:
performing term segmentation on a plurality of to-be-learned texts in the to-be-learned text set, and determining a plurality of obtained terms as the first target terms;
determining, for each of the first target terms, other first target terms, whose distance from the first target term in the to-be-learned text is less than a first threshold, as adjacent terms of the first target term; and
counting mutual information between the adjacent terms of each of the first target terms, and clustering the adjacent terms whose mutual information is greater than a second threshold to obtain the one or more adjacent term combinations of the first target term.

### Claim 4 (depends on 3)

The method according to claim 3, wherein determining, for each of the first target terms, other first target terms, whose distance from the first target term in the to-be-learned text is less than a first threshold, as adjacent terms of the first target term comprises:
determining, for each of the first target terms, other first target terms, whose distance from the first target term in the to-be-learned text is less than the first threshold, as quasi-adjacent terms of the first target term; and
counting mutual information between each of the quasi-adjacent terms and the first target term, and determining the quasi-adjacent terms with mutual information between the quasi-adjacent terms and the first target term greater than a third threshold as the adjacent terms of the first target term.

### Claim 5 (depends on 1)

The method according to claim 1, further comprising:
constructing the word bank of the to-be-learned text set by using the plurality of the first target terms of the to-be-learned text set.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the clustering the feature vectors with a cosine similarity greater than a similarity threshold comprises:
counting a cosine similarity between each two of the feature vectors, and clustering the feature vectors with the cosine similarity greater than the similarity threshold into one category.

### Claim 7

A meaning-recognition-based search result display method, comprising:
acquiring a keyword of a search instruction;
inputting the keyword into a capsule network model, and determining a plurality of obtained intermediate vectors as feature vectors of the keyword;
clustering feature vectors with a cosine similarity greater than a similarity threshold to generate representative terms of one or more categories to which the feature vectors of the second target term belong, and determining a plurality of meanings of the keyword according to the representative terms of a plurality of categories to which the feature vectors of the keyword belong;
acquiring a search result according to the plurality of meanings of the keyword;
ranking search results corresponding to the plurality of meanings of the keyword; and
displaying the ranked search results corresponding to the plurality of meanings of the keyword.

### Claim 8 (depends on 7)

The method according to claim 7, wherein the ranking search results corresponding to the plurality of meanings of the keyword comprises:
acquiring a first historical search record of a current user, determining a first search intention of the current user based on the first historical search record, and ranking, according to the first search intention, the search results corresponding to the plurality of meanings of the keyword.

### Claim at position 9

9-10. (canceled)

### Claim 11

An electronic device, comprising:
a processor; and
a memory, configured to store executable instructions of the processor,
wherein the processor is configured to execute the executable instructions to perform the following operations:
extracting a plurality of first target terms and one or more adjacent term combinations of each first target term from a to-be-learned text set;
respectively encoding each first target term and each adjacent term combination according to a word bank of the to-be-learned text set;
obtaining a capsule network model by training by taking the encoding of each first target term as an input vector and the encoding of each adjacent term combination corresponding to each first target term as an output vector;
when a to-be-recognized second target term is recognized, inputting the second target term into the capsule network model, and determining a plurality of obtained intermediate vectors as feature vectors of the second target term; and
clustering the feature vectors with a cosine similarity greater than a similarity threshold to generate representative terms of one or more categories to which the feature vectors of the second target term belong, and determining one or more meanings of the second target term according to the representative terms of one or more categories to which the feature vectors of the second target term belong.

### Claim 12 (depends on 11)

The electronic device according to claim 11, wherein the processor is configured to execute the executable instructions to perform the following operations:
performing term segmentation on a plurality of to-be-learned texts in the to-be-learned text set, and determining a plurality of obtained terms as the first target terms;
determining, for each of the first target terms, other first target terms, whose distance from the first target term in the to-be-learned text is less than a first threshold, as adjacent terms of the first target term; and
counting mutual information between the adjacent terms of each of the first target terms, and clustering the adjacent terms whose mutual information is greater than a second threshold to obtain the one or more adjacent term combinations of the first target term.

### Claim 13 (depends on 12)

The electronic device according to claim 12, wherein the processor is configured to execute the executable instructions to perform the following operations:
determining, for each of the first target terms, other first target terms, whose distance from the first target term in the to-be-learned text is less than the first threshold, as quasi-adjacent terms of the first target term; and
counting mutual information between each of the quasi-adjacent terms and the first target term, and determining the quasi-adjacent terms with mutual information between the quasi-adjacent terms and the first target term greater than a third threshold as the adjacent terms of the first target term.

### Claim 14 (depends on 11)

The electronic device according to claim 11, wherein the processor is configured to execute the executable instructions to perform the following operation:
constructing the word bank of the to-be-learned text set by using the plurality of the first target terms of the to-be-learned text set.

### Claim 15 (depends on 11)

The electronic device according to claim 11, wherein the processor is configured to execute the executable instructions to perform the following operation:
counting a cosine similarity between each two of the feature vectors, and clustering the feature vectors with the cosine similarity greater than the similarity threshold into one category.

### Claim at position 15

16-18. (canceled)

### Claim 19 (depends on 11)

The electronic device according to claim 11, comprising
an input layer, configured to input P-dimensional input vectors;
an intermediate layer, configured to convert the input vectors into M N-dimensional first intermediate vectors;
a routing layer, configured to convert the first intermediate vectors into P-dimensional second intermediate vectors; and
an output layer, configured to convert the second intermediate vectors into P-dimensional output vectors,
wherein P is a quantity of terms in the word bank of the to-be-learned text set, M is a preset maximum quantity of meanings, and N is a preset quantity of features.

### Claim 20 (depends on 7)

The method according to claim 7, wherein the ranking search results corresponding to the plurality of meanings of the keyword comprises:
acquiring context information of the keyword, determining a second search intention of the current user according to the context information, and ranking, according to the second search intention, the search results corresponding to the plurality of meanings of the keyword.

### Claim 21 (depends on 7)

The method according to claim 7, wherein the ranking search results corresponding to the plurality of meanings of the keyword comprises:
acquiring second historical search records of a plurality of users, determining search popularity of the plurality of meanings according to the second historical search records of the plurality of users, and ranking, according to the search popularity of the plurality of meanings, the search results corresponding to the plurality of meanings of the keyword.

### Claim 22 (depends on 21)

The method according to claim 21, wherein the search popularity is a quantity of searches or frequency of searches.
