Prime number replacing character string search technology
A retrieval technology, string technology, applied in digital data information retrieval, unstructured text data retrieval, electronic digital data processing and other directions, can solve the problems of inefficiency, low efficiency, inability to effectively improve fuzzy retrieval efficiency, etc. To achieve the effect of improving efficiency and reducing the amount of calculation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
Embodiment 1
[0024] 400 to 600 prime numbers N represent the basic radicals and strokes of Chinese characters, such as 2 for "big", 3 for "ding", 5 for "mouth", 7 for "wood", and 11 for "亻". The F value of the product of the prime numbers of the basic radicals is assigned to all Chinese characters, such as "Ke" is composed of "D" and "Kou", and 3*5=15, then the F value of "Ke" is 15. Similarly, the F value of "Qi" is 2*5*7=30, the F value of "Ke" is 7*3*5=105, and the F value of "He" is 11*3*5=165. Thus, a database containing all Chinese characters and their corresponding values F can be constructed.
[0025] After assigning values to all Chinese characters in this way, if a certain Chinese character contains a certain radical, then the F value of this Chinese character must be divisible by the prime number N of a certain radical. If "Ke" contains "口", the F value of "Ke" must be divisible by the prime number N"5" of "Ke"; on the other hand, that is, all Chinese characters whose F val...
Embodiment 2
[0030] Use 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 ,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229 56 prime numbers such as , 233, 239, 241, 251, 257, 263 represent 56 English letters such as cluster a-z and A-Z, then English words can be represented by the product F of these prime numbers. If the value of able is 2*3*37*11=2442, it is possible to establish a database of English words and their corresponding F values. In the data, all words with the suffix "able" must be divisible by 2442, so you can use whether it is divisible by 2442 to find all the words with the suffix "able".
[0031] Searching with this method will retrieve non-target words such as bale, which is not an accurate query, but it can effectively narrow the scope of the search, and then use the character comparison method to perform a secondary search to achieve an accurate query.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More