CN105335456B - A kind of association priority ordering method for legislations of environmental protection retrieval - Google Patents
A kind of association priority ordering method for legislations of environmental protection retrieval Download PDFInfo
- Publication number
- CN105335456B CN105335456B CN201510610831.5A CN201510610831A CN105335456B CN 105335456 B CN105335456 B CN 105335456B CN 201510610831 A CN201510610831 A CN 201510610831A CN 105335456 B CN105335456 B CN 105335456B
- Authority
- CN
- China
- Prior art keywords
- word
- key table
- candidate
- dyj
- dix
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/334—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
Abstract
The present invention relates to a kind of association priority ordering methods for legislations of environmental protection retrieval, belong to Knowledge Discovery field.The present invention builds antistop list, a key table to environmentally friendly laws and regulations searching system first；Then data input by user are cleaned and refine candidate word；Finally according to the number of candidate word, distance and output of sorting are calculated.Huge information source is refined into an antistop list by the present invention by the way of index, as the directory index of entire information source, as long as just can quickly find significant information in huge information source with index matching inquiry, further increases recall precision；Using the distance between each independent Chinese character in entire keywords database is calculated, its distance value is stored in key table, therefore just only need the element for looking for distance value minimum that can find the very high word or phrase of the degree of association when match query；While improving recall precision, the accuracy of the degree of association between retrieval result and search intention is also improved.
Description
Technical field
The present invention relates to a kind of association priority ordering methods for legislations of environmental protection retrieval, belong to Knowledge Discovery neck
Domain.
Background technology
Information explosion is a big feature of current information-intensive society, scans for that bulk redundancy can be inquired from web cumbersome
Information needs us that screening is gone to obtain the information that we want one by one again.It how to be thus quickly found out a kind of method, gives user
The more succinct more meaningful information that shows becomes a crucial problem.Therefore, to solve this problem, knowledge is proposed
It was found that Knowledge Discovery is that effective, novel, potentially useful is identified from data set, and final intelligible pattern
Non-trivial process.Purpose be to user shield initial data nitty-gritty details, extracted from initial data it is significant,
Succinct knowledge is directly reported to user.In order to provide more meaningful information to user, this method is suggested, it
By the distance between calculating elements and element, the i.e. degree of association, the information that search is thought with user is searched out in a manner of most fast
The optimal word combination of distance, then manipulative indexing catalogue quick and precisely find out more meaningful information, i.e., needed for user
Want information.
Invention content
The present invention provides a kind of association priority ordering methods for legislations of environmental protection retrieval, quick for solving
The problem of searching information required for user.
The technical scheme is that：A kind of association priority ordering method for legislations of environmental protection retrieval is right first
Environmentally friendly laws and regulations searching system builds an antistop list A, key table B；Then data input by user are cleaned and are refined
Candidate word；Finally according to the number of candidate word, distance and output of sorting are calculated.
The association priority ordering method for legislations of environmental protection retrieval is as follows：
Step1, system model is initially set up：
One antistop list A, key table B are built to environmentally friendly laws and regulations searching system；Wherein, antistop list A：Storage
The t group keywords extracted in regulation title and regulation；Key table B：Each keyword in antistop list A is store to tear open
Characteristic value Aij between different word m be divided into and each word；Aij indicates that footmark is the combinatorics on words appearance representated by i and j
Frequency in antistop list A, footmark i, j are each keyword is split into antistop list A different words in key table B
Label；
Step2, cleaning data input by user simultaneously refine candidate word：
Stop words is segmented and removed for data input by user, regard remaining participle as candidate word；
Step3, the number according to candidate word calculate distance and output of sorting：
If Step3.1, candidate word number are 1：
From the characteristic value Aix obtained in key table B between the word being coupled with the lead-in x of candidate word, lead-in x, obtain tail
Characteristic value Ayj between word y, the word being coupled with tail word y；Calculate in the case of Aix ≠ 0 lead-in in key table B at a distance from word
Dix and the corresponding word combinations of ixy are obtained, calculate the situation lower tail words of Ayj ≠ 0 and word distance dyj in key table B and obtained
The corresponding word combinations of xyj；According to dix, dyj from small to large be ranked sequentially its corresponding word combination；According to the sequence of word combination,
Word combination and the keyword in antistop list A are subjected to the corresponding regulation title of matching acquisitions, by the removal repetition of matched result
It shows in sequence afterwards；Wherein, when there is dix=dyj, then the corresponding word combination of dix, dyj carries out randomly ordered；
If Step3.2, candidate word number are not 1：
Multiple candidate words are arranged by input sequence, calculate separately the tail of the candidate word first inputted in two neighboring candidate word
The word combination that word u is constituted with the lead-in v distances duv of candidate word and corresponding two candidate words that input afterwards；From key table B
The middle characteristic value Aix obtained between the word being coupled with the lead-in x of each candidate word, lead-in x, it obtains tail word y, be coupled with tail word y
Word between characteristic value Ayj；It calculates in the case of Aix ≠ 0 lead-in and word distance dix in key table B and to obtain ixy corresponding
Word combination, calculate the situation lower tail words of Ayj ≠ 0 and word distance dyj in key table B and obtain the corresponding word combinations of xyj；Root
According to duv, dix, dyj from small to large be ranked sequentially its corresponding word combination；According to the sequence of word combination, by word combination and key
Keyword in vocabulary A carries out matching and obtains corresponding regulation title, is shown in sequence after the removal of matched result is repeated；
Wherein, when there is duv=dix=dyj, then only retain the corresponding word combinations of duv and be ranked up, when there is dix=dyj, then
The corresponding word combination of dix, dyj carries out randomly ordered；
Described u, v, x, y are label of the word in key table B.
It is describedWherein Auv, Aix, Ayj indicate footmark respectively
For the combinatorics on words representated by u, v, the combinatorics on words representated by footmark i, x, the combinatorics on words representated by footmark y, j occurs
Frequency in antistop list A；Duv, dix, dyj indicate footmark for the word representated by u, v, representated by footmark i, x respectively
Word, the distance of the word representated by footmark y, j.
The beneficial effects of the invention are as follows：
By the way of index, huge information source is refined into an antistop list, the catalogue as entire information source
Index.Therefore, as long as just can quickly find significant information in huge information source with index matching inquiry, further
Improve recall precision.
Using the distance between each independent Chinese character in entire keywords database is calculated, its distance value is stored in key table
In.Therefore just only need the element for looking for distance value minimum that can find the very high word of the degree of association when match query
Or phrase.While improving recall precision, the accuracy of the degree of association between retrieval result and search intention is also improved.
Description of the drawings
Fig. 1 distance webs shape schematic diagrames between element of the present invention；
Fig. 2 distance webs shape example schematics between element of the present invention.
Specific implementation mode
Embodiment 1：As shown in Figs. 1-2, a kind of association priority ordering method for legislations of environmental protection retrieval is right first
Environmentally friendly laws and regulations searching system builds an antistop list A, key table B；Then data input by user are cleaned and are refined
Candidate word；Finally according to the number of candidate word, distance and output of sorting are calculated.
The association priority ordering method for legislations of environmental protection retrieval is as follows：
Step1, system model is initially set up：
One antistop list A, key table B are built to environmentally friendly laws and regulations searching system；Wherein, antistop list A：Storage
The t group keywords extracted in regulation title and regulation；Key table B：Each keyword in antistop list A is store to tear open
Characteristic value Aij between different word m be divided into and each word；Aij indicates that footmark is the combinatorics on words appearance representated by i and j
Frequency in antistop list A, footmark i, j are each keyword is split into antistop list A different words in key table B
Label；
Step2, cleaning data input by user simultaneously refine candidate word：
Stop words is segmented and removed for data input by user, regard remaining participle as candidate word；
Step3, the number according to candidate word calculate distance and output of sorting：
If Step3.1, candidate word number are 1：
From the characteristic value Aix obtained in key table B between the word being coupled with the lead-in x of candidate word, lead-in x, obtain tail
Characteristic value Ayj between word y, the word being coupled with tail word y；Calculate in the case of Aix ≠ 0 lead-in in key table B at a distance from word
Dix and the corresponding word combinations of ixy are obtained, calculate the situation lower tail words of Ayj ≠ 0 and word distance dyj in key table B and obtained
The corresponding word combinations of xyj；According to dix, dyj from small to large be ranked sequentially its corresponding word combination；According to the sequence of word combination,
Word combination and the keyword in antistop list A are subjected to the corresponding regulation title of matching acquisitions, by the removal repetition of matched result
It shows in sequence afterwards；Wherein, when there is dix=dyj, then the corresponding word combination of dix, dyj carries out randomly ordered；
If Step3.2, candidate word number are not 1：
Multiple candidate words are arranged by input sequence, calculate separately the tail of the candidate word first inputted in two neighboring candidate word
The word combination that word u is constituted with the lead-in v distances duv of candidate word and corresponding two candidate words that input afterwards；From key table B
The middle characteristic value Aix obtained between the word being coupled with the lead-in x of each candidate word, lead-in x, it obtains tail word y, be coupled with tail word y
Word between characteristic value Ayj；It calculates in the case of Aix ≠ 0 lead-in and word distance dix in key table B and to obtain ixy corresponding
Word combination, calculate the situation lower tail words of Ayj ≠ 0 and word distance dyj in key table B and obtain the corresponding word combinations of xyj；Root
According to duv, dix, dyj from small to large be ranked sequentially its corresponding word combination；According to the sequence of word combination, by word combination and key
Keyword in vocabulary A carries out matching and obtains corresponding regulation title, is shown in sequence after the removal of matched result is repeated；
Wherein, when there is duv=dix=dyj, then only retain the corresponding word combinations of duv and be ranked up, when there is dix=dyj, then
The corresponding word combination of dix, dyj carries out randomly ordered；
Described u, v, x, y are label of the word in key table B.
It is describedWherein Auv, Aix, Ayj indicate footmark respectively
For the combinatorics on words representated by u, v, the combinatorics on words representated by footmark i, x, the combinatorics on words representated by footmark y, j occurs
Frequency in antistop list A；Duv, dix, dyj indicate footmark for the word representated by u, v, representated by footmark i, x respectively
Word, the distance of the word representated by footmark y, j.
Embodiment 2：As shown in Figs. 1-2, a kind of association priority ordering method for legislations of environmental protection retrieval is right first
Environmentally friendly laws and regulations searching system builds an antistop list A, key table B；Then data input by user are cleaned and are refined
Candidate word；Finally according to the number of candidate word, distance and output of sorting are calculated.
The association priority ordering method for legislations of environmental protection retrieval is as follows：
Step1, system model is initially set up：
One antistop list A, key table B are built to environmentally friendly laws and regulations searching system；Wherein, antistop list A：Storage
The t group keywords extracted in regulation title and regulation；Key table B：Each keyword in antistop list A is store to tear open
Characteristic value Aij between different word m be divided into and each word；Aij indicates that footmark is the combinatorics on words appearance representated by i and j
Frequency in antistop list A, footmark i, j are each keyword is split into antistop list A different words in key table B
Label；
Step2, cleaning data input by user simultaneously refine candidate word：
Stop words is segmented and removed for data input by user, regard remaining participle as candidate word；
Step3, the number according to candidate word calculate distance and output of sorting：
If Step3.1, candidate word number are 1：
From the characteristic value Aix obtained in key table B between the word being coupled with the lead-in x of candidate word, lead-in x, obtain tail
Characteristic value Ayj between word y, the word being coupled with tail word y；Calculate in the case of Aix ≠ 0 lead-in in key table B at a distance from word
Dix and the corresponding word combinations of ixy are obtained, calculate the situation lower tail words of Ayj ≠ 0 and word distance dyj in key table B and obtained
The corresponding word combinations of xyj；According to dix, dyj from small to large be ranked sequentially its corresponding word combination；According to the sequence of word combination,
Word combination and the keyword in antistop list A are subjected to the corresponding regulation title of matching acquisitions, by the removal repetition of matched result
It shows in sequence afterwards；Wherein, when there is dix=dyj, then the corresponding word combination of dix, dyj carries out randomly ordered；
If Step3.2, candidate word number are not 1：
Multiple candidate words are arranged by input sequence, calculate separately the tail of the candidate word first inputted in two neighboring candidate word
The word combination that word u is constituted with the lead-in v distances duv of candidate word and corresponding two candidate words that input afterwards；From key table B
The middle characteristic value Aix obtained between the word being coupled with the lead-in x of each candidate word, lead-in x, it obtains tail word y, be coupled with tail word y
Word between characteristic value Ayj；It calculates in the case of Aix ≠ 0 lead-in and word distance dix in key table B and to obtain ixy corresponding
Word combination, calculate the situation lower tail words of Ayj ≠ 0 and word distance dyj in key table B and obtain the corresponding word combinations of xyj；Root
According to duv, dix, dyj from small to large be ranked sequentially its corresponding word combination；According to the sequence of word combination, by word combination and key
Keyword in vocabulary A carries out matching and obtains corresponding regulation title, is shown in sequence after the removal of matched result is repeated；
Wherein, when there is duv=dix=dyj, then only retain the corresponding word combinations of duv and be ranked up, when there is dix=dyj, then
The corresponding word combination of dix, dyj carries out randomly ordered；
Described u, v, x, y are label of the word in key table B.
Embodiment 3：As shown in Figs. 1-2, a kind of association priority ordering method for legislations of environmental protection retrieval is right first
Environmentally friendly laws and regulations searching system builds an antistop list A, key table B；Then data input by user are cleaned and are refined
Candidate word；Finally according to the number of candidate word, distance and output of sorting are calculated.
Embodiment 4：As shown in Figs. 1-2, a kind of association priority ordering method for legislations of environmental protection retrieval is right first
Environmentally friendly laws and regulations searching system builds an antistop list A, key table B；Then data input by user are cleaned and are refined
Candidate word；Finally according to the number of candidate word, distance and output of sorting are calculated.
The method is as follows：
One antistop list A, key table B are built to environmentally friendly laws and regulations searching system；Wherein, antistop list A：Storage
The t group keywords extracted in regulation title and regulation；Key table B：Each keyword in antistop list A is store to tear open
Characteristic value Aij between different word m be divided into and each word；Aij indicates that footmark is the combinatorics on words appearance representated by i and j
Frequency in antistop list A, footmark i, j are each keyword is split into antistop list A different words in key table B
Label；
Table A-antistop list
Key table B：Store each keyword is split into antistop list A different words (being referred to as element) m and
Characteristic value Aij, Aij between each element indicate that footmark appears in for the combinatorics on words representated by i and j in antistop list A
Frequency.
Table B- key tables
From Table A, it can be seen that t=40；From table B, it is known that, i=j=1,2 ..., 40.
Step2, data are cleaned and refine candidate word：
The essence of inquiry is exactly the matching to word phrase or inquiry, then needing to obtain can indicate that substituting user inquires meaning
The word or phrase of figure, for convenience of indicating, we term it candidate words.
Step2.1, assume that user inputs " pollution ", then：
Data input by user are cleaned, is segmented and is removed stop words, extract candidate word；Extract candidate
Candidate word of word --- " pollution ".
Step3, judge candidate word type and calculate distance and output of sorting：
Candidate word number is judged for one, then calculates the lead-in and tail word and each word in key table of candidate word " pollution "
Distance；Key table is read, is apparent from：The word being coupled with lead-in " dirt " and the characteristic value between it are as follows：A12=3, A22=1,
A32=1, A52=3, A62=1, A72=1, A82=3；The word being coupled with tail word " dye " and the characteristic value between it are as follows：A94
=2, A95=6, A96=6；Herein, bind mode is：It is combined with the connection of the lead-in of word if finding, then finding shape is
The combination of " * *+lead-in ", is combined if finding with the connection of the tail word of word, then finds the combination that shape is " tail word+* * ", hereafter
It repeats no more；
Then in this example the first character of the word be at a distance from word in key table：
Claims (2)
1. a kind of association priority ordering method for legislations of environmental protection retrieval, it is characterised in that：First to environmental law law
It advises searching system and builds an antistop list A, key table B；Then data input by user are cleaned and refine candidate word；Finally
According to the number of candidate word, distance and output of sorting are calculated；
The association priority ordering method for legislations of environmental protection retrieval is as follows：
S1, system model is initially set up：
One antistop list A, key table B are built to environmentally friendly laws and regulations searching system；Wherein, antistop list A：Store method
The t group keywords extracted in rule title and regulation；Key table B：Each keyword in antistop list A is store to split into
Different word m and each word between characteristic value Aij；Aij indicates that footmark appears in pass for the combinatorics on words representated by i and j
Frequency in keyword Table A, footmark i, j are the mark of each keyword is split into antistop list A different words in key table B
Note；
S2, cleaning data input by user simultaneously refine candidate word：
Stop words is segmented and removed for data input by user, regard remaining participle as candidate word；
S3, the number according to candidate word calculate distance and output of sorting：
If S3.1, candidate word number are 1：
From obtained in key table B the word being coupled with the lead-in x of candidate word, the characteristic value Aix between lead-in x, acquisition tail word y,
Characteristic value Ayj between the word being coupled with tail word y；Calculate in the case of Aix ≠ 0 lead-in and word distance dix in key table B and
It obtains the corresponding word combinations of ixy, calculates the situation lower tail words of Ayj ≠ 0 and word distance dyj in key table B and to obtain xyj corresponding
Word combination；According to dix, dyj from small to large be ranked sequentially its corresponding word combination；According to the sequence of word combination, by phrase
Close and carry out the corresponding regulation title of matching acquisitions with the keyword in antistop list A, by matched result remove after repetition according to
Sequence is shown；Wherein, when there is dix=dyj, then the corresponding word combination of dix, dyj carries out randomly ordered；
If S3.2, candidate word number are not 1：
Multiple candidate words are arranged by input sequence, calculate separately the tail word u of the candidate word first inputted in two neighboring candidate word
The word combination constituted with the lead-in v distances duv of the candidate word of rear input and corresponding two candidate words；From key table B
It obtains the word being coupled with the lead-in x of each candidate word, the characteristic value Aix between lead-in x, acquisition tail word y, be coupled with tail word y
Characteristic value Ayj between word；It calculates in the case of Aix ≠ 0 lead-in and word distance dix in key table B and to obtain ixy corresponding
Word combination calculates the situation lower tail words of Ayj ≠ 0 and word distance dyj in key table B and obtains the corresponding word combinations of xyj；According to
Duv, dix, dyj from small to large be ranked sequentially its corresponding word combination；According to the sequence of word combination, by word combination and keyword
Keyword in Table A carries out matching and obtains corresponding regulation title, is shown in sequence after the removal of matched result is repeated；Its
In, when there is duv=dix=dyj, then only retains the corresponding word combinations of duv and be ranked up, when there is dix=dyj, then
The corresponding word combination of dix, dyj carries out randomly ordered；
Described u, v, x, y are label of the word in key table B.
2. the association priority ordering method according to claim 1 for legislations of environmental protection retrieval, it is characterised in that：Institute
It statesWherein Auv, Aix, Ayj indicate footmark for u, v institute's generation respectively
The combinatorics on words of table, the combinatorics on words representated by footmark i, x, the combinatorics on words representated by footmark y, j appear in keyword
Frequency in Table A；Duv, dix, dyj indicate that footmark is the word representated by u, v respectively, the word representated by footmark i, x, and footmark is
Y, the distance of the word representated by j.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510610831.5A CN105335456B (en) | 2015-09-23 | 2015-09-23 | A kind of association priority ordering method for legislations of environmental protection retrieval |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510610831.5A CN105335456B (en) | 2015-09-23 | 2015-09-23 | A kind of association priority ordering method for legislations of environmental protection retrieval |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105335456A CN105335456A (en) | 2016-02-17 |
| CN105335456B true CN105335456B (en) | 2018-10-23 |
Family
ID=55285983
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510610831.5A Active CN105335456B (en) | 2015-09-23 | 2015-09-23 | A kind of association priority ordering method for legislations of environmental protection retrieval |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105335456B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106547817B (en) * | 2016-09-28 | 2019-11-08 | 昆明理工大学 | A kind of querying method for environmental law regulation |
| CN112559696A (en) * | 2019-09-25 | 2021-03-26 | 北京国双科技有限公司 | Legal and legal rule searching method and device |
| CN113177106B (en) * | 2021-05-19 | 2024-04-12 | 苏州黑云智能科技有限公司 | Similar decision book retrieval method based on element extraction |
| CN113570791B (en) * | 2021-08-23 | 2022-04-19 | 安徽兴日智能科技有限公司 | Clothes washing system and method based on Internet of things and commercial application |
| CN115391495B (en) * | 2022-10-28 | 2023-01-24 | 强企宝典(山东)信息科技有限公司 | Method, device and equipment for searching keywords in Chinese context |
| CN116578677B (en) * | 2023-07-14 | 2023-09-15 | 高密市中医院 | Retrieval system and method for medical examination information |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6591261B1 (en) * | 1999-06-21 | 2003-07-08 | Zerx, Llc | Network search engine and navigation tool and method of determining search results in accordance with search criteria and/or associated sites |
| CN100437571C (en) * | 2003-04-25 | 2008-11-26 | 汤姆森环球资源公司 | Distributed search methods, architectures, systems, and software |
| CN101840398A (en) * | 2009-03-19 | 2010-09-22 | 齐雷 | Computer classification and use inquiry method of law and regulation provisions |
| CN102654880A (en) * | 2011-03-04 | 2012-09-05 | 林锋梅 | Computer-based laws and regulations clauses classification and quick query method |
| CN102156712A (en) * | 2011-03-08 | 2011-08-17 | 国网信息通信有限公司 | Power information retrieval method and power information retrieval system based on cloud storage |
| CN104156435A (en) * | 2014-05-30 | 2014-11-19 | 中国石油化工股份有限公司 | Method for rapidly finding HSE laws and regulations from database |
-
2015
- 2015-09-23 CN CN201510610831.5A patent/CN105335456B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN105335456A (en) | 2016-02-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105335456B (en) | A kind of association priority ordering method for legislations of environmental protection retrieval | |
| CN103593410B (en) | System for search recommendation by means of replacing conceptual terms | |
| CN102419778B (en) | Information searching method for discovering and clustering sub-topics of query statement | |
| CN104933152A (en) | Named entity recognition method and device | |
| CN103425687A (en) | Retrieval method and system based on queries | |
| CN102456016B (en) | Method and device for sequencing search results | |
| CN101794307A (en) | Vehicle navigation POI (Point of Interest) search engine based on internetwork word segmentation idea | |
| CN107291895B (en) | Quick hierarchical document query method | |
| CN103714149A (en) | Self-adaptive incremental deep web data source discovery method | |
| CN110765761A (en) | Contract sensitive word checking method and device based on artificial intelligence and storage medium | |
| CN106227788A (en) | Database query method based on Lucene | |
| CN108846016A (en) | A kind of searching algorithm towards Chinese word segmentation | |
| CN103699647B (en) | Character string dictionary indexing method and system | |
| CN105589894B (en) | Document index establishing method and device and document retrieval method and device | |
| CN103955514A (en) | Image feature indexing method based on Lucene inverted index | |
| CN105550169A (en) | Method and device for identifying point of interest names based on character length | |
| CN109165331A (en) | A kind of index establishing method and its querying method and device of English place name | |
| CN101256594A (en) | Method and system for measuring graph structure similarity | |
| CN102915381B (en) | Visual network retrieval based on multi-dimensional semantic presents system and presents control method | |
| CN106649879A (en) | Method for intelligent recommendation of professional book in library | |
| CN103646035A (en) | Information search method based on heuristic method | |
| US20090192987A1 (en) | Searching navigational pages in an intranet | |
| CN105956203A (en) | Information storage method, information query method and search engine device | |
| Guisado-Gámez et al. | Massive query expansion by exploiting graph knowledge bases for image retrieval | |
| CN102521418A (en) | Pinyin storage structure and pinyin input method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |