A method and system for calculating a search content matching degree based on a search word

By identifying and calculating the atomic word matching degree in search terms, analyzing the matched words in the text content and performing superimposed calculations, the problem of low accuracy in existing search engines is solved, and more efficient search result display is achieved.

CN115357774BActive Publication Date: 2026-01-16SHENZHEN SEKORM COMPONENT NETWORK CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202210889885.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-07-27
Publication Date
2026-01-16
Estimated Expiration
2042-07-27

AI Technical Summary

Technical Problem

Existing search engines use a Lucene scoring formula based on user search terms, resulting in low search accuracy and failing to prioritize the display of high-quality content.

Method used

This paper proposes a method for calculating the matching degree of search content based on search terms. The method receives search terms input by users, identifies word units, calculates word unit matching degree based on the identifier of atomic word units, analyzes the word units that are matched in the text content, and finally calculates the matching degree by superimposing them, and prioritizes the display of search content with high matching degree.

Benefits of technology

It improves search accuracy and user experience, quickly retrieves document data that users need, and prioritizes displaying content with high relevance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115357774B_ABST
    Figure CN115357774B_ABST
Patent Text Reader

Abstract

The application discloses a method and system for calculating the matching degree of search content based on search words, which receives the search words input by a user, identifies the word elements in the search words, calculates the matching degree of the identified word elements based on the identification of the atomic word elements, analyzes and identifies the hit word elements in the searched text content, and finally performs matching degree superposition calculation on the hit word elements, so as to calculate the matching degree of the search content, improve the search experience of the user, and quickly search the document data required by the user.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] The present application relates to the field of computer search and word segmenter, and particularly relates to a method and system for calculating matching degree of search content based on search words. BACKGROUND

[0002] With the development of Internet technology and the popular use of computers, a large amount of information appears in our life every day. In the era of information flooding, due to the lack of information release and the lack of management or poor management, a large amount of false information and useless information is generated, thereby increasing the difficulty of people to check information. The current search engine generally searches content based on the Lucene scoring formula according to the user search words, but the search accuracy is not high, the search effect is not ideal, and some high-quality content is not preferentially displayed to the user. SUMMARY

[0003] The present application solves the technical problem of at least one defect in the prior art: low search accuracy, and provides a method and system for calculating matching degree of search content based on search words.

[0004] The technical scheme adopted by the present application to solve the technical problem is: a method for calculating matching degree of search content based on search words is constructed, comprising the following steps:

[0005] S10: receiving a search word input by a user, and identifying a word element in the search word;

[0006] S20: calculating the matching degree of the identified word element based on the identification of the atomic word element;

[0007] S30: analyzing and identifying the hit word element in the searched text content;

[0008] S40: performing matching degree superposition calculation on the hit word element, thereby calculating the matching degree of the search content.

[0009] Preferably, in the method for calculating matching degree of search content based on search words, the method further comprises S01: constructing a dictionary binary tree according to all word elements of the system;

[0010] Correspondingly, the identification of the word element in the search word in step S10 comprises: identifying the word element in the search word based on the dictionary binary tree.

[0011] Preferably, in the method for calculating matching degree of search content based on search words, step S10 further comprises: identifying the word element in the search word and the position information of the word element in the search word;

[0012] Step S20 comprises:

[0013] S201: extracting contained word units according to the position information of the recognized word units based on the containing relationship between the word units;

[0014] S202: calculating the total number of atomic word units in the contained word units as the matching degree of the recognized word units.

[0015] Preferably, in the method for calculating the matching degree of search content based on search words, the atomic word unit is a word unit that cannot be combined by other word units.

[0016] Preferably, in the method for calculating the matching degree of search content based on search words, the method further comprises the following steps after step S30:

[0017] S31: performing containing filtering on the matched word units;

[0018] Correspondingly, step S40 comprises: performing matching degree superposition calculation on the containing filtered word units, thereby calculating the matching degree of the search content.

[0019] The application also constructs a system for calculating the matching degree of search content based on search words, comprising:

[0020] A first identification module for receiving user input search words and identifying word units in the search words;

[0021] A first calculation module for calculating the matching degree of the recognized word units based on the identification of atomic word units;

[0022] A second identification module for analyzing and identifying matched word units in the searched text content;

[0023] A second calculation module for performing matching degree superposition calculation on the matched word units, thereby calculating the matching degree of the search content.

[0024] Preferably, in the system for calculating the matching degree of search content based on search words, the system further comprises:

[0025] A construction module for constructing a dictionary binary tree according to all word units of the system;

[0026] Correspondingly, the first identification module identifies word units in the search words, comprising: identifying word units in the search words based on the dictionary binary tree.

[0027] Preferably, in the system for calculating the matching degree of search content based on search words, the first identification module is further used to identify word units in the search words and their position information in the search words;

[0028] The first calculation module comprises:

[0029] an extracting unit configured to extract contained word units from the identified word units according to position information of the identified word units based on a containing relationship between the word units;

[0030] a calculating unit configured to calculate a total number of atomic word units in the contained word units as the matching degree of the identified word units.

[0031] Preferably, in the system for calculating a matching degree of search content based on a search word, the atomic word unit is a word unit that cannot be combined by other word units.

[0032] Preferably, in the system for calculating a matching degree of search content based on a search word, the system further comprises:

[0033] a filtering module configured to perform containing filtering on the hit word units;

[0034] Correspondingly, the second calculating module is further configured to perform matching degree superposition calculation on the containing filtered word units, thereby calculating the matching degree of the search content.

[0035] By implementing the present application, the following beneficial effects are achieved:

[0036] The present application discloses a method for calculating a matching degree of search content based on a search word, which receives a search word input by a user, identifies word units in the search word, calculates a matching degree of the identified word units based on identification of atomic word units, analyzes and identifies hit word units in searched text content, and finally performs matching degree superposition calculation on the hit word units, thereby calculating the matching degree of the search content, improving user search experience, and quickly searching for document data required by the user. BRIEF DESCRIPTION OF DRAWINGS

[0037] The present application will be further described below in conjunction with the accompanying drawings and embodiments, in which:

[0038] Figure 1 is a flowchart of the method for calculating a matching degree of search content based on a search word of the present application;

[0039] Figure 2 is a system module block diagram for calculating a matching degree of search content based on a search word of the present application. DETAILED DESCRIPTION

[0040] In order to have a clearer understanding of the technical features, objectives and effects of the present application, the specific embodiments of the present application will be described in detail below with reference to the accompanying drawings.

[0041] It should be noted that the flowcharts shown in the drawings are only illustrative, and do not necessarily include all the contents and operations / steps, nor are they necessarily executed in the order described. For example, some operations / steps can be further decomposed, and some operations / steps can be combined or partially combined, so the actual execution order can be changed according to the actual situation.

[0042] The block diagrams shown in the drawings are only functional entities, and do not necessarily correspond to physically independent entities. That is, these functional entities can be implemented in software form, or in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0043] As Figure 1 shown, the embodiment discloses a method for calculating the matching degree of search content based on search words, including steps S10, S20, S30 and S40:

[0044] Step S10: receiving the search words input by the user, and identifying the word units in the search words. For example, the user inputs "Schottky diode", and the segmentation result is as follows: "Schottky diode", "Schottky diode", "Schottky", "diode", "diode", and "diode".

[0045] In some embodiments, the method further includes step S01: constructing a dictionary binary tree according to all word units of the system. Wherein, all word units of the system include sensor, epson, Schottky diode, Schottky diode, diode, diode, and diode.

[0046] Correspondingly, the identification of the word units in the search words in step S10 includes: the word segmenter identifies the word units in the search words based on the dictionary binary tree.

[0047] In some other embodiments, the method further includes step S00: maintaining all word units of the system.

[0048] Step S20: calculating the matching degree of the identified word units based on the identification of atomic word units.

[0049] Specifically, step S10 further includes: identifying the word units in the search words and their position information in the search words. For example, the search words are "query Schottky diode", and the position information of "Schottky diode" is 2-7, and "query" is 0 and 1 respectively.

[0050] Step S20 includes:

[0051] S201: based on the inclusion relationship between the word units, extracting the included word units according to the position information of the identified word units;

[0052] S202: Calculate the total number of atomic word units in the contained word units as the matching degree of the recognized word unit. The atomic word unit is a word unit that cannot be combined by other word units. For example, "Schottky diode" can be combined by "Schottky" and "diode", so it is a non-atomic word unit; "Schottky diode" cannot be combined by other word units, so it is an atomic word unit; "Schottky" cannot be combined by other word units, so it is an atomic word unit; "diode" can be combined by "di" and "pipe", so it is a non-atomic word unit; "di" cannot be combined by other word units, so it is an atomic word unit; "pipe" cannot be combined by other word units, so it is an atomic word unit.

[0053] Specifically, for example, the recognized word unit "Schottky diode" contains: "Schottky diode", "Schottky", "diode", "di", "pipe", and the atomic word units are: "Schottky diode", "Schottky", "di", "pipe", so the matching degree of the recognized word unit "Schottky diode" is 4.

[0054] For another example, the recognized word unit "Schottky diode" contains: "Schottky diode" (atomic word unit contains itself), "di", "pipe", so the matching degree of the recognized word unit "Schottky diode" is 3.

[0055] Based on the above calculation method: the matching degree of the recognized word unit "Schottky" is 1; the matching degree of the recognized word unit "diode" is 2; the matching degree of the recognized word unit "di" is 1; the matching degree of the recognized word unit "pipe" is 1.

[0056] Step S30: Analyze and identify the hit word units in the searched text content. For example, the title of an article is: Yangjie Technology Silicon Carbide JBS Schottky Diode New Product Release. Then the article hits the word units "Schottky diode", "Schottky diode", "Schottky", "diode", "di", "pipe".

[0057] Step S40: Perform matching degree superposition calculation on the hit word units to calculate the matching degree of the search content. The matching degrees for superposition calculation are the matching degrees calculated in step S20.

[0058] In some embodiments, step S30 further includes:

[0059] Step S31: Containment filtering is performed on the hit word units. For example, the title of an article is: "YJ Technology Silicon Carbide JBS Schottky Diode New Product Release". The article hits the word units "Schottky Diode", "Special Diode", "Schottky", "Diode", "Di", and "Diode". After containment filtering, "Schottky Diode" is left, and "Special Diode", "Schottky", "Diode", "Di", and "Diode" are filtered out because they are contained in "Schottky Diode".

[0060] Correspondingly, step S40 includes: performing matching degree superposition calculation on the word units after containment filtering, thereby calculating the matching degree of the search content. For example, the title of an article is: "YJ Technology Silicon Carbide JBS Schottky Diode New Product Release". The hit word unit is "Schottky Diode", and the matching degree of "Schottky Diode" is calculated as 4 in the word unit matching degree calculation module. Therefore, the matching degree of the article is 4.

[0061] In summary, the method further includes S50: after the matching degree of the search content is calculated, the search content is displayed in reverse order according to the matching degree, and search content with a high matching degree is presented preferentially, thereby improving the search experience of the user.

[0062] As shown in Figure 2 The embodiment discloses a system for calculating the matching degree of search content based on a search word, which includes a first recognition module, a first calculation module, a second recognition module, and a second calculation module. Specifically:

[0063] The first recognition module is configured to receive a search word input by a user and recognize word units in the search word. For example, the user inputs "Schottky Diode", and the word segmentation result is as follows: "Schottky Diode", "Special Diode", "Schottky", "Diode", "Di", and "Diode".

[0064] In some embodiments, the system further includes a construction module configured to construct a dictionary binary tree based on all word units of the system. The all word units of the system include sensor, Epson, Schottky Diode, Special Diode, Diode, Di, and Diode.

[0065] Correspondingly, the first recognition module recognizes the word units in the search word, including: a word segmenter recognizes the word units in the search word based on the dictionary binary tree.

[0066] In some other embodiments, the system further includes a word unit maintenance module configured to maintain all word units of the system.

[0067] The first calculation module is configured to calculate the matching degree of the recognized word units based on the identification of the atomic word units.

[0068] Specifically, the first identification module is further configured to identify the word units in the search word and their position information in the search word. For example, the search word is "query Schottky diode", in which the position information of "Schottky diode" is 2-7, and "query" is 0 and 1, respectively.

[0069] The first calculation module comprises:

[0070] The extraction unit is configured to extract the contained word units according to the position information of the identified word units based on the containing relationship between the word units.

[0071] The calculation unit is configured to calculate the total number of atomic word units in the contained word units as the matching degree of the identified word units. For example, "Schottky diode" can be combined from "Schottky" and "diode", so it is a non-atomic word unit; "Schottky diode" cannot be combined from other word units, so it is an atomic word unit; "Schottky" cannot be combined from other word units, so it is an atomic word unit; "diode" can be combined from "di" and "pipe", so it is a non-atomic word unit; "di" cannot be combined from other word units, so it is an atomic word unit; "pipe" cannot be combined from other word units, so it is an atomic word unit.

[0072] Specifically, for example, the identified word unit "Schottky diode" contains "Schottky diode", "Schottky", "diode", "di", and "pipe", and the atomic word units are "Schottky diode", "Schottky", "di", and "pipe", so the matching degree of the identified word unit "Schottky diode" is 4.

[0073] For another example, the identified word unit "Schottky diode" contains "Schottky diode" (atomic word unit contains itself), "di", and "pipe", so the matching degree of the identified word unit "Schottky diode" is 3.

[0074] Based on the above calculation method, the matching degree of the identified word unit "Schottky" is 1; the matching degree of the identified word unit "diode" is 2; the matching degree of the identified word unit "di" is 1; and the matching degree of the identified word unit "pipe" is 1.

[0075] The second identification module is configured to analyze and identify the hit word units in the searched text content. For example, the title of an article is: "Yangjie Technology Silicon Carbide JBS Schottky Diode New Product Release". The article hits the word units "Schottky diode", "Schottky diode", "Schottky", "diode", "di", and "pipe".

[0076] The second calculating module is configured to perform superimposed calculation on the matching degrees of the hit word elements, so as to calculate the matching degree of the search content. The matching degree subjected to the superimposed calculation is the matching degree calculated in the first calculating module.

[0077] In some embodiments, the system further comprises:

[0078] The filtering module is configured to perform inclusion filtering on the hit word elements. For example, the title of an article is: "YJ Technology Silicon Carbide JBS Schottky Diode New Product Release". The article hits the word elements of "Schottky Diode", "Diode", "Schottky", "Diode", "Diode", and "Diode". After the inclusion filtering, only "Schottky Diode" is left, because "Diode", "Diode", "Diode", and "Diode" are included in "Schottky Diode", so they are filtered out.

[0079] Correspondingly, the second calculating module is further configured to perform superimposed calculation on the matching degrees of the word elements subjected to the inclusion filtering, so as to calculate the matching degree of the search content. For example, the title of an article is: "YJ Technology Silicon Carbide JBS Schottky Diode New Product Release". The hit word element is "Schottky Diode". The matching degree of "Schottky Diode" is calculated in the word element matching degree calculating module, and the matching degree of the article is 4.

[0080] In summary, the system further comprises a display module configured to perform reverse-order layout display of the search content according to the matching degree after the matching degree of the search content is calculated, so as to preferentially present the search content with a high matching degree, thereby improving the search experience of the user.

[0081] By implementing the present application, the following beneficial effects are achieved:

[0082] The present application designs a method for calculating the matching degree of search content based on search words. The method receives the search words input by a user, identifies the word elements in the search words, calculates the matching degrees of the identified word elements based on the identification of the atomic word elements, analyzes and identifies the hit word elements in the searched text content, and finally performs superimposed calculation on the matching degrees of the hit word elements, so as to calculate the matching degree of the search content, improve the search experience of the user, and quickly search for the document data required by the user.

[0083] It can be understood that the above embodiments only express the preferred embodiments of the present application, and the description is relatively specific and detailed, but it cannot be understood as a limitation on the patent scope of the present application. It should be noted that, for ordinary skilled persons in the art, the above technical features can be freely combined without departing from the concept of the present application, and some modifications and improvements can be made, which all belong to the protection scope of the present application. Therefore, any equivalent transformation and modification within the scope of the claims of the present application should belong to the scope of the claims of the present application.

Claims

1. A method for calculating a matching degree of search content based on a search word, characterized by, The method comprises the following steps: S10: receiving a search word input by a user and identifying word units in the search word and position information of the word units in the search word; S20: calculating a matching degree of the identified word units based on identification of atomic word units; step S20 comprises S201: extracting contained word units according to the position information of the identified word units based on a containing relationship between the word units; S202: calculating a total number of atomic word units in the contained word units as the matching degree of the identified word units; wherein the atomic word units are word units that cannot be combined from other word units; S30: analyzing and identifying hit word units in searched text content; S31: performing containing filtering on the hit word units; S40: performing matching degree superposition calculation on the word units after containing filtering, thereby calculating a matching degree of search content.

2. The method of claim 1, wherein the search term-based search content matching degree is calculated by, The method further comprises S01: constructing a dictionary binary tree according to all word units of the system; Correspondingly, the identification of the word units in the search word in step S10 comprises: identifying the word units in the search word based on the dictionary binary tree.

3. A system for calculating a matching degree of search content based on a search word, characterized by, The system comprises: a first identification module configured to receive a search word input by a user and identify word units in the search word and position information of the word units in the search word; a first calculation module configured to calculate a matching degree of the identified word units based on identification of atomic word units; the first calculation module comprises an extraction unit and a calculation unit, the extraction unit is configured to extract contained word units according to the position information of the identified word units based on a containing relationship between the word units, and the calculation unit is configured to calculate a total number of atomic word units in the contained word units as the matching degree of the identified word units; wherein the atomic word units are word units that cannot be combined from other word units; a second identification module configured to analyze and identify hit word units in searched text content; a filtering module configured to perform containing filtering on the hit word units; a second calculation module configured to perform matching degree superposition calculation on the word units after containing filtering, thereby calculating a matching degree of search content.

4. The system for calculating a matching degree of search content based on a search word according to claim 3, wherein, The system further comprises: a construction module configured to construct a dictionary binary tree according to all word units of the system; Correspondingly, the identification of the word units in the search word in the first identification module comprises: identifying the word units in the search word based on the dictionary binary tree.

Citation Information

Patent Citations

  • Electronic navigation system information searching method and device thereof

    CN101131325A

  • Text matching method and device

    CN105893533A