CN103559313A - Searching method and device - Google Patents

Abstract

The invention discloses a search method and device. Wherein, the search method includes: obtaining a default thesaurus; counting the number of times of each search word sent by the user through the client, adding the search words whose number of times is greater than a predetermined value to the default thesaurus to obtain the current thesaurus; The search term sent by the client is searched for the search term in the current thesaurus to obtain the search result, and the search result is returned to the client for display to the user. The above search method and device, by counting the number of times of each search word sent by the user, add the search words whose number of times is greater than a predetermined value to the default thesaurus, making it easier for popular words to hit relevant information, thereby improving the search hit rate.

Description

Search method and device

technical field

The invention relates to computer technology, in particular to a search method and device.

Background technique

The emergence of search engines has integrated the information of many websites and played the role of information navigation. Search engines are divided into vertical search engines and general search engines:

The general search engine is just like the portal website that appeared for the first time on the Internet. A large amount of information is integrated and navigated, and the query is extremely fast. Recognized by many merchants, it quickly became the most valuable field in the Internet;

A vertical search engine is a professional search engine for a certain industry. It is a subdivision and extension of a search engine. It is an integration of a certain type of specialized information in the webpage library, and the required data is extracted by directional sub-fields for processing. Some form is returned to the user.

Vertical search is a new search engine service model proposed relative to the large amount of information, inaccurate query, and insufficient depth of general search engines. information and related services. It is characterized by "specialization, precision, and depth" and has an industry color. Compared with the disordered massive information of general search engines, vertical search engines are more focused, specific, and in-depth.

The existing vertical search hit ratio relies heavily on the thesaurus, and an accurate thesaurus can provide a better search experience. Therefore, a relatively complete and updated thesaurus is needed.

Contents of the invention

In view of the above problems, the present invention is proposed to provide a search method and device for overcoming the above problems or at least partially solving the above problems.

According to one aspect of the present invention, a search method is provided, including:

get default thesaurus;

Counting the number of times of each search word sent by the user through the client, adding the search word whose number of times is greater than a predetermined value to the default thesaurus to obtain the current thesaurus;

Receive the search term sent by the user through the client, search for the search term in the current thesaurus, obtain the search result, and return the search result to the client for display to the user.

According to another aspect of the present invention, a search device is provided, including:

Obtaining modules, suitable for obtaining default thesaurus;

The adding module is suitable for counting the number of times of each search term sent by the user through the client, and adding the search term whose number of times is greater than a predetermined value to the default thesaurus to obtain the current thesaurus;

The search module is adapted to receive the search term sent by the user through the client, search for the search term in the current thesaurus, obtain the search result, and return the search result to the client for presentation to the user.

The above search method and device, by counting the number of times of each search word sent by the user, add the search words whose number of times is greater than a predetermined value to the default thesaurus, making it easier for popular words to hit relevant information, thereby improving the search hit rate.

The above description is only an overview of the technical solution of the present invention. In order to better understand the technical means of the present invention, it can be implemented according to the contents of the description, and in order to make the above and other purposes, features and advantages of the present invention more obvious and understandable , the specific embodiments of the present invention are enumerated below.

Description of drawings

Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiment. The drawings are only for the purpose of illustrating a preferred embodiment and are not to be considered as limiting the invention. Also throughout the drawings, the same reference numerals are used to designate the same parts. In the attached picture:

Figure 1a shows a flowchart of a search method according to an embodiment of the present invention;

Figure 1b shows a flowchart of a search method according to another embodiment of the present invention;

Fig. 2 shows a flowchart of a search method according to another embodiment of the present invention;

FIG. 3 shows a schematic structural diagram of a search device according to an embodiment of the present invention;

Fig. 4 shows a schematic structural diagram of a search device according to another embodiment of the present invention.

Detailed ways

Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited by the embodiments set forth herein. Rather, these embodiments are provided for more thorough understanding of the present disclosure and to fully convey the scope of the present disclosure to those skilled in the art.

Fig. 1a shows a flowchart of a search method according to an embodiment of the present invention. As shown in Figure 1a, the search method includes:

Step S101, obtaining a default thesaurus;

The default thesaurus is obtained by parsing, extracting and filtering the webpages crawled from the Internet, and then performing word segmentation on the processed webpage content;

Wherein, the default lexicon includes default lexicons of different categories; for example, the game lexicon includes a martial arts game lexicon, a simulation business game lexicon, etc.;

Step S103, counting the number of times of each search word sent by the user through the client, and adding the search word whose number of times is greater than a predetermined value to the default thesaurus to obtain the current thesaurus;

This step S103 includes: counting the number of times of each search term sent by the user through the client, determining the category corresponding to the search term, adding the search term in the category whose frequency is greater than a predetermined value to the default thesaurus of the corresponding category, and obtaining the corresponding category. current thesaurus.

Since the search term is saved in the log, the search term saved in the log can be written into the vocabulary through an hourly script file. If the word does not exist in the vocabulary, it will be added to the vocabulary. If the word already exists in the vocabulary , then add one to the count of the word.

Among them, the implementation code for obtaining search terms from logs is as follows:

Write the acquired search word into the vocabulary, if the word does not exist in the vocabulary, add it to the vocabulary, if the word already exists in the vocabulary, add one to the number of times of the word, the specific implementation code is as follows:

The above-mentioned vocabulary includes keywords, times of corresponding keywords and thesaurus segmentation lines, wherein the above-mentioned keywords can be Chinese words.

The format of the above vocabulary is shown in Table 1:

Table 1 Format of vocabulary

Key words frequency split line

Judging the category corresponding to each search word can be determined according to the degree of correlation between each search word and thesaurus of different categories. The categories of the words are determined to have the same category as these corresponding thesauruses, and the corresponding categories can also be determined through the current search word based on an empirical algorithm. The category includes categories of various applications, such as a game category, and the like.

The implementation code for adding a vocabulary containing search words whose number of times in a certain category is greater than a predetermined value to the default vocabulary of the corresponding category is as follows:

Step S105, receiving the search term sent by the user through the client, searching for the search term in the current thesaurus to obtain a search result, and returning the search result to the client for display to the user.

In addition, after obtaining the current thesaurus, the method may further include: Step S104, updating the index of the current thesaurus, as shown in FIG. 1b.

If the index of the current thesaurus is updated before step S105, the search word input by the user may be searched in the current thesaurus after the index is updated to obtain the search result.

From the above description, it can be known that the search involved in the embodiment of the present invention is a vertical search, that is, a search for a certain field such as a game field. Since the hit ratio of the vertical search depends heavily on the thesaurus, a relatively complete and fast update Thesaurus is particularly important, and the embodiment of the present invention can update the thesaurus conveniently and quickly, so as to obtain a better search experience.

The above search method is especially suitable for fields with strong timeliness, such as the field of games. In the above search method, by counting the number of times of each search word sent by the user, the search words whose number of times is greater than a predetermined value are added to the default thesaurus, so that popular words can more easily hit relevant information, thereby improving the search hit rate.

Fig. 2 shows a flowchart of a search method according to another embodiment of the present invention. As shown in Figure 2, the method includes:

Step S201, obtaining the vocabulary that needs to be added to the default vocabulary;

Before this step, first count the number of search words sent by the user through the client. The specific implementation method can be: write the search words stored in the log into the vocabulary through an hourly script file, if there is no word in the vocabulary This word is then added to the vocabulary, if the word already exists in the vocabulary, then the number of times of the word is increased by one; then the search word whose number of times is greater than the predetermined value is kept in the word list, and the number of times less than the number of times is deleted from the word list A search term for a predetermined value.

Assume that the current vocabulary is as shown in Table 2;

Table 2 Current vocabulary

Chinese words frequency of use split line Weaponry 10 x: 1 framed card 6 x: 1

The above predetermined value can be set as required, for example, it can be set to 5 times; at this time, the vocabulary that can be added to the corresponding default lexicon is shown in Table 3; of course, it can also be set to other values, such as 8 times, but If it is set to 8 times, the vocabulary that can be added to the corresponding default vocabulary is shown in Table 4.

Table 3 A vocabulary added to the default lexicon

Chinese word frequency of use split line Weaponry 10 x: 1 framed card 6 x: 1

Table 4 Another vocabulary added to the default vocabulary

Chinese word frequency of use split line Weaponry 10 x: 1

Step S202, processing the format of the vocabulary, generating a vocabulary text that meets the predetermined format requirements from the vocabulary;

The predetermined format can be flexibly set according to needs, for example, it can be set to mmseg format or other formats. mmseg is a common dictionary-based word segmentation system in Chinese word segmentation. It focuses on positive maximum matching, and the rules for disambiguation are Auxiliary, because of its simple implementation and fast running speed, the result is relatively good and its application is wide; the word segmentation system usually includes a dictionary, two matching algorithms and four ambiguity resolution rules.

For example, Table 3 can be converted into the following format:

Yitian Sword[tab]10

x:1

Framed card[tab]6

x:1

Other lines

Table 4 can be converted into the following format:

Yitian Sword[tab]10

x:1

Other lines

Step S203, add the generated vocabulary text that meets the predetermined format requirements to the end of the original vocabulary text unigram.txt of the corresponding category, save it as a new vocabulary text unigram_new.txt, and copy it to the directory where mmseg is located to generate new thesaurus;

For example, a new thesaurus unigram_new.txt.uni can be generated in the following way:

/usr/local/mmseg3/bin/mmseg-u /usr/local/mmseg3/etc/unigram_new.txt

In this embodiment, it is assumed that the set predetermined value is 5 times, so the Yitian sword can be added to the lexicon of martial arts games such as Yitian Tulongji, and the framing card can be added to the lexicon of business games such as Monopoly , that is, different types of games have their own default thesaurus, and the high-frequency search words input by the user can only be added to the thesaurus of the corresponding type of game. Through the above steps, after a new game is released, the lexicon corresponding to the game will be more complete.

Step S204, using a new thesaurus to replace the default thesaurus;

For example, the replacement can be implemented in the following ways, specifically:

mv /usr/local/mmseg3/etc/unigram_new.txt.uni/usr/local/mmseg3/etc/uni.lib

After the above steps S201-204, the words that the user is more interested in, that is, the words whose search times are greater than the predetermined value, can be better added to the corresponding default thesaurus;

Step S205, periodically updating the index of the current thesaurus, restarting the search component searchd;

The specific implementation is as follows:

/usr/local/coreseek/bin/indexer -c /usr/local/coreseek/etc/c.conf -all-pidfile -rotate

close searchd

ps auxww grep searchd

kill923230

start searchd

/usr/local/coreseek/bin/searchd -c /usr/local/coreseek/etc/c.conf -console-pidfile

Among them, searchd is the component that actually handles the search. When it runs, it behaves like a service. It communicates with various application program interfaces (APIs) called by client applications, and is responsible for accepting queries, processing queries, and returning data sets. .

Unlike the indexer (indexer), searchd is not used to be called from the command line or a general script. Instead, it is called as a daemon by init.d (on Unix/Linux-like systems), Or is used as a service (on Windows-like systems), so not all command-line options are always available, it's about build-time options.

Step S206, returning search results according to the received keywords.

After updating the index of the thesaurus and restarting the search component, the search operation can be performed.

From the above description, it can be known that the search involved in the embodiment of the present invention is a vertical search, that is, a search for a certain field such as a game field. Since the hit ratio of the vertical search depends heavily on the thesaurus, a relatively complete and fast update Thesaurus is particularly important, and the embodiment of the present invention can update the thesaurus conveniently and quickly, so as to obtain a better search experience.

In the above search method, by counting the number of times of each search word sent by the user, the search words whose number of times is greater than a predetermined value are added to the default thesaurus, so that popular words can more easily hit relevant information, thereby improving the search hit rate.

Fig. 3 shows a schematic structural diagram of a search device according to an embodiment of the present invention. As shown in Figure 3, the search device includes: an obtaining module 31, an adding module 32 and a searching module 33, wherein:

The obtaining module 31 is adapted to obtain a default thesaurus. The adding module 32 is adapted to count the number of times of each search word sent by the user through the client, and add the search word whose number of times is greater than a predetermined value to the above-mentioned default thesaurus to obtain the current thesaurus. The search module 33 is adapted to receive the search word sent by the user through the client, search for the search word in the current thesaurus, obtain the search result, and return the search result to the above-mentioned client for presentation to the user.

Wherein, the above-mentioned default thesaurus is obtained by parsing, extracting and filtering webpages captured from the Internet, and then performing word segmentation on the processed webpage content; the obtaining module is specifically suitable for obtaining default thesaurus of different categories. For example, the game lexicon includes a martial arts game lexicon, a business simulation game lexicon, and the like.

Since the search term is saved in the log, the search term saved in the log can be written into the vocabulary through an hourly script file. If the word does not exist in the vocabulary, it will be added to the vocabulary. If the word already exists in the vocabulary , then add one to the number of times of the word, so as to complete the statistics of the number of times of each search word; at the same time, determine the category corresponding to the search word, add the search word whose number is greater than the predetermined value to the default thesaurus of the corresponding category, and generate the corresponding category of the current vocabulary. The above-mentioned vocabulary may include keywords, times corresponding to keywords, and thesaurus segmentation lines. The format of the vocabulary can be found in Table 1. Wherein the above-mentioned keywords can be Chinese words, English words or other words.

Specifically, judging the category corresponding to each search word can be determined according to the degree of correlation between each search word and the thesaurus of different categories. The categories of the words are determined to have the same category as these corresponding thesauruses, and the corresponding categories can also be determined through the current search word based on an empirical algorithm. The category includes categories of various applications, such as a game category, and the like.

In addition, in the process of generating the current thesaurus corresponding to the category, the format of the vocabulary needs to be processed, and the vocabulary is generated into a vocabulary text that meets the requirements of a predetermined format; the predetermined format can be mmseg format or other formats. Specifically, add the generated vocabulary text that meets the predetermined format requirements to the end of the original vocabulary text unigram.txt of the corresponding category, save it as a new vocabulary text unigram_new.txt, and copy it to the directory where mmseg is located, thereby Generate new thesaurus.

Further, the search device may also include: an updating module 34, as shown in FIG. After the search term sent by the client is used, the search term is searched in the current thesaurus after the index is updated to obtain a search result, and the search result is returned to the above-mentioned client for display to the user.

The above search device is especially suitable for fields with strong timeliness, such as the field of games.

From the above description, it can be known that the search involved in the embodiment of the present invention is a vertical search, that is, a search for a certain field such as a game field. Since the hit ratio of the vertical search depends heavily on the thesaurus, a relatively complete and fast update Thesaurus is particularly important, and the embodiment of the present invention can update the thesaurus conveniently and quickly, so as to obtain a better search experience.

The above-mentioned search device adds the search words whose frequency is greater than a predetermined value to the default thesaurus by counting the number of times of each search word sent by the user, so that popular words can more easily hit relevant information, thereby improving the search hit rate.

The algorithms and displays presented herein are not inherently related to any particular computer, virtual system, or other device. Various generic systems can also be used with the teachings based on this. The structure required to construct such a system is apparent from the above description. Furthermore, the present invention is not specific to any particular programming language. It should be understood that various programming languages can be used to implement the content of the present invention described herein, and the above description of specific languages is for disclosing the best mode of the present invention.

In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure the understanding of this description.

Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, in order to streamline this disclosure and to facilitate an understanding of one or more of the various inventive aspects, various features of the invention are sometimes grouped together in a single embodiment, figure, or its description. This method of disclosure, however, is not to be interpreted as reflecting an intention that the claimed invention requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the Detailed Description are hereby expressly incorporated into this Detailed Description, with each claim standing on its own as a separate embodiment of this invention.

Those skilled in the art can understand that the modules in the device in the embodiment can be adaptively changed and arranged in one or more devices different from the embodiment. Modules or units or components in the embodiments may be combined into one module or unit or component, and furthermore may be divided into a plurality of sub-modules or sub-units or sub-assemblies. All features disclosed in this specification (including accompanying claims, abstract and drawings), as well as any method or method so disclosed, may be used in any combination, except that at least some of such features and/or processes or units are mutually exclusive. All processes or units of equipment are combined. Each feature disclosed in this specification (including accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.

Furthermore, those skilled in the art will understand that although some embodiments described herein include some features included in other embodiments but not others, combinations of features from different embodiments are meant to be within the scope of the invention. and form different embodiments. For example, in the following claims, any one of the claimed embodiments may be used in any combination.

The various component embodiments of the present invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art should understand that a microprocessor or a digital signal processor (DSP) may be used in practice to implement some or all functions of some or all components in the search device according to the embodiments of the present invention. The present invention can also be implemented as an apparatus or an apparatus program (for example, a computer program and a computer program product) for performing a part or all of the methods described herein. Such a program for realizing the present invention may be stored on a computer-readable medium, or may be in the form of one or more signals. Such a signal may be downloaded from an Internet site, or provided on a carrier signal, or provided in any other form.

It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention can be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In a unit claim enumerating several means, several of these means can be embodied by one and the same item of hardware. The use of the words first, second, and third, etc. does not indicate any order. These words can be interpreted as names.

Claims (10)

1. a searching method, comprising:

Obtain acquiescence dictionary;

The number of times of each search word that counting user sends by client, the search word that number of times is greater than to predetermined value adds in described acquiescence dictionary, obtains current dictionary;

Receive the search word that user sends by client, in current dictionary, search for this search word, obtain Search Results, and return to this Search Results for showing to user to described client.

2. method according to claim 1, described acquisition acquiescence dictionary comprises: obtain different classes of acquiescence dictionary; Or

The number of times of each search word that described counting user sends by client, the search word that number of times is greater than to predetermined value adds in described acquiescence dictionary, obtains current dictionary, comprising:

The number of times of each search word that counting user sends by client, classification corresponding to judgement search word, the search word that number of times in this classification is greater than to predetermined value adds in the acquiescence dictionary of corresponding classification, obtains the current dictionary of corresponding classification.

3. method according to claim 2, the number of times of each search word that described counting user sends by client, classification corresponding to judgement search word, the search word that number of times is greater than to predetermined value adds in the acquiescence dictionary of corresponding classification, the current dictionary that obtains corresponding classification, comprising:

Utilize script file that the search word being kept in daily record is write to vocabulary, and the number of times of corresponding search word is carried out to accumulation process;

Classification corresponding to judgement search word;

The search word that number of times is greater than to predetermined value is retained in described vocabulary, described vocabulary is added in the acquiescence dictionary of corresponding classification, generates the current dictionary of corresponding classification, uses the current dictionary of corresponding classification to replace the acquiescence dictionary of corresponding classification.

4. method according to claim 3, described vocabulary comprises that the number of times of keyword, corresponding keyword and dictionary cut apart row.

5. method according to claim 1, described acquiescence dictionary for the webpage capturing from internet is resolved, extraction and filtration treatment, then the web page contents after processing is carried out to word segmentation processing acquisition.

6. a searcher, comprising:

Obtain module, be suitable for obtaining acquiescence dictionary;

Add module, be suitable for the number of times of each search word that counting user sends by client, the search word that number of times is greater than to predetermined value adds in described acquiescence dictionary, obtains current dictionary;

Search module, is suitable for receiving the search word that user sends by client, searches for this search word in current dictionary, obtains Search Results, and returns to this Search Results for showing to user to described client.

7. device according to claim 6, described acquisition module, is specifically suitable for obtaining different classes of acquiescence dictionary; Or

Described interpolation module, is specifically suitable for: the number of times of each search word that counting user sends by client, the search word that number of times in this classification is greater than to predetermined value adds in the acquiescence dictionary of corresponding classification, obtains the current dictionary of corresponding classification.

8. device according to claim 7, described interpolation module, is specifically suitable for:

Utilize script file that the search word being kept in daily record is write to vocabulary, and the number of times of corresponding search word is carried out to accumulation process; The search word that number of times is greater than to predetermined value is retained in described vocabulary, described vocabulary is added in the acquiescence dictionary of corresponding classification, generates the current dictionary of corresponding classification, uses the current dictionary of corresponding classification to replace the acquiescence dictionary of corresponding classification.

9. device according to claim 8, described vocabulary comprises that the number of times of keyword, corresponding keyword and dictionary cut apart row.

10. device according to claim 1, described acquiescence dictionary for the webpage capturing from internet is resolved, extraction and filtration treatment, then the web page contents after processing is carried out to word segmentation processing acquisition.

Images