A web page search content matching method and system

Abstract

The present invention discloses a web page search content matching method and system, and relates to the field of intelligent search technology; an Internet page search bar is set, keywords in the Internet page search bar are collected, and a relevant title node database is constructed according to the keywords; the keywords are processed according to the relevant title node database, and a title node communication thinking diagram is constructed according to the processing results; the title node communication thinking diagram is optimized, and an optimized title node communication thinking diagram is generated according to the optimization results; the page search content is matched according to the optimized title node communication thinking diagram; the present invention solves the search complexity and the cumbersome steps.

Description

Technical Field

[0001] The present invention relates to the field of intelligent search technology, and in particular to a web page search content matching method and system. Background Art

[0002] At present, people are increasingly aware of the important value of Internet information. In daily life, people often use computers or mobile phones to browse web content on the Internet using the browsers in them to obtain news information. The presentation of Internet web content may be that one subject content occupies only one page, or one subject content is divided into multiple pages for display. For example, forums, news websites, online novel web pages, etc. often use multiple pages to present one subject content, and mark each page with page numbers or next page and other marks to remind readers that there are subsequent related pages.

[0003] In the prior art, the homepage content of existing Internet pages is presented based on the keywords input by the search. Generally, several main page contents are searched out based on the keywords. If the user needs to view the keywords in the main page content, the user needs to enter the keywords again to search, or click on the main page content to search for the keywords, which leads to the complexity of the search and the cumbersome steps. It is impossible to search for keywords related to the main page content based on a keyword input by the user, and it is impossible to provide search diversity and convenience. Therefore, a web page search content matching method and system are provided. Summary of the invention

[0004] In order to solve the above technical problems, the present invention provides a web page search content matching method and system;

[0005] The object of the present invention can be achieved by the following technical solution: A webpage search content matching method, the method comprising:

[0006] Step 1: Set up an Internet page search bar, collect keywords in the Internet page search bar, and build a relevant title node database based on the keywords;

[0007] Step 2: Process the keywords according to the relevant title node database, and build a title node communication thinking diagram based on the processing results;

[0008] Step 3: Optimize the title node communication thinking diagram, and generate an optimized title node communication thinking diagram according to the optimization results;

[0009] Step 4: Match the page search content based on the optimized title node communication thinking diagram.

[0010] Furthermore, the construction process of the relevant title node database includes:

[0011] Set the page to an Internet page, which includes a main page and a secondary page

[0012] The main page represents the Internet where the keyword is input; the secondary page represents the Internet page obtained according to the main page;

[0013] Marking the links displayed on the Internet page as titles; setting embedding points in all titles of the Internet page to collect keywords of the titles of the Internet page, marking the keywords of all titles of the Internet page, generating a number of title nodes, storing the several title nodes, and generating a title node database;

[0014] Sending keywords collected in the search bar of an Internet page to a title node database, matching title nodes in the title node database, marking title nodes identical to the keywords, generating a plurality of target title nodes, connecting the plurality of target title nodes, and generating a first title;

[0015] Mark the first title as the main page content; click the first title to obtain several keywords in the main page content corresponding to the first title, and generate several related keyword nodes accordingly, and connect the several related keyword nodes to generate the second title;

[0016] Similarly, obtain the second title, the third title, ..., the kth title, where k is a natural number greater than 0;

[0017] The second title, the third title, ..., the kth title are linked to construct a related title node database for storage.

[0018] Furthermore, the process of constructing the title node communication mind map includes:

[0019] Setting a data tree, the data tree comprising a root, branches, subbranches and leaves; the root is connected to the branches, the branches are connected to the leaves, and the leaves are connected to each other by the branches;

[0020] The keyword is set as the root of the data tree; several target title nodes in the first title are generated into several target title node leaves connected to the root by branches;

[0021] According to the semantics of the keywords, the actual meaning of the keywords is obtained. According to the actual meaning of the keywords, synonyms of the actual meaning are obtained, and the synonyms are sent to the relevant title node database for matching. The relevant keyword nodes that are the same as the synonyms are obtained and marked as synonym title nodes. The synonym title nodes are generated into synonym node leaves, and the leaves are connected by branches to the corresponding target title node leaves; the connected branches are generated into synonym branches.

[0022] Further, according to the role, meaning, application, scope and implementation of the keyword, the corresponding relevant keyword node in the relevant title node database is obtained, and the role node leaf, meaning node leaf, application node leaf, scope node leaf and implementation node leaf are generated accordingly, and the role branch, meaning branch, application branch, scope branch and implementation branch are generated corresponding to the connected branches, and the target title node leaf is connected accordingly;

[0023] Connect keywords, several target title node leaves and several leaves using branches and twigs to construct a title node communication thinking diagram.

[0024] Furthermore, the generation process of the optimized title node communication mind map includes:

[0025] Setting hidden arrows on the branches and sub-branches of the title node communication mind map, wherein the hidden arrows are used to hide the leaves connected to the corresponding branches and sub-branches;

[0026] Get the number of leaves connected to each branch and each sub-branch, and generate the first number of leaves and the second number of leaves;

[0027] Setting a threshold value for the number of leaves, and comparing the first number of leaves or the second number of leaves according to the threshold value for the number of leaves;

[0028] If the first leaf quantity or the second leaf quantity is less than the leaf quantity threshold, the corresponding hidden arrow is automatically opened;

[0029] If the number of the first leaves or the number of the second leaves is greater than the threshold value of the number of leaves, the corresponding hiding arrow is automatically closed to hide the corresponding leaves;

[0030] If the first leaf quantity or the second leaf quantity is equal to the leaf quantity threshold, the first leaf quantity and the second leaf quantity are marked to obtain the leaf quality value.

[0031] Further, the leaf mass value includes a first leaf mass value and a second leaf mass value;

[0032] Set the first leaf quantity and the second leaf quantity to set the corresponding first leaf quantity threshold and second leaf quantity threshold,

[0033] According to the first leaf quantity threshold and the second leaf quantity threshold, a first leaf mass value and a second leaf mass value are obtained, which are marked as M1 and M2 respectively;

[0034] The process of obtaining the first leaf quality value includes:

[0035] ;

[0036] Wherein, M1 represents the mass value of the first leaf, x represents the number of the first leaf, and x' represents the threshold value of the number of the first leaf; Expressed as coefficients;

[0037] The process of obtaining the second leaf quality value includes:

[0038] ;

[0039] Wherein, M2 represents the second leaf mass value, y represents the second leaf quantity, and y' represents the second leaf quantity threshold; Expressed as coefficients;

[0040] Further, comparing the obtained first leaf mass value and the second leaf mass value;

[0041] If M1>M2, the hidden arrow corresponding to the second leaf mass value is automatically closed, and the corresponding leaf is hidden;

[0042] If M1<M2, the hidden arrow corresponding to the first leaf mass value is automatically closed, and the corresponding leaf is hidden;

[0043] If M1=M2, the hidden arrows corresponding to the first leaf mass value and the second leaf mass value are automatically opened to display the corresponding leaves;

[0044] The hidden arrows that need to be closed in the title node communication mind diagram are automatically closed to generate an optimized title node communication mind diagram.

[0045] Furthermore, the process of matching the page search content includes:

[0046] The user enters a keyword, and an optimized title node communication thinking diagram is displayed on the main page of the Internet page according to the keyword. The user clicks on the corresponding related keyword node according to the displayed optimized title node communication thinking diagram to jump to the search content;

[0047] If you need to view hidden related keyword nodes, you can manually open the hidden arrow to view and search.

[0048] Further, including:

[0049] The database building module is used to set up an Internet page search bar, collect keywords in the Internet page search bar, and build a relevant title node database based on the keywords;

[0050] The module for constructing the title node communication thinking diagram is used to process the keywords according to the relevant title node database, and construct the title node communication thinking diagram according to the processing results;

[0051] The optimization module is used to optimize the title node communication thinking diagram, and generate an optimized title node communication thinking diagram according to the optimization result;

[0052] The matching module is used to match the page search content according to the optimized title node communication mind map.

[0053] Compared with the prior art, the present invention has the following beneficial effects:

[0054] 1. Set up an Internet page search bar, collect keywords in the Internet page search bar, and build a relevant title node database based on the keywords; process the keywords based on the relevant title node database, and build a title node communication thinking chart based on the processing results; users can directly search all relevant keyword nodes on the Internet page by entering keywords, and users can directly query the content corresponding to the relevant keyword nodes according to their needs, reducing the search steps and speeding up the search;

[0055] 2. Set a hidden arrow to optimize the title node communication thinking diagram, and generate an optimized title node communication thinking diagram based on the optimization results; match the page search content based on the optimized title node communication thinking diagram; the layout area of ​​existing Internet pages is limited, and several titles cannot be displayed on the main page of the Internet page, so set a hidden arrow to reduce the layout area of ​​the title node communication thinking diagram. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the present invention. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0057] Figure 1 It is a schematic diagram of the present invention. DETAILED DESCRIPTION

[0058] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the present invention. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0059] like Figure 1 As shown, a webpage search content matching method comprises:

[0060] Step 1: Set up an Internet page search bar, collect several keywords in the Internet page search bar, and build a relevant title node database based on the keywords;

[0061] The construction process of the relevant title node database includes:

[0062] Setting the page to an Internet page, wherein the Internet page includes a main page and a secondary page;

[0063] The main page represents the Internet where the keyword is input; the secondary page represents the Internet page obtained according to the main page;

[0064] Label the links displayed on the Internet pages as titles;

[0065] Setting embedding points in all titles of Internet pages to collect keywords of titles of Internet pages, marking keywords of all titles of Internet pages, generating several title nodes, storing several title nodes, and generating a title node database;

[0066] The user enters a keyword in the search bar of an Internet page, collects a number of keywords, sends the keyword to a title node database, matches the title nodes in the title node database, and marks the title nodes identical to the keyword to generate a number of target title nodes; wirelessly connects the target title nodes to generate a first title;

[0067] The first title includes a second title, a third title, ..., a kth title, where k is a natural number greater than 0;

[0068] Collecting a number of related terms in the first title and generating a number of second related keyword nodes, wirelessly connecting the second related keyword nodes to generate a second title;

[0069] The related terms are represented by searching the first title according to the keyword, viewing the first title, obtaining the search content of the first title, and obtaining the searchable keywords according to the search content;

[0070] Similarly, several related terms in the second title are collected, and several related third related keyword nodes are generated, and several third related keyword nodes are connected to generate the third title, and so on, to obtain the fourth title, the fifth title, ..., the kth title;

[0071] Link the second title, the third title, ..., the kth title, and construct a related title node database for storage;

[0072] It should be further explained that, in the specific implementation process, several target title nodes in the first title are wirelessly connected to several second related keyword nodes in the second title, and then the second related keyword node in the second title is wirelessly connected to the third related keyword node in the third title, and so on, the (k-1) related keyword node in the (k-1)th title is wirelessly connected to the kth related keyword node in the kth title, and then the first title, the second title, the third title, ..., the kth title are connected to build a related title node database;

[0073] It needs to be further explained that, in the specific implementation process, the Internet page generates a large amount of relevant information data according to the keywords input by the user. The user needs to search the Internet page continuously according to the needs, and then search for the required information data of the Internet page. However, after a large number of searches, a lot of user time will be wasted, and the relevant information data contained in the main page cannot be directly queried. Build a relevant title node database, connect all relevant title nodes of user needs through keywords, and the user can directly search all relevant title nodes of the Internet page by entering keywords. The user directly queries the content corresponding to the relevant title nodes according to the needs, which reduces the search steps and speeds up the search.

[0074] Step 2: Process the keywords according to the relevant keyword title node data model, and build a title node communication thinking diagram based on the processing results;

[0075] Setting a data tree, the data tree comprising a root, branches, subbranches and leaves; the root is connected to the branches, the branches are connected to the leaves, and the leaves are connected to each other by the branches;

[0076] The keyword is set as the root of a data tree; the data tree includes a root, branches, branches and leaves; the root is connected to the branches, the branches are connected to the leaves, and the leaves are connected to each other by branches; several target title nodes in the first title are generated as leaves connected to the root by branches;

[0077] The keyword is set as the root of the data tree; several target title nodes in the first title are generated into several target title node leaves connected to the root by branches;

[0078] According to the semantics of the keywords, the actual meaning of the keywords is obtained. According to the actual meaning of the keywords, synonyms of the actual meaning are obtained, and the synonyms are sent to the relevant title node database for matching. The target title nodes that are the same as the synonyms are obtained and marked as synonym title nodes. The synonym title nodes are generated into synonym node leaves, and the leaves are connected by branches to the corresponding target title node leaves; the connected branches are generated into synonym branches.

[0079] Then, according to the function, meaning, application, scope and realization of the keywords, the target title node in the relevant title node database is obtained, and the function node leaves, meaning node leaves, application node leaves, scope node leaves and realization node leaves are generated accordingly, the function branches, meaning branches, application branches, scope branches and realization branches are generated corresponding to the connected branches, and the target title node leaves are connected accordingly;

[0080] Connect keywords, several target title node leaves and several leaves to construct a title node communication thinking diagram;

[0081] It needs to be further explained that, in the specific implementation process, the titles related to the keywords are classified and processed according to the keywords, and the classification results are processed according to the idea of ​​mind mapping. According to the processing results, the title node communication thinking icon is constructed. The title node communication thinking icon is interconnected to increase the relevant data of the keywords and make the relevant data clear.

[0082] Step 3: Optimize the title node communication thinking diagram, and generate an optimized title node communication thinking diagram according to the optimization results;

[0083] Setting hidden arrows on the branches and sub-branches of the title node communication mind map, wherein the hidden arrows are used to hide the leaves connected to the corresponding branches and sub-branches;

[0084] Obtain the number of leaves connected to each branch and each sub-branch, and generate a first number of leaves and a second number of leaves, based on the first number of leaves and the second number of leaves;

[0085] Setting a threshold value for the number of leaves, and comparing the first number of leaves or the second number of leaves according to the threshold value for the number of leaves;

[0086] If the first leaf quantity or the second leaf quantity is less than the leaf quantity threshold, the corresponding hidden arrow is automatically opened;

[0087] If the number of the first leaves or the number of the second leaves is greater than the threshold value of the number of leaves, the corresponding hidden arrow is automatically closed, and the corresponding leaves are hidden, and the user needs to open them manually;

[0088] If the first leaf quantity or the second leaf quantity is equal to the leaf quantity threshold, the first leaf quantity and the second leaf quantity are marked, and then the leaf quality value is obtained, and the obtaining process includes:

[0089] The leaf mass value includes a first leaf mass value and a second leaf mass value;

[0090] Set the first leaf quantity and the second leaf quantity to set the corresponding first leaf quantity threshold and second leaf quantity threshold,

[0091] The process of obtaining the first leaf quality value includes:

[0092] ;

[0093] Wherein, M1 represents the mass value of the first leaf, x represents the number of the first leaf, and x' represents the threshold value of the number of the first leaf; Expressed as coefficients;

[0094] The process of obtaining the second leaf quality value includes:

[0095] ;

[0096] Wherein, M2 represents the second leaf mass value, y represents the second leaf quantity, and y' represents the second leaf quantity threshold; Expressed as coefficients;

[0097] comparing the obtained first leaf mass value and second leaf mass value;

[0098] If M1>M2, the hidden arrow of the branch setting corresponding to the second leaf quality value is automatically closed, and the corresponding leaf is hidden;

[0099] If M1<M2, the hidden arrow set for the branch corresponding to the first leaf mass value is automatically closed, and the corresponding leaf is hidden;

[0100] If M1=M2, the hidden arrows set on the branches corresponding to the first leaf mass value and the second leaf mass value are automatically opened to display the corresponding leaves;

[0101] Automatically close the hidden arrows that need to be closed in the title node communication mind map to generate an optimized title node communication mind map;

[0102] It should be further explained that, in the specific implementation process, hidden arrows are set to simplify the huge title node communication thinking diagram. When the user enters keywords to query the information of the Internet page, the user can clearly query several related titles contained in the main page content of the Internet page. When the user needs to query the keywords contained in the main page content of the Internet page, the user does not need to re-enter the keywords for search. However, the layout area of ​​the main page of the existing Internet page is limited, and several titles cannot be displayed on the main page of the Internet page. Therefore, a hidden arrow is set to reduce the layout area of ​​the title node communication thinking diagram.

[0103] Step 4: Match the page search content according to the optimized title node communication thinking diagram;

[0104] The user enters a keyword, and an optimized title node communication thinking diagram is displayed on the main page of the Internet page based on the keyword. The user clicks on the corresponding title node based on the displayed optimized title node communication thinking diagram to jump to the search content.

[0105] If you need to view hidden related keyword nodes, you can manually open the hidden arrow to view and search.

[0106] It should be further explained that, in the specific implementation process, the user only needs to enter a keyword to directly search for several titles related to the keyword, which reduces the complexity of the search, saves search time, and improves search efficiency.

[0107] Based on the above web page search content matching method, the present invention also provides a web page search content matching system, including:

[0108] The database building module is used to set up an Internet page search bar, collect keywords in the Internet page search bar, and build a relevant title node database based on the keywords;

[0109] The module for constructing the title node communication thinking diagram is used to process the keywords according to the relevant title node database, and construct the title node communication thinking diagram according to the processing results;

[0110] The optimization module is used to optimize the title node communication thinking diagram, and generate an optimized title node communication thinking diagram according to the optimization result;

[0111] The matching module is used to match the page search content according to the optimized title node communication mind map.

[0112] Working principle: set up an Internet page search bar, collect keywords in the Internet page search bar, and build a relevant title node database based on the keywords; process the keywords based on the relevant title node database, and build a title node communication thinking diagram based on the processing results; optimize the title node communication thinking diagram, and generate an optimized title node communication thinking diagram based on the optimization results; match the page search content based on the optimized title node communication thinking diagram; the present invention solves the search complexity and cumbersome steps.

[0113] The features and exemplary embodiments of various aspects of the present application are described in detail above. In order to make the purpose, technical solutions and advantages of the present application clearer, the present application is further described in detail in combination with the drawings and specific embodiments. It should be understood that the specific embodiments described herein are only intended to explain the present application rather than to limit the present application. For those skilled in the art, the present application can be implemented without some of these specific details. The above description of the embodiments is merely to provide a better understanding of the present application by showing examples of the present application.

[0114] The above embodiments are only used to illustrate the technical method of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical method of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical method of the present invention.

Claims

1. A webpage search content matching method, characterized in that: The method comprises: Step 1: Set up an Internet page search bar, collect keywords in the Internet page search bar, and build a relevant title node database based on the keywords; Step 2: Process the keywords according to the relevant title node database, and build a title node communication thinking diagram based on the processing results; Step 3: Optimize the title node communication thinking diagram, and generate an optimized title node communication thinking diagram according to the optimization results; Step 4: Match the page search content according to the optimized title node communication thinking diagram; The construction process of the relevant title node database includes: Setting the page to an Internet page, wherein the Internet page includes a main page and a secondary page; Marking the links displayed on the Internet page as titles; setting embedding points in all titles of the Internet page to collect keywords of the titles of the Internet page, marking the keywords of all titles of the Internet page, generating a number of title nodes, storing the several title nodes, and generating a title node database; Sending keywords collected in the search bar of an Internet page to a title node database, matching title nodes in the title node database, marking title nodes identical to the keywords, generating a plurality of target title nodes, connecting the plurality of target title nodes, and generating a first title; Mark the first title as the main page content; click the first title to obtain several keywords in the main page content corresponding to the first title, and generate several related keyword nodes accordingly, and connect the several related keyword nodes to generate the second title; Similarly, obtain the second title, the third title, ..., the kth title, where k is a natural number greater than 0; Link the second title, the third title, ..., the kth title, and construct a related title node database for storage; The process of constructing the title node communication mind map includes: Setting a data tree, the data tree comprising a root, branches, subbranches and leaves; the root is connected to the branches, the branches are connected to the leaves, and the leaves are connected to each other by the branches; The keyword in the page search bar is set as the root of the data tree; a plurality of target title nodes in the first title are generated into a plurality of target title node leaves connected to the root by branches; According to the semantics of the keywords in the page search bar, the actual meaning of the keywords in the page search bar is obtained; according to the actual meaning of the keywords in the page search bar, the synonyms of the actual meaning are obtained, the synonyms are sent to the relevant title node database for matching, the relevant keyword nodes identical to the synonyms are obtained, and are marked as synonym title nodes, the synonym title nodes are generated into synonym node leaves, and the leaves of the synonym node are connected to the corresponding target title node leaves by branches; the connected branches are generated into synonym branches; Furthermore, according to the function, meaning, application, scope and implementation of the keywords in the page search bar, the corresponding relevant keyword nodes in the relevant title node database are obtained, and the function node leaves, meaning node leaves, application node leaves, scope node leaves and implementation node leaves are generated accordingly, the function branches, meaning branches, application branches, scope branches and implementation branches are generated corresponding to the connected branches, and the target title node leaves are connected accordingly; Connect keywords, several target title node leaves and several leaves using branches and twigs to construct a title node communication mind map; The generation process of the optimized title node communication mind map includes: Setting hidden arrows on the branches and sub-branches of the title node communication mind map, wherein the hidden arrows are used to hide the leaves connected to the corresponding branches and sub-branches; Get the number of leaves connected to each branch and each sub-branch, and generate the first number of leaves and the second number of leaves; Setting a threshold value for the number of leaves, and comparing the first number of leaves or the second number of leaves according to the threshold value for the number of leaves; If the first leaf quantity or the second leaf quantity is less than the leaf quantity threshold, the corresponding hidden arrow is automatically opened; If the number of the first leaves or the number of the second leaves is greater than the threshold value of the number of leaves, the corresponding hiding arrow is automatically closed to hide the corresponding leaves; If the first leaf quantity or the second leaf quantity is equal to the leaf quantity threshold, marking the first leaf quantity and the second leaf quantity, and then obtaining the leaf quality value; The leaf mass value includes a first leaf mass value and a second leaf mass value; Set the first leaf quantity and the second leaf quantity to set the corresponding first leaf quantity threshold and second leaf quantity threshold, According to the first leaf quantity threshold and the second leaf quantity threshold, a first leaf quality value and a second leaf quality value are obtained, which are marked as M1 and M2 respectively, wherein: ； ； Wherein, x represents the number of first leaves, and x' represents the threshold value of the number of first leaves; It is represented as a coefficient, y is represented as the number of second leaves, and y' is represented as the threshold value of the number of second leaves; Expressed as coefficients; comparing the obtained first leaf mass value and second leaf mass value; If M1>M2, the hidden arrow corresponding to the second leaf mass value is automatically closed, and the corresponding leaf is hidden; If M1<M2, the hidden arrow corresponding to the first leaf mass value is automatically closed, and the corresponding leaf is hidden; If M1=M2, the hidden arrows corresponding to the first leaf mass value and the second leaf mass value are automatically opened to display the corresponding leaves; Automatically close the hidden arrows that need to be closed in the title node communication mind map to generate an optimized title node communication mind map; The process of matching page search content includes: The user enters a keyword, and an optimized title node communication thinking diagram is displayed on the main page of the Internet page according to the keyword. The user clicks on the corresponding related keyword node according to the displayed optimized title node communication thinking diagram to jump to the search content; When you need to view hidden related keyword nodes, you can manually open the hidden arrow to view and search.

2. A webpage search content matching system for implementing the webpage search content matching system of claim 1, characterized in that: include: The database building module is used to set up an Internet page search bar, collect keywords in the Internet page search bar, and build a relevant title node database based on the keywords; The module for constructing the title node communication thinking diagram is used to process the keywords according to the relevant title node database, and construct the title node communication thinking diagram according to the processing results; The optimization module is used to optimize the title node communication thinking diagram, and generate an optimized title node communication thinking diagram according to the optimization result; The matching module is used to match the page search content according to the optimized title node communication mind map.

Images