Intelligent prompt method, module and system for search
An intelligent, historical search technology, applied in the field of keyword search
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0109] In this embodiment, the foregoing step S3 is realized through the following steps:
[0110] S31: The server splits the initial string according to the tokenizer to obtain prefixes and suffixes;
[0111] S32: The server searches the thesaurus according to the prefixes and suffixes to obtain prefix synonyms and suffix synonyms;
[0112] S33: The server traverses the hotword suffix tree to find hotwords matching prefixes and / or suffixes, and obtains a candidate word information list.
[0113] In this embodiment, the thesaurus is a database used by the server to store synonymous associations between keywords. Thesaurus is usually provided by commercial dictionaries, or you can build your own.
[0114] In this embodiment, step S31 is implemented by a word segmentation module or device. The word segmentation module or device is also the aforementioned word segmenter. Those skilled in the art understand that the prefix and suffix processed in step S31 may be the same. In ...
Embodiment 2
[0120] This embodiment is based on Embodiment 1. Specifically, a step is added after Step S33 in Embodiment 1, that is, Step S34: the server calculates the probability of each candidate word according to the analysis of the user history search behavior database.
[0121] Step S34 of this embodiment is realized by a historical behavior analysis device or device. The problem to be solved is to obtain the probability that the user intends to input the candidate word under the condition that the user enters the initial character string through the statistical analysis of the user's historical search for a specific candidate word. . The input of this embodiment is the candidate word information list obtained in step S33, and the output is also the candidate word information list, but the candidate word information in the output candidate word information list increases the probability of candidate words.
[0122] The calculation of the probability of the candidate words is obtained...
Embodiment approach 1
[0124] It is assumed that historical behavior information includes original character strings, click hot words and click frequency. The server searches the user's historical search behavior database for historical behavior information in which the original character string is the same as the initial character string and the clicked hot words are the same as the candidate words. The click frequency in historical behavior information can be used as the probability of candidate words. Since the click frequency is an integer greater than 0, and the probability in the general sense is a value between 0 and 1, for this reason, the click frequency of each candidate word can be normalized as the probability of the candidate word, and the click frequency is normalized The chemical processing can refer to the following method: suppose K candidate words are included in the candidate word information list, and the click frequency of each candidate word is respectively: , then the probab...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com