Commercial articles searching non result intelligent processing system and method
An intelligent processing system and fruitless technology, applied in data processing applications, electrical digital data processing, special data processing applications, etc., can solve problems such as lost customers, increase product sales, improve usability, and improve user experience Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0054] Example 1, the process of querying "Modern Japanese Grammar Manual":
[0055] The keyword submitted by the user is "Modern Japanese Grammar Manual". Since there is no exact matching result, the intelligent processing module is invoked.
[0056] First, the keywords are divided into individual Chinese characters "modern / modern / Japanese / language / language / law / manual / book", and it can be obtained from the inverted index file in which documents (commodities) each Chinese character has appeared in:
[0057] Now: DocID a1 , DocID a2 ,...DocID am
[0058] Generation: DocID b1 , DocID b2 ,...DocID bn
[0059] Day: DocID c1 , DocID c2 ,...DocID cp
[0060] Language: DocID d1 , DocID d2 ,...DocID dq
[0061] Method: DocID e1 , DocID e2 ,...DocID ex
[0062] Hand: DocIDf 1 , DocIDf 2 ,...DocIDfy
[0063] Book: DocIDg 1 , DocIDg 2 ,...DocIDgz
[0064] Summarize all the above DocIDs and remove duplicates to get all possible document numbers (result B). Even if...
example 2
[0081] Example 2. The processing process of querying "deformation steel":
[0082] Firstly, read the calculation result A of the index file as described above, that is, commodities containing at least one character among "variation", "shape", "gold" and "steel".
[0083] Then, according to the information of each commodity, the word with the longest matching length with the word input by the user is found according to the positive ranking index file, and the result B is obtained. The longest matching string corresponding to some products is "deformation gold", and some products can only get "transformation" and "deformation".
[0084] After that, expand both sides of the longest matching string to obtain the result C. Such as the commodity name that has is " Transformers (DVD9) ", and the longest matching string is " Transformers ", and the first is exactly " change " word, can't expand forward. Start to expand backwards, because the distance between "just" word and effectiv...
example 3
[0099] Example 3. The process of querying "The Edge of Learning and Pain":
[0100] What this user may use is the Wubi input method, the Wubi code of "learning" is "ip", and the Wubi code of "Love" is "ep". The present invention can effectively help him find the desired product.
[0101] Firstly, similar to the above, the result A is calculated according to the index file.
[0102] Then, according to the information of each commodity, the word with the longest matching length with the word input by the user is found according to the positive ranking index file, and the result B is obtained. The corresponding longest matching strings are "edge with pain" and "edge with reason".
[0103] After that, expand both sides of the longest matching string to obtain the result C. Some product names are "The Edge of Love and Pain (Written by Guo Jingming)", and the longest matching string is "The Edge of Pain", and after expanding forward a Chinese character, the boundary is encountered...
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