A Text Search Method Based on Flat Algorithm
A flattening, algorithmic technology, applied in the field of text search based on flattening algorithms, can solve problems such as
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0108] A text search method based on a flattening algorithm, the method includes the following steps:
[0109] 1) Obtain a text summary to form a document set D;
[0110] 2) segment the documents in the document set D, d i (d i ∈D), to obtain the set of sentences
[0111] 3) Set of sentences Perform word segmentation and obtain word sets
[0112] 4) Calculate the word set any two words in The number of co-occurrences between f c ;
[0113] 5) with the word W k is a node, the number of co-occurrences f c For edges, construct an undirected weighted graph, such as Figure 6 shown;
[0114] 6) According to the keyword set K={k submitted by the user i |i=1,2,3...n}, determine the association relationship of any set of keywords in the undirected weighted graph;
[0115] 7) Calculate and restore the path between words with a flat algorithm, and present the relationship in the form of a picture.
[0116] When performing step 6), expand the search in the followin...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


