CN117668149A

CN117668149A - Search processing method and device, electronic equipment and storage medium

Info

Publication number: CN117668149A
Application number: CN202211017203.2A
Authority: CN
Inventors: 殷朝; 李响
Original assignee: Tencent Technology Shenzhen Co Ltd
Current assignee: Tencent Technology Shenzhen Co Ltd
Priority date: 2022-08-23
Filing date: 2022-08-23
Publication date: 2024-03-08

Abstract

The application provides a search processing method, a search processing device, electronic equipment and a storage medium; the method comprises the following steps: displaying query information input through an information input operation in response to the information input operation; displaying a plurality of prompt words corresponding to the query information, wherein each prompt word is independently used as an option; and responding to the selection operation, and displaying the search results corresponding to at least one prompt word selected by the selection operation. According to the method and the device, the search intention can be accurately identified, and the accuracy of search acquisition is improved.

Description

Search processing method and device, electronic equipment and storage medium

Technical Field

The present disclosure relates to computer technology, and in particular, to a search processing method, apparatus, electronic device, and storage medium.

Background

When a user searches for content in a strange area, it is often difficult to accurately describe his search intention. This is because, on the one hand, since the user does not know the queried content well, the user cannot describe the content to be searched using the canonical vocabulary; on the other hand, the user lacks system knowledge about the target area and cannot raise a key problem. Therefore, the search engine obtains too little information to clarify the actual search intent of the user. The user needs to get the answer, and the answer is gradually close to the answer by searching the similar words, browsing the content and replacing the search words, so that the search efficiency and the accuracy of the search result are affected.

The related technology aims at improving the accuracy of the search result, and a better scheme is not available.

Disclosure of Invention

The embodiment of the application provides a search processing method, a search processing device, electronic equipment, a computer readable storage medium and a computer program product, which can accurately identify a search intention and further improve the accuracy of acquiring search.

The technical scheme of the embodiment of the application is realized as follows:

the embodiment of the application provides a search processing method, which comprises the following steps:

displaying query information input through an information input operation in response to the information input operation;

displaying a plurality of prompt words corresponding to the query information, wherein each prompt word is independently used as an option;

and responding to the selection operation, and displaying search results corresponding to at least one prompt word selected by the selection operation.

The embodiment of the application provides a search processing device, which comprises: .

The input module is used for responding to the information input operation and displaying the query information input through the information input operation;

the display module is used for displaying a plurality of prompt words corresponding to the query information, wherein each prompt word is independently used as an option;

and the search module is used for responding to the selection operation and displaying search results corresponding to at least one prompt word selected by the selection operation.

An embodiment of the present application provides an electronic device, including:

a memory for storing computer executable instructions;

and the processor is used for realizing the search processing method provided by the embodiment of the application when executing the computer executable instructions stored in the memory.

The embodiment of the application provides a computer readable storage medium, which stores computer executable instructions for implementing the search processing method provided by the embodiment of the application when the computer readable storage medium causes a processor to execute the computer executable instructions.

Embodiments of the present application provide a computer program product comprising a computer program or computer-executable instructions which, when executed by a processor, implement the search processing method provided by the embodiments of the present application.

The embodiment of the application has the following beneficial effects:

based on the input query information, corresponding prompt words are displayed, and different prompt words are provided as alternative items based on the query information, so that a user can flexibly select one or more search words according to search intention, search results obtained by the search words can accord with the search intention, and search efficiency and accuracy of the search results are improved.

Drawings

Fig. 1 is an application mode schematic diagram of a search processing method provided in an embodiment of the present application;

fig. 2 is a schematic structural diagram of a terminal device 400 provided in an embodiment of the present application;

fig. 3A to 3K are schematic flow diagrams of a search processing method according to an embodiment of the present application;

FIG. 4A is a schematic diagram of a search page provided by an embodiment of the present application;

FIG. 4B is a schematic diagram of a word cloud provided by an embodiment of the present application;

FIG. 4C is a schematic diagram of a search page provided by an embodiment of the present application;

FIG. 4D is a schematic diagram of a word cloud provided by an embodiment of the present application;

FIG. 4E is a schematic diagram of a search page provided by an embodiment of the present application;

FIG. 4F is a schematic diagram of a word cloud provided by an embodiment of the present application;

FIG. 5A is a schematic diagram of a word cloud provided by an embodiment of the present application;

FIG. 5B is a schematic diagram of a second control provided by an embodiment of the present application;

FIG. 5C is a schematic diagram of a search page provided by an embodiment of the present application;

5D-5E are schematic diagrams of a second control provided by an embodiment of the present application;

FIG. 5F is a schematic diagram of a search page provided by an embodiment of the present application;

FIGS. 5G-5I are schematic diagrams of a second control provided by embodiments of the present application;

FIG. 6A is a schematic flow chart of an alternative search processing method according to an embodiment of the present application;

Fig. 6B is a schematic flow chart of a search processing method according to an embodiment of the present application;

FIG. 6C is a schematic diagram of a search page provided by an embodiment of the present application;

fig. 6D to 6F are schematic diagrams of a second control provided in an embodiment of the present application.

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the present application will be described in further detail with reference to the accompanying drawings, and the described embodiments should not be construed as limiting the present application, and all other embodiments obtained by those skilled in the art without making any inventive effort are within the scope of the present application.

In the following description, reference is made to "some embodiments" which describe a subset of all possible embodiments, but it is to be understood that "some embodiments" can be the same subset or different subsets of all possible embodiments and can be combined with one another without conflict.

In the following description, the terms "first", "second", "third" and the like are merely used to distinguish similar objects and do not represent a particular ordering of the objects, it being understood that the "first", "second", "third" may be interchanged with a particular order or sequence, as permitted, to enable embodiments of the application described herein to be practiced otherwise than as illustrated or described herein.

It should be noted that, in the embodiments of the present application, related data such as user information, user feedback data, etc., when the embodiments of the present application are applied to specific products or technologies, user permission or consent needs to be obtained, and the collection, use, and processing of related data needs to comply with related laws and regulations and standards of related countries and regions.

Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of the present application only and is not intended to be limiting of the present application.

Before further describing embodiments of the present application in detail, the terms and expressions that are referred to in the embodiments of the present application are described, and are suitable for the following explanation.

1) Keyword: words obtained based on the query information can be obtained by splitting the query information and extracting features.

2) Word cloud: and the two-dimensional area is formed by recommended keywords and candidate words, the two-dimensional area is diffused from the central keywords to the periphery, and each recommended word in the word cloud is mutually close to and correlated with each other, so that a plurality of keywords similar to the map effect are formed.

3) Word graph: including a plurality of nodes connected by lines, each node representing a word, the distance between the nodes (the number of edges that are experienced from one node to another) reflecting the distance between the vector representations of the words represented by the nodes, i.e., the higher the correlation of words represented by any 2 nodes, the smaller the distance between the 2 nodes.

4) Knowledge Graph (KG, knowledgegraph), which is the most effective representation of relationships, is a network of relationships that is obtained by linking together all different kinds of information. Knowledge graph is a semantic network that reveals relationships between entities, and can formally describe real world things and their interrelationships. Nodes in the graph are expressed by "entities (entities)", and "edges" in the graph are expressed by "relationships". In the embodiment of the application, the entity corresponding to each node in the knowledge graph can be represented by vocabulary. Based on the nodes in the knowledge graph with which the keywords are associated, candidate words for the keywords may be determined.

The following describes exemplary applications of the electronic device provided in the embodiments of the present application, where the electronic device provided in the embodiments of the present application may be implemented as a notebook computer, a tablet computer, a desktop computer, a set-top box, a mobile device (for example, a mobile phone, a portable music player, a personal digital assistant, a dedicated messaging device, a portable game device), a vehicle-mounted terminal, and other various types of user terminals, and may also be implemented as a server. In the following, an exemplary application when the device is implemented as a terminal device or a server will be described.

Referring to fig. 1, fig. 1 is a schematic diagram of an application mode of a search processing method according to an embodiment of the present application; by way of example, a server is concerned comprising: database 500, server 200, network 300, and terminal device 400. The terminal device 400 is connected to the server 200 via the network 300, and the network 300 may be a wide area network or a local area network, or a combination of both.

By way of example, server 200 may be a server of a search engine, the user is a user using a search engine, and database 500 is an encyclopedia database. The following is a description in connection with the above examples.

The user inputs query information in the first control 101 of the search page 103 through the terminal device 400, at least one keyword related to the query information and a plurality of candidate words related to the keyword are displayed in the second control 102 based on the query information, and the selected word is used as a search word in response to a selection operation for at least one word in the second control 102. The terminal device 400 sends a search request carrying a search word to the server 200, the server 200 obtains a search result corresponding to the search word from the database based on the search request, and returns the search result to the terminal device 400, and the search result corresponding to the search word is displayed in the terminal device 400.

By way of example, the server 200 may be a server of an internet of vehicles platform, the user being a user performing a place name search, and the database 500 storing map data. The following is a description in connection with the above examples.

The user does not develop an explicit travel plan, and the user inputs query information (e.g., where to play on the weekend) in the first control 101 of the search page 103 via the terminal device 400, and based on the query information, at least one keyword related to the query information (e.g., a place name related to an entertainment place where the user is in the same urban area) and a plurality of candidate words related to the keyword (e.g., functions related to the entertainment place, play methods) are displayed in the second control 102, and if the user is interested in some play methods and places, the user can select the corresponding candidate word as a search word. In response to a selection operation for at least one word in the second control 102, the selected word is taken as a search word. The terminal device 400 sends a search request carrying a search word to the server 200, the server 200 obtains a search result corresponding to the search word from the database 500 based on the search request, and returns the search result to the terminal device 400, and the search result corresponding to the search word is displayed in the terminal device 400.

The embodiment of the application can be realized through a block chain technology, the search result of the embodiment of the application can be used as a detection result, the detection result is uploaded to a block chain for storage, and the reliability of the detection result is ensured through a consensus algorithm. Blockchains are novel application modes of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanisms, encryption algorithms, and the like. The Blockchain (Blockchain), which is essentially a decentralised database, is a string of data blocks that are generated by cryptographic means in association, each data block containing a batch of information of network transactions for verifying the validity of the information (anti-counterfeiting) and generating the next block. The blockchain may include a blockchain underlying platform, a platform product services layer, and an application services layer.

The embodiment of the application can be realized through a Database technology, and a Database (Database) can be taken as a place where the electronic file cabinet stores electronic files in short, so that a user can perform operations such as adding, inquiring, updating, deleting and the like on the data in the files. A "database" is a collection of data stored together in a manner that can be shared with multiple users, with as little redundancy as possible, independent of the application.

The database management system (Database Management System, DBMS) is a computer software system designed for managing databases, and generally has basic functions of storage, interception, security, backup, and the like. The database management system may classify according to the database model it supports, e.g., relational, XML (Extensible Markup Language ); or by the type of computer supported, e.g., server cluster, mobile phone; or by classification according to the query language used, such as structured query language (SQL, structured Query Language), XQuery; or by performance impact emphasis, such as maximum scale, maximum speed of operation; or other classification schemes. Regardless of the manner of classification used, some DBMSs are able to support multiple query languages across categories, for example, simultaneously.

In some embodiments, the server may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDNs, basic cloud computing services such as big data and artificial intelligence platforms, and the like. The terminal device may be, but is not limited to, a smart phone, a tablet computer, a notebook computer, a desktop computer, a smart speaker, a smart watch, a vehicle-mounted terminal, and the like. The terminal device and the server may be directly or indirectly connected through wired or wireless communication, which is not limited in the embodiment of the present application.

The embodiment of the application can also be realized by Cloud Technology, and the Cloud Technology (Cloud Technology) is based on the general terms of network Technology, information Technology, integration Technology, management platform Technology, application Technology and the like applied by a Cloud computing business mode, can form a resource pool, and is used as required, flexible and convenient. Cloud computing technology will become an important support. Background services of technical networking systems require a large amount of computing, storage resources, such as video websites, picture-like websites, and more portals. Along with the advanced development and application of the internet industry and the promotion of requirements of search services, social networks, mobile commerce, open collaboration and the like, each article possibly has a hash code identification mark, the hash code identification mark needs to be transmitted to a background system for logic processing, data of different levels can be processed separately, and various industry data needs strong system rear shield support and can be realized only through cloud computing.

Referring to fig. 2, fig. 2 is a schematic structural diagram of an electronic device 400 provided in an embodiment of the present application, where the electronic device may be a terminal device or a server, and the electronic device 400 shown in fig. 2 includes: at least one processor 410, a memory 450, at least one network interface 420, and a user interface 430. The various components in electronic device 400 are coupled together by bus system 440. It is understood that the bus system 440 is used to enable connected communication between these components. The bus system 440 includes a power bus, a control bus, and a status signal bus in addition to the data bus. But for clarity of illustration the various buses are labeled in fig. 2 as bus system 440.

The processor 410 may be an integrated circuit chip having signal processing capabilities such as a general purpose processor, such as a microprocessor or any conventional processor, or the like, a digital signal processor (DSP, digital Signal Processor), or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or the like.

The user interface 430 includes one or more output devices 431, including one or more speakers and/or one or more visual displays, that enable presentation of the media content. The user interface 430 also includes one or more input devices 432, including user interface components that facilitate user input, such as a keyboard, mouse, microphone, touch screen display, camera, other input buttons and controls.

Memory 450 may be removable, non-removable, or a combination thereof. Exemplary hardware devices include solid state memory, hard drives, optical drives, and the like. Memory 450 optionally includes one or more storage devices physically remote from processor 410.

Memory 450 includes volatile memory or nonvolatile memory, and may also include both volatile and nonvolatile memory. The nonvolatile Memory may be a Read Only Memory (ROM), and the volatile Memory may be a random access Memory (RAM, random Access Memory). The memory 450 described in the embodiments herein is intended to comprise any suitable type of memory.

In some embodiments, memory 450 is capable of storing data to support various operations, examples of which include programs, modules and data structures, or subsets or supersets thereof, as exemplified below.

An operating system 451 including system programs, e.g., framework layer, core library layer, driver layer, etc., for handling various basic system services and performing hardware-related tasks, for implementing various basic services and handling hardware-based tasks;

a network communication module 452 for accessing other electronic devices via one or more (wired or wireless) network interfaces 420, the exemplary network interface 420 comprising: bluetooth, wireless compatibility authentication (WiFi), and universal serial bus (USB, universal Serial Bus), etc.;

a presentation module 453 for enabling presentation of information (e.g., a user interface for operating peripheral devices and displaying content and information) via one or more output devices 431 (e.g., a display screen, speakers, etc.) associated with the user interface 430;

an input processing module 454 for detecting one or more user inputs or interactions from one of the one or more input devices 432 and translating the detected inputs or interactions.

In some embodiments, the search processing apparatus provided in the embodiments of the present application may be implemented in a software manner, and fig. 2 shows the search processing apparatus 455 stored in the memory 450, which may be software in the form of a program and a plug-in, and includes the following software modules: the input module 4551, the display module 4552 and the search module 4553 are logical, and thus may be arbitrarily combined or further split according to the functions implemented. The functions of the respective modules will be described hereinafter.

The search processing method provided by the embodiment of the present application will be described with reference to exemplary applications and implementations of the terminal device provided by the embodiment of the present application.

Referring to fig. 3A, fig. 3A is a schematic flow chart of a search processing method provided in the embodiment of the present application, and the following description will be made with reference to the steps shown in fig. 3A, with the terminal device 400 in fig. 1 as an execution body.

In step 301, in response to an information input operation, query information input through the information input operation is displayed.

For example, the query information and the prompt term may be implemented by integrating in one control, or may be integrated in 2 different controls, that is, including: the first controls of the search box and the search button (the first controls are used for receiving information input operation and displaying corresponding query information), and the second controls for displaying a plurality of prompt words are described below by taking the first controls and the second controls as examples. The first control may be a search engine control. The second control may be a smart map. The user is a user using a search engine, and embodiments of the present application are explained in connection with the above examples.

By way of example, the query information may be English, chinese, pinyin, and the like. The search processing method provided by the embodiment of the application is suitable for multiple languages. For example: english and Chinese.

Referring to fig. 4A, fig. 4A is a schematic diagram of a search page provided in an embodiment of the present application; search page 404A includes a first control 401A, a second control 402A, and a third control 403A. The first control 401A includes a search box 408A and a search button 409A, the search box 408A for entering query information 407A; such as "how fast weight loss is not desired in fig. 4A. The information input operation may be implemented by typing, pasting content, voice input, etc.

With continued reference to FIG. 3A, in step 302, a plurality of hint words corresponding to query information are displayed.

By way of example, each prompt word is individually as an option, and each option may be singled out or multiple options may be simultaneously selected (i.e., multiple options). The individual options may be displayed by:

mode 1, each prompt word is displayed in a corresponding sub-control, and the sub-control is displayed in an identification form, wherein the sub-control is in a form of a bounding box (for example, rectangle and ellipse). The bounding box where the prompting word in the selected state is located and the bounding box where the prompting word in the non-selected state is located adopt different display modes. For example: the bounding box (or along with the interior) is different color, the bounding box is bolded, the bounding box (or along with the interior) is highlighted, etc. Referring to fig. 4A, fig. 4A is a schematic diagram of a search page provided in an embodiment of the present application; each prompt word (i.e., keyword 405A, candidate word 406A) in the second control 402A corresponds to one child control, and the bounding boxes of the child controls corresponding to the selected word are displayed in other colors, forming a distinction from the unselected word.

Mode 2, each presentation word is displayed as a display object. In response to a selection operation (e.g., click) for the alert word, the selected alert word displayed in the selected state is displayed. The prompting words in the selected state and the prompting words in the non-selected state adopt different display modes, for example: different colors, font enlargement, bolding, highlighting, etc. Referring to fig. 6C, fig. 6C is a schematic diagram of a search page provided in an embodiment of the present application; each of the prompt words in the second control 402A is displayed as a separate display object, the prompt word 601C "does not want to run" is not selected, is displayed in a normal form, the prompt word 602C "fast weight" is selected to distinguish the font display from other prompt words, and the prompt word 602C is displayed in bold.

In some embodiments, the hint words can be ranked according to any of a variety of attributes (ranked based on queue or ranked based on ranking direction):

attribute 1, type. The ordering is by queue or queuing direction, each corresponding to a different type.

Attribute 2, query hotness. Dividing the value range of the query heat of the prompt words into a plurality of different sections, and arranging the prompt words in a queue or arrangement direction corresponding to the section of the query heat of the prompt words. For example: clockwise, the intervals of the query heat corresponding to each arrangement direction are ordered in descending order; from left to right, the intervals of the query hotness of each queue are ordered in descending order, and the prompt words in each queue are ordered according to the descending order of the query hotness.

Attribute 3, first letter. The cue words are divided into a plurality of groups according to the initial, and each group is arranged in a different arrangement direction or queue. For example: and (3) taking abcd as an initial corresponding to the first arrangement direction, taking efgh as an initial corresponding to the second arrangement direction, and so on, and arranging and displaying the prompt words with the initial belonging to the abcd in the first arrangement direction. For another example: from left to right, the first letters corresponding to each queue are respectively an abcd first queue and an efgh second queue, and so on, the prompting words with the first letters belonging to the abcd are displayed in the first queue, and the prompting words in the first queue are ordered in descending order according to the first letters a to d.

In some embodiments, referring to fig. 6B, fig. 6B is a schematic flow diagram of a search processing method according to an embodiment of the present application; step 302 may be implemented by the following steps 3021A to 3022A, which are described in detail below.

In step 3021A, the cue words belonging to a plurality of types are displayed in a plurality of arrangement directions, respectively.

For example, at least one type of hint word is distributed in each arrangement direction. When the number N of the types is smaller than or equal to the type number threshold value N, N types of prompt words are distributed in a one-to-one correspondence manner in N arrangement directions; when the number N of the types is larger than the threshold N of the number of the types, N-1 types of prompting words are distributed in the first N-1 arrangement directions in a one-to-one correspondence mode, and N-N+1 types of prompting words are distributed in the nth arrangement direction.

For example: assuming that the number of types N is 6 and the type number threshold N is 6, 360 degrees are divided into 6 60-degree sector areas on average, each area corresponds to one arrangement direction, and each arrangement direction corresponds to one type of candidate word. Referring to fig. 6D, fig. 6D is a schematic diagram of a second control provided in an embodiment of the present application. A plurality of prompt words 601D are displayed in the second control 602D, the direction pointed by the classification center line 604D is an arrangement direction, the prompt words 601D of each type are distinguished through the classification boundary 603D, and the prompt words of the types 1 to 6 respectively correspond to different arrangement directions.

Assuming that the number n is 7, and 7 is greater than the type number threshold 6, the 1 st to 5 th types of corresponding 1 st to 5 th arrangement directions are distributed with 1 to 5 types of prompting words respectively corresponding to the types, and the 6 th and 7 th types of candidate words are distributed in the 6 th arrangement direction. Referring to fig. 6E, fig. 6E is a schematic diagram of a second control provided by an embodiment of the present application. In the 1 st to 5 th arrangement directions corresponding to the 1 st to 5 th types, 1 to 5 types of prompt words corresponding to the 1 st to 5 th types are distributed, and the prompt words 601E corresponding to the type 7 and the prompt words corresponding to the type 6 are distributed in the 6 th arrangement direction.

Alternatively, in step 3022A, the alert words belonging to the plurality of types are displayed in the plurality of queues, respectively.

Referring to fig. 6F, fig. 6F is a schematic diagram of a second control provided in an embodiment of the present application. The queues can be characterized in a form, the second control 602F comprises a plurality of queues, each queue corresponds to a different deletion control 603F, and the deletion control 603F can be used for hiding the corresponding queue; each queue corresponds to a different up control 604F and down control 606F, respectively, the up control 604F being for browsing the prompt words in the queue up and the down control 606F being for browsing the prompt words in the queue down.

The plurality of queues are illustratively in the form of a plurality of rows or columns, with at least one type of cue word being distributed in each queue. The plurality of queues may be characterized by a tabular form. When the number N of the types is smaller than or equal to the type number threshold value N, N types of prompt words are distributed in a one-to-one correspondence manner in N arrangement directions; when the number N of the types is larger than the threshold N of the number of the types, N-1 types of prompting words are distributed in the first N-1 arrangement directions in a one-to-one correspondence mode, and N-N+1 types of prompting words are distributed in the nth arrangement direction.

For example: the type number threshold N is 3, and the number of types is 3, and then 3 types of candidate words are distributed in the 3 queues in a one-to-one correspondence manner. For another example: with continued reference to fig. 6F, the number of types is 4 (including type 1, type 2, type 3, and type 4), and is greater than the type number threshold 3, then 2 types of alert words (type 1: alert word 611, alert word 612, alert word 613; type 2: alert word 621, alert word 622, alert word 623) are distributed in the first 2 queues of the second control 602F in one-to-one correspondence, and the 3 rd and 4 th types of alert words are distributed in the 3 rd queue. In the third queue, the hint words 631, 641, 632 corresponding to type 3 and type 4 are arranged in a staggered manner.

The execution of step 3022A and step 3021A is not sequential.

In some embodiments, the plurality of hint words includes: at least one keyword corresponding to the query information, and a plurality of candidate words related to the at least one keyword. Keywords, i.e., a plurality of recommended words derived based on query information, may be determined by:

mode 1, extracting directly from query information, i.e. keywords from query information, for example: the query information is decomposed into a plurality of words, part of the words are extracted as key words, and the words can be extracted to obtain the words of 'do not want to exercise' and 'do not want to exercise' based on 'how fast to lose weight'.

Mode 2, performing natural language semantic understanding on query information to obtain, where the keyword does not necessarily include the query information, for example: the query information is subjected to natural language processing (Natural Language Processing, NLP), and the 'how to lose weight' can be extracted based on the 'how to lose weight quickly and do not want to exercise'.

Mode 3, when the query information is pinyin or letters, the keywords are corresponding words (e.g., chinese or English, depending on the language setting of the search engine) obtained based on pinyin or letter analysis. For example: the input query information is JF or jianfei, jianf and the like. Based on the inquiry information, the key words corresponding to the pinyin can be obtained for losing weight. For another example: the input query information is the letter NLP, and the corresponding keywords Natural Language Processing and natural language processing can be obtained based on the query information.

By way of example, the candidate words are keywords related words, and may be obtained based on a knowledge-graph, for example: and acquiring the vocabulary corresponding to the node associated with the keyword in the knowledge graph, and taking the acquired vocabulary as a candidate word of the keyword.

In some embodiments, the keywords, candidates, displayed in the second control may be updated in real-time or displayed at the end of the information input operation. The real-time update is that according to the character input operation in the first control, each time a character is input, a character is displayed in the first control, the terminal device recognizes the input character as query information, and the keyword and the candidate word are displayed in the second control. The information input operation is displayed at the end (e.g., input operation is detected, subsequent input operation is stopped), that is, the corresponding keyword and candidate word are displayed according to the character that has been input.

In some embodiments, the candidate words may be ranked according to any of the different following attributes (ranked based on queue or ranked based on ranking direction):

Attribute 2, query hotness. Dividing the value range of the query heat of the candidate words into a plurality of different sections, and arranging the candidate words in a queue or arrangement direction corresponding to the section of the query heat of the candidate words. For example: clockwise, the intervals of the query heat corresponding to each arrangement direction are ordered in descending order; from left to right, the intervals of query hotness of each queue are ordered in descending order, and the candidate words in each queue are ordered according to the descending order of query hotness.

Attribute 3, first letter. The candidate words are divided into a plurality of groups according to the initial, each group being arranged in a different arrangement direction or queue. For example: and taking abcd as an initial corresponding to the first arrangement direction, taking efgh as an initial corresponding to the second arrangement direction, and so on, and arranging and displaying candidate words with initial belonging to abcd in the first arrangement direction. For another example: from left to right, the initial letters corresponding to each queue are respectively an abcd first queue and an efgh second queue, and so on, the candidate words with the initial letters belonging to the abcd are displayed in the first queue, and the candidate words in the first queue are ordered in descending order according to the initial letters a to d.

In some embodiments, referring to fig. 3B, fig. 3B is a schematic flow chart of a search processing method provided in an embodiment of the present application; step 3021A may be implemented by the following steps 3021B to 3022B, which are specifically described below.

In step 3021B, at least one keyword is displayed in a second control.

Illustratively, the at least one keyword is located in a center position of the second control. With continued reference to FIG. 4A, a keyword 405A (e.g., "quick weight loss", "unwanted movement") is of a different color than the candidate word 406A and is displayed in a center position of the second control 402A. The manner of obtaining the keywords is described above and will not be described here again.

In step 3022B, candidate words belonging to a plurality of types are displayed in a plurality of arrangement directions outward from at least one keyword, respectively.

For example, at least one type of candidate word is distributed in each arrangement direction, and different types of candidate words are associated with at least one keyword. Each arrangement direction corresponds to an angle interval taking at least one keyword as an endpoint in the second control, and rays with the maximum angle and the minimum angle are 2 boundary lines of the arrangement direction. Referring to fig. 5A, fig. 5A is a schematic diagram of a word cloud provided in an embodiment of the present application; the word cloud is an area composed of a plurality of keywords and candidate words, the keywords 501A (the keywords 501A refer to at least one keyword, are only schematic in fig. 5A, and do not limit the number of the keywords) are located at a central position, namely, the end points of the arrangement direction, the plurality of candidate words 505A are arranged around the center of the keywords 501A, different types of candidate words 505A correspond to different classification sectors 503A, each classification sector 503A comprises a classification center line 504A, and the different classification sectors 503A are separated by a classification boundary 502A. The alignment direction is the pointing direction of the arrow corresponding to the classification centerline 504A. The two boundary lines of the classification sector 503A are rays whose maximum angle corresponds to the minimum angle, respectively.

For example, at least one type of candidate word is distributed in each arrangement direction, including: when the number N of the plurality of types is less than or equal to the type number threshold value N, N types of candidate words are distributed in a one-to-one correspondence manner in N arrangement directions; when the number N of the plurality of types is greater than the type number threshold N, N-1 type candidate words are distributed in one-to-one correspondence in the first N-1 arrangement directions, and N-N+1 type candidate words are distributed in the nth arrangement direction.

By way of example, for example: assuming that the number N of types is 4 and the threshold N of types is 4, candidate words corresponding to the 4 types of distribution are distributed one by one in four arrangement directions (for example, up, down, left and right) taking the keyword as an end point, and rays (classification center lines) corresponding to the four arrangement directions respectively divide 360 degrees into four 90-degree areas with the keyword as the center. Assuming that the number n is 6, and 6 is greater than the type number threshold 4, candidate words corresponding to 1 st to 3 rd types are distributed in the corresponding 1 st to 3 rd arrangement directions of the 1 st to 3 rd types, and candidate words of the 4 th, 5 th and 6 th types are distributed in the fourth arrangement direction.

In some embodiments, the candidate words, keywords may be irregularly, randomly distributed in the second control, for example: ordering according to the sequence of the pinyin initial consonants of the first character and ordering according to the stroke quantity.

In some embodiments, the shape of the area for displaying the keywords in the second control may be rectangular, circular or fan-shaped, elliptical or elliptical fan-shaped, etc., and the area for displaying the keywords in the second control can be arranged in different directions based on one center in terms of geometric characteristics. Referring to fig. 5C, fig. 5C is a schematic diagram of a search page provided in an embodiment of the present application; the second control 502C in the search page 404A is oval, and the candidate words 505C are arranged in different arrangement directions 503C centering on the keyword 501C (the keyword 501C refers to at least one keyword, and is only illustrative in fig. 5A, and does not limit the number of keywords).

In some embodiments, if the region is a sector or an elliptical sector, the keyword is at a central angular position of the sector, and the candidate word is arranged in an arc in the sector starting from the keyword to the sector. If the region is a rectangle, a circle center and the like, the keyword is positioned at the center of the rectangle or the circle, and candidate words are arranged around by taking the keyword as a starting point.

In some embodiments, in the second control, the values of the following two parameters of each type of candidate word are positively correlated: distance between the candidate word and the at least one keyword, and relevance of the candidate word to the at least one keyword.

By way of example, the features of at least one keyword should be as a whole, such as: using the mean of the vector representations to represent; correlation, i.e., the reciprocal of the distance (e.g., euclidean, cosine distance) that the vector represents. For example: the method comprises the steps of obtaining a first word vector corresponding to at least one keyword and a second word vector of each candidate word, calculating cosine distance between each second word vector and the first word vector, representing correlation degree between the candidate word and the keyword by the cosine distance, wherein the candidate word with the shortest cosine distance is distributed at the position closest to the keyword, and the cosine distance between the candidate word and the keyword is larger as the distance from the candidate word is farther.

In some embodiments, the distance between the candidate word and the at least one keyword is positively correlated with a parameter of at least one of the following candidate words: 1. searching frequency; for example: the higher the frequency, the closer to the keyword; 2. the order of the first characters (pinyin/letters); for example: the closer the letters corresponding to the initials are to the keywords the earlier they are in the alphabetical order. Or, the smaller the number corresponding to the initial, the nearest to the keyword.

In some embodiments, at least one of the following display modes is applied to distinguish between different types of candidate words:

Mode 1, applying different display parameters to different types of candidate words; for example: different display modes (colors, font sizes and fonts) are applied to words belonging to different types at boundaries in different directions, for example, the boundary between the type 1 word and the type 2 word is displayed in blue, and the type 2 word is displayed in green; different types of words apply different display modes as a whole. Referring to fig. 5D, fig. 5D is a schematic diagram of a second control provided in an embodiment of the present application; the second control 502D includes a plurality of different candidate words 505D surrounding the keyword 501D (the keyword 501D refers to at least one keyword, and is shown in fig. 5D only as an illustration, and not limiting on the number of keywords), and each type of candidate word displays a different color or pattern.

Mode 2, a boundary line between any two adjacent arrangement directions is displayed. With continued reference to fig. 5D, each type of candidate word corresponds to a different region, and there is a dividing line 503D between each region.

In some embodiments, in a display area (the shape of the display area includes a rectangle, a circle, a sector, an ellipse, an oval sector, a triangle) formed around at least one keyword of the second control, an arrangement direction of each type satisfies one of the following conditions:

The span of the angle interval corresponding to each type of arrangement direction is the same in condition 1, and the span is the ratio of the following two parameters: the span of the angular interval of the display area, the number of candidate word types associated with the at least one keyword. I.e. the weights of the types are the same.

By way of example, for example: the display area is a round angle interval corresponding to 360 degrees, and the display area comprises 4 types of candidate words, so that the span of the angle interval corresponding to the arrangement direction of each type is 90 degrees, and the ratio of 360 degrees to the number 4 of the types of the candidate words is set.

The span of the angle interval corresponding to the arrangement direction of each type is the product of the following two parameters: the span of the angular interval of the region is displayed, and the number of candidate words of a type is the duty ratio of all types. That is, the weight of a type is positively correlated with the number of candidate words that the type includes.

For example, assume that there are three types, type 1, type 2, type 3, and the like, and the ratio of each type of candidate word to all candidate words is: type 1, 50% duty cycle, type 2, 25% duty cycle, type 3, 25% duty cycle. The span of the angle section of the display area is 180 degrees, the span of the angle section corresponding to the arrangement direction of type 1 is 90 degrees, the span of the angle section corresponding to the arrangement direction of type 2 is 45 degrees, and the span of the angle section corresponding to the arrangement direction of type 3 is 45 degrees.

In some embodiments, referring to fig. 3C, fig. 3C is a schematic flow chart of a search processing method provided in an embodiment of the present application; in executing step 3022B, the displayed candidate words may also be deleted by the following steps 3023B to 3025B, which will be described in detail below.

In step 3023B, a delete button is displayed in each arrangement direction.

Referring to fig. 5E, fig. 5E is a schematic diagram of a second control provided by an embodiment of the present application; a deletion control 501E is displayed in the ordering direction of the candidate words corresponding to each type in the second control 502D.

In step 3024B, in response to a trigger operation for a first button in a first arrangement direction, one of the following processing is performed for a candidate word of a first type corresponding to the first arrangement direction: the candidate word of the first type is replaced with a candidate word of the second type.

For example, the second type is distinguished from the plurality of types, i.e., the second type's relevance to the keyword, next to the plurality of types' relevance to the keyword. For example: a delete button may be provided at a location near the center or edge of each alignment direction (referring to fig. 5E, the edge of delete control 501E in second control 502D), and if triggered, the alignment direction is deleted instead of displaying other types (not previously shown), so that more words of other types may be displayed; if there are other types not shown, then other types are substituted.

Assume that: referring to fig. 5E, 7 types of candidate words corresponding to the keyword are calculated based on the knowledge graph, 6 types of words may be displayed, 7 types of words are hidden, and a span of an angle interval of an arrangement direction corresponding to each type is 60 degrees. When a word of one type is deleted, then the 7 th word type is displayed.

In step 3025B, displaying the first type of candidate word is stopped and the angle interval of the other arrangement direction is updated to cover the first arrangement direction.

The other alignment direction is, for example, an alignment direction other than the first alignment direction among the plurality of alignment directions. For example: a delete button may be provided for each alignment direction near the center/edge, and if triggered, the alignment direction is deleted, reassigning the alignment direction for the remaining type (angle interval becomes larger).

Assume that: based on the map, 6 types are calculated, and 6 types of words can be displayed, and the span of the angle section of the arrangement direction corresponding to each type is 60 degrees. When one type of word is deleted, the remaining 5 types of words, each corresponding to the type of word, have an angular interval of 72 degrees in the arrangement direction.

In some embodiments, referring to fig. 3D, fig. 3D is a schematic flow chart of a search processing method provided in an embodiment of the present application; in executing step 3022B, the candidate words may also be updated by the following steps 3026B to 3027B, which will be described in detail below.

In step 3026B, content distributed in a first arrangement direction is moved along the first arrangement direction in response to a browsing operation along the first arrangement direction in the second control.

The first arrangement direction may be any arrangement direction, for example. The content distributed in the first arrangement direction may be at least one keyword and a plurality of candidate words, the at least one keyword gradually disappearing as moving along the first arrangement direction.

Referring to fig. 4B, fig. 4B is a schematic diagram of a word cloud provided in an embodiment of the present application; assuming that the keyword 402B and the candidate word 403B may constitute one word cloud 401B, and that a portion of the word cloud 401B based on the keyword 402B is displayed in the second control 402A, in response to a sliding operation (browsing operation) for the user with respect to the second control, the candidate word 403B of the other portion is displayed.

In step 3027B, new candidate words of a first type are displayed in a free area formed by moving out at least part of the content in a first arrangement direction.

For example, the distance moved is positively correlated with the magnitude of the browsing operation, the first arrangement direction is the arrangement direction corresponding to the browsing operation, and the first type is the type corresponding to the first arrangement direction.

By way of example, the morphology of the browse operation is as follows: sliding and dragging; the number of directional controls for receiving a browse operation may be an integer multiple of 4, for example: controls in four directions, namely up, down, left and right. The controls in the upper, lower, left and right directions are further evenly divided.

In some embodiments, referring to fig. 3G, fig. 3G is a flow chart of a search processing method provided in an embodiment of the present application; new candidate words of the first type are determined by the following steps 3041G to 3044G, which will be described in detail below.

In step 3041G, according to the edge keyword and at least one keyword, a word graph is queried, and all nodes of the next stage corresponding to the edge keyword and the at least one keyword are searched from the word graph.

For example, the edge keyword is a candidate word located at an edge of the first arrangement direction before responding to the browsing operation; the word patterns are knowledge patterns, each node in the knowledge patterns corresponds to an entity word, and edges between each node are used for representing association relations among the nodes. The next level node, i.e., the node having only one edge with the current node.

In step 3042G, the co-occurrence number of all nodes at the next stage of the edge keyword and at least one keyword is determined, and the nodes are sorted in descending order according to the co-occurrence number, so as to obtain a descending order sorting result.

Illustratively, co-occurrence, i.e., co-occurrence, refers to the number of repeated occurrences. For example: currently, there are a keyword A, a keyword B and a keyword C, wherein the keyword A is an edge keyword. 13 nodes of the next stage corresponding to the keyword A, 15 nodes of the next stage corresponding to the keyword B and 10 nodes of the next stage corresponding to the keyword C. The total number of the nodes is 38, wherein node 1 appears 3 times, and the co-occurrence number of node 1 is 3 times. And similarly, acquiring the co-occurrence times of each node, and sorting each node in a descending order based on the co-occurrence times to obtain a sorting result.

In step 3043G, among the plurality of nodes of the header in the descending order of the ranking result, nodes having opposite senses to the edge keyword and the at least one keyword are deleted, and the first type of candidate word that has been displayed is deleted.

For example, among the plurality of nodes in the head of the descending order of the ranking result, the semantics of the candidate word of each node are analyzed, the node whose semantics are opposite to the keywords is determined, and the corresponding node is deleted. And comparing the candidate words corresponding to each node with the displayed candidate words, and if the comparison results are the same, displaying the candidate words corresponding to the nodes and deleting the nodes.

For example, assuming that the candidate word corresponding to the node is already displayed in the second control, deleting the node; the node is also deleted assuming that the candidate word corresponding to the node is of opposite sense to the edge keyword and the at least one keyword. For example: the keywords are "do not want to exercise", "fast lose weight", and the nodes of the exercise-related losing weight fields such as "body building", "prasuti" are obtained based on the knowledge graph of the keyword "fast lose weight" in the losing weight field, but the nodes corresponding to the "body building", "prasuti" waiting optional words are deleted when the semantics of the keyword "do not want to exercise" are opposite.

In step 3044G, the word represented by the remaining at least one node is taken as a new candidate word of the first type.

In some embodiments, if there are no remaining nodes after executing step 3043G, the next node of the candidate word in the word graph may be queried based on the candidate word at the edge position, the co-occurrence times are counted and ranked, and the anti-ambiguous word of the keyword and the word that has been displayed in the sliding arrangement direction before are filtered to obtain a new candidate word.

In some embodiments, if the browsing operation is not the first received browsing operation, and after step 302, in response to the browsing operation crossing from the first arrangement direction to the second arrangement direction in the second control, a candidate word of a type corresponding to the second arrangement direction is displayed in an area between the current browsing position and the at least one keyword.

By way of example, for example: when the user performs a plurality of sliding operations longitudinally, after the terminal device updates the first display longitudinally, if the terminal device moves transversely, if a plurality of gaps appear between the currently browsed position and the keywords, a plurality of candidate words are displayed layer by layer from near to far in the gaps. Referring to fig. 5B, fig. 5B is a schematic diagram of a second control provided in an embodiment of the present application; wherein the second control 502B with a solid line indicates an initial position of the second control 502B in the word cloud, and the arrow indicates a direction in which each browsing operation (browsing operation 503B, browsing operation 504B, browsing operation 505B) moves, that is, the browsing operation is performed twice for the first direction 507B (corresponding to the first arrangement direction), and then the browsing operation is performed once for the lateral direction, so that the area 506B spans to the second direction 508B (corresponding to the second arrangement direction), and the area is located between an original position of the second control 502B and a position corresponding to the second control 502B after the three browsing operations. Corresponding candidate words are padded layer by layer in region 506B from near to far from keyword 501B. The region 506B is a region between the current browsing position (browsing position corresponding to the browsing operation 505B) and at least one keyword.

In some embodiments, referring to fig. 3E, fig. 3E is a schematic flow chart of a search processing method provided in an embodiment of the present application; step 3022A may be implemented by the following steps 3021E to 3022E, which are specifically described below.

In step 3021E, at least one keyword is displayed in a second control.

For example, the execution of step 3021E may refer to 3021B above, and will not be described in detail herein.

In step 3022E, candidate words belonging to a plurality of types are displayed in a plurality of queues, respectively.

The plurality of queues are illustratively in the form of a plurality of rows or columns, at least one type of candidate word is distributed in each queue, and different types of candidate words are associated with at least one keyword. For example: the plurality of candidate words are displayed in a form of a table, each row or each column corresponds to a type, and the keywords can be displayed in the head or center row or column of the table. Referring to fig. 5F, fig. 5F is a schematic diagram of a search page provided in an embodiment of the present application; the second control 502F in the search page 404A is presented in tabular form, and the second control 502F is presented in thumbnail form in FIG. 5F. Referring to fig. 5G, fig. 5G is a schematic diagram of a search page provided in an embodiment of the present application; FIG. 5G is a partial enlarged view of a second control 502F, with each column in the table corresponding to a type of candidate word, and each type having a corresponding delete control 503F, and controls for moving content in each column up and down, up control 504F, and down control 505F, respectively. The keywords 501F (the keywords 501F refer to at least one keyword, which is only schematic in fig. 5A, and does not limit the number of keywords) correspond to three types, type 1 (including the candidate words 511, 512, 513, … …); type 2 (including candidate word 521, candidate word 522, candidate word 523 … …); type 3 (including candidate word 531, candidate word 532, candidate word 533, … …). Referring to fig. 5I, fig. 5I is a schematic diagram of a search page provided in an embodiment of the present application. The keyword 501F is displayed in the middle row of the table, centered on the second control 502F.

By way of example, at least one type of candidate word is distributed in each queue, which may be implemented by: when the number N of the types is smaller than or equal to the type number threshold value N, N types of candidate words are distributed in the N queues in a one-to-one correspondence manner; when the number N of the types is larger than the threshold N of the number of the types, N-1 type candidate words are distributed in the first N-1 queues in a one-to-one correspondence mode, and N-N+1 type candidate words are distributed in the nth queue.

By way of example, for example: the type number threshold N is 3, and the number of types is 3, and then 3 types of candidate words are distributed in the 3 queues in a one-to-one correspondence manner. For another example: referring to fig. 5H, fig. 5H is a schematic diagram of a second control provided in the embodiment of the present application, where the number of types is 4 (including type 1, type 2, type 3 and type 4), and is greater than a type number threshold, then 2 types of candidate words are distributed in the first 2 queues in a one-to-one correspondence manner, and 3 rd and 4 rd types of candidate words are distributed in the 3 rd queue. In the third queue, candidate words 531, 541, 532 corresponding to type 3 and type 4 are arranged in a staggered manner.

In some embodiments, referring to fig. 3F, fig. 3F is a flow chart of a search processing method provided in an embodiment of the present application; in the process of implementing step 3022A based on steps 3021E to 3022E, candidate words may also be updated by the following steps 3023E to 3024E, which will be described in detail below.

In step 3023E, in response to a browse operation along a target direction in a target queue of a second control, content in the target queue is moved along the target direction.

For example, the content in the target queue may be at least one keyword and a plurality of candidate words, the at least one keyword fading as it moves along the target direction. The target direction is a direction corresponding to the browsing operation, for example: the target direction may be a downward direction corresponding to the down control 505F in fig. 5F, where the candidate words in the corresponding queue sequentially move upward, new candidate words appear from below, and displayed candidate words are hidden from above.

In step 3024E, new candidate words for the target type are displayed in the free area formed by the removal of at least a portion of the content from the target queue.

By way of example, the distance moved is positively correlated with the magnitude of the browsing operation, and the target type is the type to which the target queue corresponds. The target arrangement direction is an arrangement direction corresponding to the browsing operation. The form of the browsing operation includes: sliding; press the up-check and down-check controls in the column.

In some embodiments, referring to fig. 3H, fig. 3H is a flow chart of a search processing method provided in an embodiment of the present application; in executing step 3022E, the displayed candidate words may also be deleted by the following steps 3026E to 3028E, which will be described in detail below.

In step 3026E, a delete button is displayed on each queue E.

With continued reference to FIG. 5F, a delete control 503F is displayed above each queue. Delete control 503F is used to delete the corresponding queue.

In step 3027E, in response to a trigger operation for a first button on a first queue, one of the following processes is performed for a candidate word of a first type corresponding to the first queue: the candidate word of the first type is replaced with a candidate word of the second type.

For example, the second type is distinguished from the plurality of types, and the second type is related to the keyword next to the plurality of types. For example: there are 4 types of candidate words, 3 being currently displayed, and in response to a trigger operation for the delete control 503F corresponding to type 3, the queue of candidate words corresponding to type 3 is hidden, and the queue of candidate words corresponding to type 4 is displayed.

In step 3028E, displaying the first type of candidate word is stopped and the size of the other queue is increased to cover the first queue.

Illustratively, increasing the size of the other queues includes increasing the width or height of the queues. The other queues are queues other than the first queue. For example: the candidate words have 3 types, 3 types are displayed at present, the queue of the candidate words corresponding to the type 3 is hidden in response to the triggering operation of the deletion control 503F corresponding to the type 3, and the widths of the remaining queues of the type 1 and the type 2 are adjusted to cover the position of the hidden queue corresponding to the type 3.

In some embodiments, when step 302 is performed, a search intent is displayed in the second control, wherein the search intent characterizes the intent to search by entering query information.

By way of example, obtaining a search intent based on query information may be accomplished by:

mode 1, dictionary-based rule method: different domain dictionaries, such as commodity names, place names, etc., that different search intents will have. Based on the descending order of the similarity between the query information and different domain dictionaries, the domain corresponding to the domain dictionary with the descending order ordering head is obtained, and the information corresponding to the domain is displayed as the search intention.

Mode 2, acquiring search records corresponding to a search engine based on query information, counting the information with highest search frequency in the information related to the query information based on the search records, and taking the information with highest search frequency as a search intention.

And 3, calling a convolutional neural network model to predict based on the query information, and obtaining the search intention.

In some embodiments, referring to fig. 3J, fig. 3J is a flow chart of a search processing method provided in an embodiment of the present application; a plurality of types of candidate words are determined by the following steps 3041J to 3044J, which will be described in detail below.

In step 3041J, at least one keyword is extracted from the query information.

The way of extracting the keywords from the query information in step 302 is described above, and will not be described here.

In step 3042J, when the number of at least one keyword is plural, all nodes of the next stage of each keyword are searched from the word graph.

For example, the word graph includes a keyword knowledge graph, and the node at the next stage of the keyword is a node with only one edge between the nodes corresponding to the keyword in the knowledge graph. And acquiring each next-level node corresponding to each keyword.

In step 3043J, the co-occurrence number of all nodes of the next stage of the plurality of keywords is determined, and the nodes are sorted in descending order according to the co-occurrence number, so as to obtain a descending order sorting result.

For example, the statistics of the co-occurrence number and the descending order of the step 3043J are the same as those of the step 3042G, and will not be repeated here.

In step 3044J, among the plurality of nodes in the head of the descending order of the result, the node having the opposite sense to any one of the key words is deleted, and the word represented by the remaining plurality of nodes is used as a candidate word of a plurality of types.

The manner of deleting the node opposite to any keyword has been described in step 3043G, and will not be described here.

In some embodiments, referring to fig. 3K, fig. 3K is a schematic flow chart of a search processing method provided in an embodiment of the present application; a plurality of types of candidate words are determined by the following steps 3041K to 3043K, which will be described in detail below.

In step 3041K, at least one keyword is extracted from the query information.

The execution of step 3041K is the same as that of step 3041J, and will not be repeated here.

In step 3042K, when the number of at least one keyword is one, all nodes of the next level of the keyword are searched from the word graph.

The manner of acquiring all nodes of the next stage in step 3042K is the same as that in step 3042J, and will not be described here again.

In step 3043K, nodes having opposite senses to any one of the keywords are deleted from all the nodes at the next stage of the keywords, and words represented by the remaining plurality of nodes are used as candidate words of a plurality of types.

According to the method and the device for obtaining the search results, the candidate words are screened, so that the candidate words which are not matched with the intention of the user are prevented from being displayed, and the efficiency and the accuracy of obtaining the search results are improved.

With continued reference to fig. 3A, in step 303, in response to the selection operation, search results corresponding to at least one prompt word selected by the selection operation are displayed.

For example, at least one prompt word of the selected state is taken as a search word. When the hint word includes at least one keyword and a plurality of candidate words, the search word is at least one of the keyword and the plurality of candidate words in a selected state. The location at which the search results are displayed may be in the second control. Alternatively, a third control dedicated to displaying search results, with continued reference to FIG. 4A, third control 403A is used to display search results.

According to the method and the device for selecting the search words, the plurality of key words and the candidate words related to the key words are determined and displayed based on the query information, and the key words and the candidate words are used for selection by the user, so that the selection of the search words is more flexible, and when the user does not know about the related field of the query information, the user can flexibly select the search words by providing the key words and the candidate words related to the query information to the user, and the accuracy of searching is further improved.

In some embodiments, at least one keyword is in a selected state by default, a plurality of candidate words are in an unselected state by default, and each selection operation is used for triggering and displaying a corresponding search result; step 303 may be implemented by: and responding to the selection operation of the at least one first target word, displaying that the at least one first target word is in a selected state, wherein the at least one first target word is at least one candidate word selected by the selection operation in the plurality of candidate words, and displaying the at least one keyword and the search result corresponding to the at least one first target word.

For example, in response to each selection operation in the second control, search results for the currently selected search term are automatically displayed in the third control.

By way of example, referring to fig. 4C and 4E, fig. 4C and 4E are schematic diagrams of search pages provided in embodiments of the present application; the candidate word "what is good" in fig. 4C is displayed in an unselected state, the candidate word "what is good" in fig. 4E is selected as the first target word, and as the keyword 401E, the candidate word in the second control 402E in fig. 4E is correspondingly updated as the candidate word "what is good", "does not want to exercise", and "fast weight-reducing". Meanwhile, "what is good to eat", "do not want to exercise", and "fast weight loss" are used as search words, and corresponding search results are displayed.

In some embodiments, the at least one keyword and the plurality of candidate words are in an unselected state by default; step 303 may be implemented by: in response to a selection operation for at least one third target word, displaying the at least one third target word in a selected state, wherein the at least one third target word is at least one of the plurality of candidate words and the at least one keyword selected by the selection operation. The search results corresponding to at least one search term (which includes the first target term) are displayed (in response to a trigger operation for the search button in the first control, the latter display may be performed by default, i.e., automatically).

By way of example, receiving a selection operation for a search term in the second control does not automatically display the search results, and only after the search button is triggered does the search results be displayed.

In some embodiments, referring to fig. 3I, fig. 3I is a flow chart of a search processing method provided in an embodiment of the present application; after step 303, the following steps 3051 to 3052 are performed, and the following description is given.

In step 3051, in response to a cancel operation for the at least one second target word, the at least one second target word is displayed in an unselected state.

For example, the at least one second target word is at least one of the at least one keyword and the at least one first target word that is cancelled by the cancellation operation. The unselected state may also be characterized by hiding the second target word, i.e., the second target word is no longer displayed.

For example, referring to fig. 4E, it is assumed that at least one of the selected words "do not want to exercise", "fast lose weight", "eat good" is selected by a cancel operation, and the word cancelled by the cancel operation is a second target word.

With continued reference to FIG. 3I, in step 3052, updated search results are displayed.

For example, the updated search results correspond to at least one keyword and at least one first target word in addition to at least one second target word. For example: the selected words are key 1, candidate word 2 and candidate word 3; and taking the candidate word 3 as a second target word, canceling the candidate word 3 by canceling operation, and taking the candidate word 2 and the keyword 1 as search words, so that updated search results are displayed based on the candidate word 2 and the keyword 1. For another example: the "what is good to eat" in fig. 4E is deselected, and the content displayed in the second control 402E in fig. 4E is restored to the keywords and candidate words displayed in the second control 402C in fig. 4C.

In some embodiments, step 3052 is implemented by: and responding to the triggering operation of the search button in the first control, and displaying the search result corresponding to at least one prompt word selected by the selection operation. That is, referring to FIG. 4A, by triggering search button 409A in first control 401A, search results corresponding to at least one hint word are displayed in third control 403A.

In some embodiments, search results corresponding to the at least one keyword and the plurality of candidate words are displayed in a third control prior to responding to a selection operation in the second control. After a subsequent receive selection operation, the previous search results are refreshed to search results corresponding to the search term. That is, when the user inputs the query information, the keyword and the candidate word corresponding to the query information are displayed in the second control, and the search results corresponding to the keyword and the candidate word are synchronously displayed in the third control until the selection operation is received, the previous search results are refreshed to the search results corresponding to the search word.

According to the method and the device for searching the keyword, the corresponding search results are displayed along with the change of the keyword and the candidate word, so that the real-time performance of searching is improved, a user can conveniently determine required search content, the searching efficiency is improved, and operation steps required for searching are saved. Based on the query information input in the first control, corresponding keywords and candidate words are displayed, and different keywords and candidate words are provided as alternative items based on the query information, so that a user can flexibly select one or more search words according to search intention, and search results obtained by the search words can accord with the search intention, the user can search required information conveniently, operation steps of the user in the process of searching information are saved, and search efficiency and accuracy of the search results are improved.

In the following, an exemplary application of the embodiments of the present application in a practical application scenario will be described.

When a user queries information in an unfamiliar field, query information is input in a search engine control (the first control above) of a search page in a terminal device due to unfamiliar nouns related to the field, and keywords related to the query information and candidate words related to the keywords are displayed in an intelligent map (the second control above) based on the query information. The user can select words close to the query intention of the user from the candidate words and the keywords as search words. And responding to the selection operation of any word in the second control, taking the selected word as a search word, and displaying a search result corresponding to the search word.

Referring to fig. 6, fig. 6 is a flowchart of a search processing method provided in the embodiment of the present application, and the following description will be made with reference to the steps shown in fig. 6, with the terminal device 400 in fig. 1 as an execution body.

In step 601A, in response to an input operation of query information, keywords corresponding to the query information and candidate words related to the keywords are displayed in the smart map.

For example, when a user performs a search, query information input by the user is split into a plurality of keywords, a batch of candidate words are calculated according to the keywords, and the candidate words are displayed in a word cloud centering on the keywords. Acquiring keywords based on query information may be achieved by: the query information is split into a plurality of independent words by using a natural language processing technology, unnecessary adverbs and nonsensical parts in the words are abandoned, and the rest words are used as key words.

For example, candidate words related to the keyword may be obtained based on the keyword, and the obtaining of the candidate words may be achieved by: determining corresponding primary nodes of each keyword in the knowledge graph, counting the co-occurrence primary nodes after obtaining the primary nodes respectively associated with each keyword, sorting according to the descending order of the times of occurrence of the nodes, and taking the nodes at the head in the descending order sorting as the nodes. For example: assuming that the node diet appears in the keywords of weight losing and no exercise at the same time, the node diet has higher priority and is ranked earlier.

For example, the direction of the candidate word relative to the word cloud center (whether in the same classification sector or at the junction of the two classifications), and the distance of the candidate word relative to the word cloud center (calculated in terms of layers, circles). The candidate words are scored according to their priority (the priority score may be determined according to the association between the candidate words and the keywords, i.e. the higher the association between the candidate words and the keywords, the higher the score, the closer to the keywords, e.g. placed in the inner circle), and arranged in order from near to far. Referring to fig. 5A, fig. 5A is a schematic diagram of a word cloud provided in an embodiment of the present application; the keyword 501A is located in the middle of the word cloud, and a plurality of candidate words 505A are arranged in a way that the center of the keyword 501A is outwards diffused, different types of candidate words 505A correspond to different classification sectors 503A, each classification sector 503A comprises a classification center line 504A, and different classification sectors 503A are separated by a classification boundary 502A. The distances between the plurality of candidate words 505A and the keyword 501A are positively correlated with the score corresponding to each candidate word 505A, i.e., the higher the degree of correlation with the keyword 501A, the closer the candidate word 505A is to the keyword 501A in the word cloud.

Referring to fig. 4A, fig. 4A is a schematic diagram of a search page provided in an embodiment of the present application; search page 404A includes a first control 401A, a second control 402A, and a third control 403A. In the first control 401A, in response to an input operation by the user with respect to the first control 401A, the query information 407A "how fast weight loss does not want to move" is displayed. Query information (query) is disassembled through semantic analysis, so that keywords of 'quick weight loss' and 'unwanted movement' are obtained. The keyword 405A is displayed in the second control 402A (i.e., the smartmap) and is highlighted to indicate that it has been automatically selected, and is switched to the unselected state when the keyword is clicked. Based on the keyword, a plurality of candidate words related to the keyword may be obtained, and the candidate word 406A is also displayed in the second control 402A.

In step 602A, a browse operation for a word in a smart map is received.

By way of example, referring to fig. 4B, fig. 4B is a schematic diagram of a word cloud provided by an embodiment of the present application; the candidate words 403B and the keyword 402B are used as recommended words, a word cloud 401B is formed based on the recommended words, and the recommended words (the keyword and the candidate words) have association relations with each other, wherein the closer the center of the recommended word in the word cloud is, the more dispersed and deeper the more the recommended word is, the more the recommended word is more closely related to query information. Divergent from the word cloud center to different directions, the types of keywords (recommended words) representing recommendation are different, after the user sees the recommended word of interest in different directions, the user always continues to browse along the directions, which means that he has a requirement for deep exploration of the recommended type, and after browsing the edges of the directions, the position of the second control 402A in the word cloud 401B can be switched through sliding operation so as to view more recommended words. The browsing operation may be a sliding, dragging, or the like operation.

In step 603A, the display candidate word is updated based on the direction to which the browsing operation corresponds.

For example, the user may slide through the word cloud. When the user performs a sliding operation in the second control along one direction, more and deeper recommended contents in the direction are presented to the user, and when the user slides to the edge of the word cloud, the word cloud expands the contents in the direction, all the contents are products related according to the existing recommended words in the current direction, the real-time calculation results are obtained, and green recommended words in the figure represent new words recommended in real time. It is conceivable that the user may be interested in a certain direction and explored further in this direction while browsing at any location, thereby continually triggering new recommended words given by real-time calculation, all recommended contents being based on the current interests of the user.

Referring to fig. 4C, fig. 4C is a schematic diagram of a search page provided in an embodiment of the present application; compared to the second control 401A in fig. 4A, the content in the second control 402C moves to the right, referring to fig. 4D, fig. 4D is a schematic diagram of a word cloud provided in an embodiment of the present application; in the word cloud 401B, in response to a browsing operation (sliding operation) with respect to the second control 402C, the second control 402C moves leftward compared to the second control 402A, and thus the content therein moves rightward, a new candidate word 401D in the word cloud 401B is presented to the user.

When a user slides to the edge of a word cloud, recommending a batch of new words to the blank positions around the current position, filling the blank with core keywords in a near-to-far order, searching the next level node in the word map again by using the candidate words of the keywords and the edge positions, counting the co-occurrence times and sequencing, filtering out the anti-ambiguous words of the keywords and the words displayed in the sliding arrangement direction before, wherein the occupied positions do not fill other words, and the newly recommended words are not repeated with other recommended words in the word cloud.

In some embodiments, the user performs a plurality of sliding operations in the depth direction, and if a lateral sliding operation is performed, gaps between new locations and the word cloud center are filled layer by layer from near to far.

Referring to fig. 5B, fig. 5B is a schematic diagram of a second control provided in an embodiment of the present application; where the second control 502B with a solid line indicates an initial position of the second control 502B in the word cloud, and the arrow indicates a direction in which each browsing operation (browsing operation 503B, browsing operation 504B, browsing operation 505B) moves, that is, two browsing operations are performed first for the same direction, and then one browsing operation is performed for the lateral direction, and the area 506B is an area between the initial position of the second control 502B and a position corresponding to the second control 502B after three browsing operations. Corresponding candidate words are padded layer by layer in region 506B from near to far from keyword 501B.

When step 603A is performed, step 604A or step 605A may be performed. The execution of step 604A or step 605A is not sequential.

In step 604A, in response to a selection operation for any one of the candidate words, the selected candidate word is taken as a new keyword.

For example, the user may select a certain candidate word as a new keyword in the browsing process, then the new keyword may be aggregated with the existing keyword, the new candidate word is obtained based on the aggregation result, and the new candidate word is displayed in the second control. Referring to fig. 4E, fig. 4E is a schematic diagram of a search page provided in an embodiment of the present application; in comparison to fig. 4C, the original candidate word "what is good" is in the selected state, and the new candidate word corresponding to the new keyword 401E in the second control 402E.

In the embodiment of the application, the keyword can represent the search intention of the user, the candidate word can be updated according to the new keyword selected by the user, more relevant information is recommended to the user, and the user can flexibly select the search word to acquire the search result which meets the requirements.

In step 605A, keywords are hidden in response to a delete operation for any one of the keywords.

For example, if the user is not satisfied with the keywords during browsing, the keywords may be deleted, the deleted keywords may be hidden, and at the same time, the candidate words corresponding to the deleted keywords may be hidden correspondingly, and the displayed candidate words may be updated based on the deleted keywords.

In step 606A, candidate words associated with the updated keyword are displayed based on the updated keyword.

By way of example, referring to fig. 4F, fig. 4F is a schematic diagram of a word cloud provided by an embodiment of the present application; the second control 402C in fig. 4F includes three keywords, where one keyword is a new keyword, and updates the candidate words in the word cloud 401B based on the three keywords, so as to obtain a plurality of new candidate words 401F. With continued reference to FIG. 4E, the candidate words in the second control 402E in FIG. 4E are updated as the keywords are updated, unlike in FIG. 4C.

In some embodiments, in the process of executing step 606A, if the user is not satisfied with the currently displayed keyword or candidate word, the user may browse at any time to obtain other candidate words or keywords, and the terminal device executes steps 602A to 606A again to obtain the word more in line with the user's requirement.

In step 607A, search results are displayed in response to a trigger operation for any one word.

Illustratively, and with reference to FIG. 4A or FIG. 4C, FIG. 4E, search results are displayed in a third control 401A. The search may be triggered to display the search results after the final search term is determined. If the user is satisfied with the current search term, browsing the content of the result page is started; if the user is not satisfied, the search term may be reselected, including deselecting a portion of the keywords, browsing, and adding new keywords. This process does not require any modification or deletion operations at the input box by the user. Alternatively, the search results corresponding to the keywords may be displayed with the keywords as search words by default between determining the search words.

In some embodiments, if the user is not satisfied with the search result, the user may browse the recommended keywords and the candidate words in the second control again, select other search words to search, and the terminal device executes steps 602A to 607A again to obtain the search result more in line with the user requirement.

By the search processing method provided by the embodiment of the application, a user does not need to think in terms of a large number of expressions for describing the search intention of the user, and by browsing the recommended word cloud, the user can quickly find a large number of related keywords and candidate words, wherein the keywords can comprise associations of a plurality of directions related to initial input and can be continuously strengthened or re-dispersed in the direction of interest of the user. The user can also quickly select a search term based on the keyword and the candidate term, without modification or deletion through a search box and keyboard, but through simple browsing and clicking. Through innovation of the interaction process, the efficiency of expressing objective and correct search words by users is greatly improved.

According to the embodiment of the application, real-time understanding and real-time recommendation are performed based on query information input by a user, and a brand-new shortcut is provided for the user to input real search intention through the interaction control. The method can save a great amount of user time, effectively reduce thinking cost and operation cost of the user in the process of searching for the real searching intention, greatly improve the efficiency of the process and improve the accuracy of the searching result.

Continuing with the description below of an exemplary architecture of the search processing device 455 implemented as a software module provided in embodiments of the present application, in some embodiments, as shown in fig. 2, the software modules stored in the search processing device 455 of the memory 450 may include: an input module 4551 for displaying query information input through an information input operation in response to the information input operation; the display module 4552 is configured to display a plurality of alert words corresponding to the query information, where each alert word is used as an option separately; and the search module 4553 is configured to respond to the selection operation, and display a search result corresponding to at least one prompt word selected by the selection operation.

In some embodiments, the display module 4552 is configured to display the alert words belonging to the plurality of types in a plurality of arrangement directions, where at least one type of alert word is distributed in each arrangement direction.

In some embodiments, the plurality of hint words includes: at least one keyword corresponding to the query information, and a plurality of candidate words related to the at least one keyword; the display module 4552 is configured to display at least one keyword, where the at least one keyword is extracted from the query information, or is obtained by performing semantic understanding on the query information; and displaying the candidate words belonging to the plurality of types in a plurality of arrangement directions which take at least one keyword as a starting point outwards, wherein at least one type of candidate word is distributed in each arrangement direction, and the candidate words of different types are associated with at least one keyword.

In some embodiments, the following two parameters of each type of candidate word are positively correlated: distance between the candidate word and the at least one keyword, and relevance of the candidate word to the at least one keyword.

In some embodiments, in a display area formed around at least one keyword, each type of arrangement direction satisfies one of the following conditions: the spans of the angle intervals corresponding to the arrangement directions of each type are the same, and the spans are the ratio of the following two parameters: the span of the angular interval of the display area, the number of candidate word types associated with the at least one keyword.

In some embodiments, the display module 4552 is configured to display a delete button in each arrangement direction when candidate words belonging to a plurality of types are displayed in a plurality of arrangement directions that start with at least one keyword; in response to a trigger operation for a first button in a first arrangement direction, one of the following processes is performed for a candidate word of a first type corresponding to the first arrangement direction: replacing the candidate word of the first type with a candidate word of a second type, wherein the second type is different from the plurality of types; stopping displaying the candidate words of the first type, and updating the angle intervals of other arrangement directions to cover the first arrangement direction, wherein the other arrangement directions are arrangement directions except the first arrangement direction in the plurality of arrangement directions.

In some embodiments, when candidate words belonging to a plurality of types are displayed in a plurality of arrangement directions starting from at least one keyword, respectively, the display module 4552 is configured to, in response to a browsing operation along a first arrangement direction, move content distributed in the first arrangement direction along the first arrangement direction, and move at least part of the content in the first arrangement direction to form a free area, display a new candidate word of a first type, where a distance of the movement is positively correlated with an amplitude of the browsing operation, and the first type is a type corresponding to the first arrangement direction.

In some embodiments, the display module 4552 is configured to determine a new candidate word of the first type by: searching all nodes of the next stage corresponding to the edge keywords and the at least one keyword respectively from the word graph according to the edge keywords and the at least one keyword query word graph, wherein the edge keywords are candidate words of edges positioned in the first arrangement direction before responding to browsing operation; determining the co-occurrence times of all nodes of the next stage of the edge keywords and at least one keyword, and carrying out descending order sequencing on the nodes according to the co-occurrence times to obtain a descending order sequencing result; among the plurality of nodes of the head in the descending order of the ranking result, deleting the node with the opposite sense to the edge keyword and the at least one keyword, and deleting the displayed candidate word of the first type; and taking the words represented by the rest at least one node as new candidate words of the first type.

In some embodiments, the display module 4552 is configured to display, in response to a browsing operation spanning from the first arrangement direction to the second arrangement direction in the second control, a candidate word of a type corresponding to the second arrangement direction in a region between the current browsing position and the at least one keyword after displaying the plurality of alert words corresponding to the query information if the browsing operation is not the browsing operation received for the first time.

In some embodiments, the display module 4552 is configured to, when the number N of the plurality of types is equal to or less than the type number threshold N, distribute N types of candidate words in N arrangement directions in a one-to-one correspondence manner; when the number N of the plurality of types is greater than the type number threshold N, N-1 type candidate words are distributed in one-to-one correspondence in the first N-1 arrangement directions, and N-N+1 type candidate words are distributed in the nth arrangement direction.

In some embodiments, display module 4552 is configured to display at least one of the following: applying different display parameters to the candidate words distributed in different arrangement directions; showing the boundary between any two adjacent alignment directions.

In some embodiments, the display module 4552 is configured to display the alert words belonging to the plurality of types in a plurality of queues respectively, where the plurality of queues are in the form of a plurality of rows or a plurality of columns, and at least one type of alert word is distributed in each queue.

In some embodiments, the plurality of hint words includes: at least one keyword corresponding to the query information, and a plurality of candidate words related to the at least one keyword; the display module 4552 is configured to display at least one keyword, where the at least one keyword is extracted from the query information, or is obtained by performing semantic understanding on the query information; and displaying candidate words belonging to a plurality of types in a plurality of queues respectively, wherein at least one type of candidate word is distributed in each queue, and the candidate words of different types are associated with at least one keyword.

In some embodiments, the display module 4552 is configured to, when candidate words belonging to a plurality of types are displayed in a plurality of queues, move content in a target queue along a target direction in response to a browsing operation in the target queue along the target direction, and move out of a free area formed by at least part of the content in the target queue, and display new candidate words of the target type, where the distance moved is positively correlated with the magnitude of the browsing operation, and the target type is a type corresponding to the target queue.

1 in some embodiments, when candidate words belonging to a plurality of types are displayed in a plurality of queues, respectively, a display module 4552 for displaying a delete button on each queue; in response to a trigger operation for a first button on a first queue, one of the following is performed for a candidate word of a first type corresponding to the first queue: replacing the candidate word of the first type with a candidate word of a second type, wherein the second type is different from the plurality of types; stopping displaying the candidate words of the first type, and increasing the sizes of other queues to cover the first queue, wherein the other queues are queues except the first queue.

In some embodiments, the display module 4552 is configured to, when the number N of the plurality of types is equal to or less than the type number threshold N, distribute N types of candidate words in N queues in a one-to-one correspondence manner; when the number N of the types is larger than the threshold N of the number of the types, N-1 type candidate words are distributed in the first N-1 queues in a one-to-one correspondence mode, and N-N+1 type candidate words are distributed in the nth queue.

In some embodiments, at least one keyword is in a selected state by default, a plurality of candidate words are in an unselected state by default, and each selection operation is used for triggering and displaying a corresponding search result; and the display module 4552 is configured to display, in response to a selection operation for at least one first target word, that the at least one first target word is in a selected state, and display at least one keyword and a search result corresponding to the at least one first target word, where the at least one first target word is at least one candidate word selected by the selection operation among the plurality of candidate words.

In some embodiments, after displaying the search results corresponding to the at least one keyword and the at least one first target word, a search module 4553 is configured to display the at least one second target word in an unselected state in response to a cancel operation for the at least one second target word, where the at least one second target word is at least one of the at least one keyword and the at least one first target word that was cancelled by the cancel operation; and displaying updated search results, wherein the updated search results correspond to the at least one keyword and the at least one first target word other than the at least one second target word.

In some embodiments, the plurality of alert words are for display in a second control, the at least one keyword being located in a central location of the second control.

In some embodiments, the search module 4553 is configured to, in response to a trigger operation for a search button in the first control, display a search result corresponding to at least one prompt word selected by the selection operation.

In some embodiments, the display module 4552 is configured to display a search intent when displaying a plurality of alert words corresponding to query information, wherein the search intent characterizes an intent to search by entering the query information.

In some embodiments, the display module 4552 is configured to determine a plurality of types of candidate words by: extracting at least one keyword from the query information; when the number of at least one keyword is a plurality of keywords, searching all nodes of the next stage of each keyword from the word graph; determining the co-occurrence times of all nodes of the next stage of the keywords, and ordering the nodes in a descending order according to the co-occurrence times to obtain a descending order ordering result; among the plurality of nodes in the head of the descending order sequencing result, deleting the node with the opposite sense to any one keyword, and taking the words represented by the rest plurality of nodes as candidate words of a plurality of types.

In some embodiments, the display module 4552 is configured to determine a plurality of types of candidate words by: extracting at least one keyword from the query information; when the number of at least one keyword is one, searching all nodes of the next stage of the keyword from the word graph; and deleting nodes with opposite senses to any one keyword from all nodes at the next stage of the keyword, and taking words represented by the rest nodes as candidate words of a plurality of types.

Embodiments of the present application provide a computer program product comprising a computer program or computer-executable instructions stored in a computer-readable storage medium. The processor of the computer device reads the computer-executable instructions from the computer-readable storage medium, and the processor executes the computer-executable instructions, so that the computer device executes the search processing method described in the embodiment of the present application.

The present embodiments provide a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, cause the processor to perform a search processing method provided by the embodiments of the present application, for example, a search processing method as shown in fig. 3A.

In some embodiments, the computer readable storage medium may be FRAM, ROM, PROM, EPROM, EEPROM, flash memory, magnetic surface memory, optical disk, or CD-ROM; but may be a variety of devices including one or any combination of the above memories.

In some embodiments, computer-executable instructions may be written in any form of programming language, including compiled or interpreted languages, or declarative or procedural languages, in the form of programs, software modules, scripts, or code, and they may be deployed in any form, including as stand-alone programs or as modules, components, subroutines, or other units suitable for use in a computing environment.

As an example, computer-executable instructions may, but need not, correspond to files in a file system, may be stored as part of a file that holds other programs or data, such as in one or more scripts in a hypertext markup language (HTML, hyper Text Markup Language) document, in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub-programs, or portions of code).

As an example, computer-executable instructions may be deployed to be executed on one electronic device or on multiple electronic devices located at one site or, alternatively, on multiple electronic devices distributed across multiple sites and interconnected by a communication network.

In summary, through the embodiment of the application, based on the query information input in the first control, the corresponding keywords and the candidate words are displayed, and different keywords and candidate words are provided as alternatives based on the query information, so that a user can flexibly select one or more search words according to the search intention, and the search result obtained by the search words can conform to the search intention, thereby facilitating the user to search for the required information, saving the operation steps of the user in the process of searching the information, and improving the search efficiency and the accuracy of the search result.

The foregoing is merely exemplary embodiments of the present application and is not intended to limit the scope of the present application. Any modifications, equivalent substitutions, improvements, etc. that are within the spirit and scope of the present application are intended to be included within the scope of the present application.

Claims

1. A search processing method, the method comprising:

2. The method of claim 1, wherein displaying the plurality of hint words corresponding to the query information comprises:

the method comprises the steps of displaying prompt words belonging to a plurality of types in a plurality of arrangement directions, wherein at least one prompt word of the type is distributed in each arrangement direction.

3. The method of claim 2, wherein the step of determining the position of the substrate comprises,

the plurality of hint words includes: at least one keyword corresponding to the query information, and a plurality of candidate words related to the at least one keyword;

the displaying of the prompt words belonging to a plurality of types in a plurality of arrangement directions respectively includes:

displaying at least one keyword, wherein the at least one keyword is extracted from the query information or is obtained by carrying out semantic understanding on the query information;

And displaying candidate words belonging to a plurality of types in a plurality of arrangement directions which take the at least one keyword as a starting point outwards, wherein at least one candidate word of the type is distributed in each arrangement direction, and different candidate words of the type are associated with the at least one keyword.

4. The method of claim 3, wherein the step of,

the values of the following two parameters of each candidate word of the type are positively correlated: and a distance between the candidate word and the at least one keyword, and a degree of correlation between the candidate word and the at least one keyword.

5. The method of claim 3, wherein the step of,

in a display area formed around the at least one keyword, each of the types of arrangement directions satisfies one of the following conditions:

the span of the angle interval corresponding to each type of arrangement direction is the same, and the span is the ratio of the following two parameters: and the span of the angle interval of the display area and the number of candidate word types related to the at least one keyword.

6. The method of claim 3, wherein when candidate words belonging to a plurality of types are displayed in a plurality of arrangement directions, respectively, starting from the at least one keyword, the method further comprises:

Displaying a delete button in each of the arrangement directions;

in response to a trigger operation for a first button in a first arrangement direction, one of the following processes is performed for the candidate word of a first type corresponding to the first arrangement direction:

replacing the candidate word of the first type with the candidate word of a second type, wherein the second type is different from the plurality of types;

stopping displaying the candidate words of the first type, and updating the angle intervals of other arrangement directions to cover the first arrangement direction, wherein the other arrangement directions are arrangement directions except the first arrangement direction in the plurality of arrangement directions.

7. The method of claim 3, wherein when candidate words belonging to a plurality of types are displayed in a plurality of arrangement directions, respectively, starting from the at least one keyword, the method further comprises:

moving content distributed in a first arrangement direction along the first arrangement direction in response to a browsing operation along the first arrangement direction, and

and displaying a new candidate word of a first type in a free area formed by moving out at least part of the content in the first arrangement direction, wherein the moving distance is positively correlated with the amplitude of the browsing operation, and the first type is the type corresponding to the first arrangement direction.

8. The method of claim 7, wherein the method further comprises:

determining new candidate words of the first type by:

searching all nodes of the next stage corresponding to the edge keywords and the at least one keyword respectively from a word graph according to the edge keywords and the at least one keyword query word graph, wherein the edge keywords are the candidate words positioned at the edge of the first arrangement direction before responding to the browsing operation;

determining the co-occurrence times of all nodes of the next stage of the edge keywords and the at least one keyword, and ordering the nodes in descending order according to the co-occurrence times to obtain descending order ordering results;

deleting nodes with opposite senses to the edge keywords and the at least one keyword among a plurality of nodes of the head in the descending order of the ranking result, and deleting the displayed candidate words of the first type;

and taking the words represented by the rest at least one node as new candidate words of the first type.

9. The method of claim 3, wherein if the browsing operation is not the first received browsing operation, and after displaying the plurality of alert words corresponding to the query information, the method further comprises:

And in response to a browsing operation crossing from a first arrangement direction to a second arrangement direction in the second control, displaying the candidate words of the type corresponding to the second arrangement direction in an area between a current browsing position and the at least one keyword.

10. A method according to any one of claims 3 to 9, wherein said distributing at least one candidate word of said type in each of said arrangement directions comprises:

when the number N of the types is less than or equal to a type number threshold value N, N candidate words of the types are distributed in a one-to-one correspondence manner in N arrangement directions;

when the number N of the types is larger than the type number threshold N, N-1 candidate words of the types are distributed in one-to-one correspondence in the first N-1 arrangement directions, and N-N+1 candidate words of the types are distributed in the nth arrangement direction.

11. The method according to claim 2, wherein the method further comprises:

at least one of the following display modes:

applying different display parameters to the candidate words distributed in different arrangement directions;

displaying the boundary between any two adjacent arrangement directions.

12. The method of claim 1, wherein displaying the plurality of hint words corresponding to the query information comprises:

and displaying the prompt words belonging to a plurality of types in a plurality of queues respectively, wherein the plurality of queues are in the form of a plurality of rows or a plurality of columns, and at least one prompt word of the type is distributed in each queue.

13. The method of claim 12, wherein the step of determining the position of the probe is performed,

the displaying the prompt words belonging to a plurality of types in a plurality of queues respectively comprises:

displaying the at least one keyword, wherein the at least one keyword is extracted from the query information or is obtained by carrying out semantic understanding on the query information;

and displaying candidate words belonging to a plurality of types in a plurality of queues respectively, wherein at least one candidate word of the type is distributed in each queue, and the candidate words of different types are associated with at least one keyword.

14. The method of claim 13, wherein when candidate words belonging to a plurality of types are displayed in a plurality of queues, respectively, the method further comprises:

In response to a browsing operation along a target direction in a target queue, moving contents in the target queue along the target direction, and

and displaying new candidate words of a target type in a free area formed by removing at least part of content in the target queue, wherein the distance of movement is positively correlated with the amplitude of the browsing operation, and the target type is the type corresponding to the target queue.

15. The method of claim 13, wherein when candidate words belonging to a plurality of types are displayed in a plurality of queues, respectively, the method further comprises:

displaying a delete button on each of said queues;

in response to a trigger operation for a first button on a first queue, one of the following processes is performed for the candidate word of a first type corresponding to the first queue:

stopping displaying the candidate words of the first type, and increasing the sizes of other queues to cover the first queue, wherein the other queues are queues except the first queue in the queues.

16. The method according to any one of claims 13 to 15, wherein said distributing at least one candidate word of said type in each of said queues comprises:

when the number N of the types is less than or equal to a type number threshold value N, N candidate words of the types are distributed in N queues in a one-to-one correspondence manner;

when the number N of the types is larger than the type number threshold N, N-1 candidate words of the types are distributed in the first N-1 queues in a one-to-one correspondence mode, and N-N+1 candidate words of the types are distributed in the nth queue.

17. The method according to any one of claims 1 to 9, 11 to 15, wherein,

the at least one keyword is in a selected state by default, the plurality of candidate words are in an unselected state by default, and each time the selecting operation is used for triggering and displaying a corresponding search result;

the response to the selection operation displays the search result corresponding to at least one prompting word selected by the selection operation, including:

and in response to a selection operation for at least one first target word, displaying that the at least one first target word is in a selected state, and displaying the at least one keyword and a search result corresponding to the at least one first target word, wherein the at least one first target word is at least one candidate word selected by the selection operation in the plurality of candidate words.

18. The method of claim 17, wherein the step of determining the position of the probe is performed,

after the displaying the search results corresponding to the at least one keyword and the at least one first target word, the method further includes:

in response to a cancel operation for at least one second target word, displaying the at least one second target word in an unselected state, wherein the at least one second target word is at least one of the at least one keyword and the at least one first target word that was canceled by the cancel operation;

displaying updated search results, wherein the updated search results correspond to the at least one keyword and the at least one first target word in addition to the at least one second target word.

19. The method of any of claims 3 to 9, 11 to 15, wherein the first control for responding to the information input operation comprises a search box for inputting the query information and a search button;

the displaying the search result corresponding to at least one prompting word selected by the selection operation comprises the following steps:

and responding to the triggering operation of the search button in the first control, and displaying the search result corresponding to at least one prompt word selected by the selection operation.

20. The method according to any one of claims 1 to 9, 11 to 15, further comprising:

the plurality of types of candidate words are determined by:

extracting the at least one keyword from the query information;

when the number of the at least one keyword is a plurality of, searching all nodes of the next stage of each keyword from the word graph;

determining the co-occurrence times of all nodes of the next stage of the keywords, and ordering the nodes in a descending order according to the co-occurrence times to obtain a descending order ordering result;

and deleting the nodes with the semantics opposite to any one of the keywords from the plurality of nodes at the head in the descending order sequencing result, and taking the words represented by the rest of the plurality of nodes as candidate words of a plurality of types.

21. The method according to any one of claims 1 to 9, 11 to 15, further comprising:

the plurality of types of candidate words are determined by:

extracting the at least one keyword from the query information;

when the number of the at least one keyword is one, searching all nodes of the next stage of the keyword from the word graph;

And deleting nodes with the opposite semantics to any one keyword from all nodes at the next stage of the keyword, and taking the words represented by the rest nodes as candidate words of a plurality of types.

22. A search processing apparatus, the apparatus comprising:

23. An electronic device, the electronic device comprising:

a memory for storing computer executable instructions;

a processor for implementing the search processing method of any one of claims 1 to 21 when executing computer-executable instructions or computer programs stored in the memory.

24. A computer-readable storage medium storing computer-executable instructions or a computer program, wherein the computer-executable instructions, when executed by a processor, implement the search processing method of any one of claims 1 to 21.

25. A computer program product comprising a computer program or computer-executable instructions which, when executed by a processor, implement the search processing method of any one of claims 1 to 21.