Recommending method and search engine for searching candidate words

Abstract

The invention provides a recommendation method and search engine for search candidate words. The recommendation method comprising steps that a search engine server receives input information input by a user and obtains prefix information of the input information; the prefix information serves as an index to obtain a plurality of search candidate words and weight of each search candidate word; whether at least two search candidate words of the search candidate words belong to the same subject is judged; if at least two search candidate words belong to the same subject, the weight of one of the at least two search candidate words is kept unchanged, downgrading processing is conducted on the weight of others of the at least two search candidate words; sequencing is conducted according to the weight of the search candidate words, and the sequenced search candidate words are provided for the user. According to the recommendation method, diversity and accuracy of the search candidate words are improved, search requirements of the user can be met, an algorithm is simple and easy to implement, and user experience is improved.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a method for recommending search candidate words and a search engine. Background technique [0002] Search engines mainly use prefix matching to provide users with search candidate words. Specifically, for a certain prefix, the search engine mainly determines which search candidate words to provide and their ranking based on the popularity of search candidate words, that is, the retrieval frequency. [0003] However, if the content that the user needs to search has the same prefix as a hot word, it is likely that the content related to the hot word will be ranked in the front due to its higher popularity and higher ranking weight. The content to be searched cannot be included in the candidate words. Although the search candidate words can be rearranged based on topic clustering, the cost of calculation based on topic clustering is high, and there is a potential risk of escaping...

AI Technical Summary

Problems solved by technology

[0003] However, if the content that the user needs to search has the same prefix as a hot word, it is likely that the content related to the hot word will be ranked in the front due to its higher popularity and higher ranking weight. The content to be searched cannot be included in the candidate words. Although the search candidate words can be rearranged based on topic clustering, the cost of calculation based on topic clustering is high, and there is a potential risk of escaping. It is difficult to meet the needs of users to search

Images