# US 2023/0409645 A1 · Search needs evaluation apparatus, search needs evaluation system, and search needs evaluation method

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

- Number: US 2023/0409645 A1
- Document ID: US20230409645A1
- Status: Published application
- Kind: A1
- Application number: 18/339,893
- Filed: 2023-06-22
- Published: 2023-12-21
- Earliest claimed: 2021-05-05
- Assignees: Datascientist Inc.
- Applicants: Datascientist Inc.
- Inventors: Naoya SAKAKIBARA; Yuki HIROBE
- Web page: https://patentgrep.com/patent/US20230409645A1

## CPC

- G06F 16/906: Clustering; Classification
- G06F 16/9538: Presentation of query results
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

By showing information that can infer the search intent, it will be possible to develop products and create Web pages that match the search intent. A search needs evaluation apparatus acquires a plurality of document data and converts the contents or the structure of the plurality of document data into feature vector data. The search needs evaluation apparatus performs a process on the feature vector data according to a predetermined statistical identification algorithm, and classifies a plurality of document data into a plurality of subsets. The search needs evaluation apparatus outputs the analysis result of the property of search needs based on the relationship between a plurality of subsets.

## Claims

### Claim 1

(canceled)

### Claim 2

An evaluation apparatus comprising at least one processor configured to:
generate, based on a predetermined number of high-order pages in a search result among search results obtained from a search engine, the search results being for each of a plurality of search words, a multidimensional feature amount of each of the plurality of search words;
determine similarity of the multidimensional feature amounts between one search word and a plurality of other search words;
acquire a degree of how close each search word is to which subset by classifying each of the plurality of search words into one or more subsets among a plurality of subsets based on the determined similarity; and
display the degree of how close the search word is to which subset in a figure corresponding to the search word,
wherein the figure is divided into a plurality of parts and each of the parts corresponds to each of the subsets.

### Claim 3 (depends on 2)

The evaluation apparatus according to claim 2, the processor is further configured to display each of the plurality of search words and the similarity of the multidimensional feature amount to another search word in a tabular form.

### Claim 4 (depends on 3)

The evaluation apparatus according to claim 3, wherein the processor is configured to
dispose the plurality of search words in a first direction and a second direction orthogonal to the first direction, and
display the similarity of the multidimensional feature amount between corresponding search words at an intersection point in each direction.

### Claim 5 (depends on 3)

The evaluation apparatus according to claim 3, wherein the processor is configured to
dispose the plurality of search words in a first direction and a second direction orthogonal to the first direction, and
display an intersection of the first and second directions in a mode depending on the similarity between corresponding search words.

### Claim 6 (depends on 4)

The evaluation apparatus according to claim 4, wherein the processor is configured to dispose the plurality of search words in the first direction in an order depending on the similarity of the multidimensional feature amounts to another search word.

### Claim 7 (depends on 6)

The evaluation apparatus according to claim 6, wherein when one of the plurality of search words is selected by a user, the processor is configured to dispose the plurality of search words in the first direction in descending order of the similarity of the multidimensional feature amounts to the selected search word.

### Claim 8 (depends on 2)

The evaluation apparatus according to claim 2, wherein the plurality of search words includes at least one common word.

### Claim 9 (depends on 2)

The evaluation apparatus according to claim 2, wherein each of the subset corresponds to a search need.

### Claim 10

A non-transitory computer-readable medium storing an evaluation program that causes at least one processor to:
generate, based on a predetermined number of high-order pages in a search result among search results obtained from a search engine, the search results being for each of a plurality of search words, a multidimensional feature amount of each of the plurality of search words;
determine similarity of the multidimensional feature amounts between one search word and a plurality of other search words;
acquire a degree of how close each search word is to which subset by classifying each of the plurality of search words into one or more subsets among a plurality of subsets based on the determined similarity; and
display the degree of how close the search word is to which subset in a figure corresponding to the search word,
wherein the figure is divided into a plurality of parts and each of the parts corresponds to each of the subsets.

### Claim 11

An evaluation method performed by at least one processor, the method comprising:
generating, based on a predetermined number of high-order pages in a search result among search results obtained from a search engine, the search results being for each of a plurality of search words, a multidimensional feature amount of each of the plurality of search words;
determine similarity of the multidimensional feature amounts between one search word and a plurality of other search words;
acquiring a degree of how close each search word is to which subset by classifying each of the plurality of search words into one or more subsets among a plurality of subsets based on the determined similarity; and
displaying the degree of how close the search word is to which subset in a figure corresponding to the search word,
wherein the figure is divided into a plurality of parts and each of the parts corresponds to each of the subsets.
