CN104765833B - A kind of generation method and device of word association table - Google Patents

A kind of generation method and device of word association table Download PDF

Info

Publication number
CN104765833B
CN104765833B CN201510174138.8A CN201510174138A CN104765833B CN 104765833 B CN104765833 B CN 104765833B CN 201510174138 A CN201510174138 A CN 201510174138A CN 104765833 B CN104765833 B CN 104765833B
Authority
CN
China
Prior art keywords
word
data
words
mark
association table
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.)
Expired - Fee Related
Application number
CN201510174138.8A
Other languages
Chinese (zh)
Other versions
CN104765833A (en
Inventor
杨乾磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
TVMining Beijing Media Technology Co Ltd
Original Assignee
TVMining Beijing Media Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by TVMining Beijing Media Technology Co Ltd filed Critical TVMining Beijing Media Technology Co Ltd
Priority to CN201510174138.8A priority Critical patent/CN104765833B/en
Publication of CN104765833A publication Critical patent/CN104765833A/en
Application granted granted Critical
Publication of CN104765833B publication Critical patent/CN104765833B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention discloses a kind of generation method and device of word association table, to the purpose realized the memory space that economizes on resources, improve retrieval rate.The generation method of the word association table includes:The mark of multiple words is chosen from a plurality of data asset information of dictionary data table;For each two word in the multiple word, two words are searched in word association table and identify whether to exist;If being not present, the association depth value of initial two words is stored to initial value, and using the mark of two words and association depth value as the data item of word association table.

Description

A kind of generation method and device of word association table
Technical field
The present invention relates to technical field of data processing, the more particularly to a kind of generation method and device of word association table.
Background technology
With the rapid development of information technology, today's society enters the information explosion epoch, people more and more by Network come find oneself needs information, therefore, retrieval become people work, an indispensable part of living.
People are retrieved usually using search engine, and search engine refers to according to certain strategy, with specific Computer program collects information from internet, after tissue and processing are carried out to information, provides retrieval service to the user, will be with The system that the relevant information of user search shows user.
In the prior art, search engine directly can store the information content in itself when carrying out tissue and processing to information, with For place, if place is Beijing, word Beijing is preserved in Locality field, needs a large amount of memory space in this way, and And when subsequently providing retrieval service, retrieval rate is slower.
Invention content
The present invention provides a kind of generation method and device of word association table, to realize the memory space that economizes on resources, carry The purpose of high retrieval rate.
The present invention provides a kind of generation method of word association table, including:
The mark of multiple words is chosen from a plurality of data asset information of dictionary data table;
For each two word in the multiple word, two words are searched in word association table and identify whether to exist;
If being not present, the association depth value of initial two words is to initial value, and by the mark of two words and pass Connection depth value is stored as the data item of word association table.
In an embodiment of the present invention, each two word in the multiple word, is searched in word association table Two words identify whether to exist after, further include:
If in the presence of the association depth value of two words is added the first default value.
In an embodiment of the present invention, the pieces of data resource information in a plurality of data asset information is provided including data Source publisher, data resource issuing time, the attribute of data resource, personage, place in data resource, mechanism, data resource Keyword in it is one or more, every terms of information is with the mark in its each comfortable dictionary sheet in the pieces of data resource information Form be stored in the dictionary data table.
In an embodiment of the present invention, the method further includes:
For each data item in the word association table, when checking that current time is apart from initial storage with predetermined period It whether carves beyond specified duration;
If so, the corresponding association depth value of the data item is subtracted into the second default value.
In an embodiment of the present invention, the method further includes:
For each data item in the word association table, when the corresponding association depth value of the data item is specified numerical value When, delete the data item.
The present invention also provides a kind of generating means of word association table, including:
Module is chosen, for choosing the mark of multiple words from a plurality of data asset information of dictionary data table;
Searching module, for for each two word in the multiple word, two words to be searched in word association table Identify whether exist;
Processing module does not search the mark of two words for the searching module in word association table, then initially should The association depth value of two words using the mark of two words and is associated with number of the depth value as word association table to initial value It is stored according to item.
In an embodiment of the present invention, the processing module is additionally operable to:
It is if the searching module finds the mark of two words in word association table, the association of two words is deep Angle value adds the first default value.
In an embodiment of the present invention, the pieces of data resource information in a plurality of data asset information is provided including data Source publisher, data resource issuing time, the attribute of data resource, personage, place in data resource, mechanism, data resource Keyword in it is one or more, every terms of information is with the mark in its each comfortable dictionary sheet in the pieces of data resource information Form be stored in the dictionary data table.
In an embodiment of the present invention, described device further includes:
Check module, for for each data item in the word association table, with predetermined period check current time away from From the initial storage moment whether beyond specified duration;
The processing module, if being additionally operable to the inspection module check current time apart from the initial storage moment beyond finger Timing is long, then the corresponding association depth value of the data item is subtracted the second default value.
In an embodiment of the present invention, described device further includes:
Removing module, for for each data item in the word association table, when the corresponding association depth of the data item When being worth for specified numerical value, the data item is deleted.
Some advantageous effects of the embodiment of the present invention can include:
In the embodiment of the present invention, the mark of multiple words is chosen from a plurality of data asset information of dictionary data table, for Each two word in multiple words searches two words in word association table and identifies whether to exist, if being not present, initially should The association depth value of two words using the mark of two words and is associated with number of the depth value as word association table to initial value It is stored according to item.If in the presence of the association depth value of two words is added the first default value.The present invention is in word as a result, The mark of word is stored in language contingency table, middle storage word in itself, has saved resource memory space compared with the prior art.Further, The present invention searches two words in word association table and identifies whether to exist, and compared with the prior art middle lookup word in itself, can It improves and searches speed.In addition, the present invention stores the mark of each two word and association depth value in word association table, in case after Continuous search uses.
Other features and advantages of the present invention will be illustrated in the following description, also, partly becomes from specification It obtains it is clear that being understood by implementing the present invention.The purpose of the present invention and other advantages can be by the explanations write Specifically noted structure is realized and is obtained in book, claims and attached drawing.
Below by drawings and examples, technical scheme of the present invention is described in further detail.
Description of the drawings
Attached drawing is used to provide further understanding of the present invention, and a part for constitution instruction, the reality with the present invention Example is applied together for explaining the present invention, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is the flow chart of the generation method of word association table in one embodiment of the invention;
Fig. 2 is the texture field schematic diagram of dictionary sheet that one embodiment of the invention provides;
Fig. 3 is the texture field schematic diagram of dictionary data table that one embodiment of the invention provides;
Fig. 4 is the texture field schematic diagram of word association table that one embodiment of the invention provides;
Fig. 5 is the structure diagram of the generating means of word association table in one embodiment of the invention;
Fig. 6 is the structure diagram of the generating means of word association table in another embodiment of the present invention;And
Fig. 7 is the structure diagram of the generating means of word association table in further embodiment of this invention.
Specific embodiment
The preferred embodiment of the present invention is illustrated below in conjunction with attached drawing, it should be understood that preferred reality described herein It applies example to be merely to illustrate and explain the present invention, be not intended to limit the present invention.
Fig. 1 show the flow chart of the generation method of word association table in one embodiment of the invention, and this method includes following Step S11-S13:
Step S11 chooses the mark of multiple words from a plurality of data asset information of dictionary data table.
In this step, the pieces of data resource information in a plurality of data asset information includes data resource publisher, number According to resource issuing time, the attribute of data resource, personage, place in data resource, mechanism, in the keyword of data resource One or more, every terms of information is stored in the form of the mark in its each comfortable dictionary sheet in the pieces of data resource information In the dictionary data table.
Step S12 for each two word in multiple words, two words is searched in word association table and identify whether to deposit .
Step S13, if being not present, the association depth value of initial two words is to initial value, and the mark of two words And association depth value is stored as the data item of word association table.
In this step, such as initial value takes 0, can also take other numerical value certainly.
In step s 12, for each two word in multiple words, the mark of two words is searched in word association table is After no presence, if in the presence of the association depth value of two words is added the first default value.
In this step, such as the first default value takes 1 or 2, can also take other numerical value certainly.
In the embodiment of the present invention, the mark of multiple words is chosen from a plurality of data asset information of dictionary data table, for Each two word in multiple words searches two words in word association table and identifies whether to exist, if being not present, initially should The association depth value of two words using the mark of two words and is associated with number of the depth value as word association table to initial value It is stored according to item.If in the presence of the association depth value of two words is added the first default value.The present invention is in word as a result, The mark of word is stored in language contingency table, middle storage word in itself, has saved resource memory space compared with the prior art.Further, The present invention searches two words in word association table and identifies whether to exist, and compared with the prior art middle lookup word in itself, can It improves and searches speed.In addition, the present invention stores the mark of each two word and association depth value in word association table, in case after Continuous search uses.
The dictionary sheet referred in the embodiment of the present invention, in data item in addition to can include word in itself, the mark of word and Outside these fields of the hash values of word, the corresponding document properties of word, such as in television programme data, the corresponding text of word can also be included Shelves attribute includes the corresponding channel of word, column etc..Here, dictionary sheet can be expressed as tixmain_data_term, certainly, this Place is only illustrative, and is not intended to limit the present invention.The texture field of the dictionary sheet of one embodiment of the invention offer is provided Schematic diagram, in Fig. 2, termid represents the mark of word, and termkey represents the hash values of word, and termvalue represents word in itself, Termprop represents the corresponding document properties of word, and updated represents the renewal time of word.
Further, in dictionary sheet word hash values, can be word MD5 (Message Digest Algorithm, message Digest algorithm the 5th edition) value, it can such as intercept first 16 of MD5 values;It can also be SHA1 (the Secure Hash of word Algorithm, Secure Hash Algorithm) value;The hash values of word can also be calculated by other algorithms, the present invention is not limited thereto.
A plurality of data asset information, pieces of data resource letter are stored in the dictionary data table referred in above step S11 Breath includes data resource publisher, data resource issuing time, the attribute of data resource, personage, place in data resource, machine Structure, one or more in the keyword of data resource, every terms of information is with its each comfortable word in the pieces of data resource information The form of mark in allusion quotation table is stored in dictionary data table.The dictionary data of one embodiment of the invention offer is provided The texture field schematic diagram of table, in Fig. 3, id represents the mark of the data resource information, and published represents data resource hair Cloth time, f2t_props represent the attribute of data resource, and t2f_t_uid represents data resource publisher, and t2n_nr represents people Object, t2n_ns represent place, t2n_nt outgoing mechanisms, and t2t_t_terms represents the keyword of data resource.
The mark of two words and association depth value are deposited as the data item of word association table in step S13 Storage, the data item of word association table can record the word association in given number of days.Here, word association table can represent For Tzn_nr_d1, the ID (mark) of associated two words, ID sources are had recorded including two field rel and weight, rel In dictionary sheet, shaped like ID.ID, two mark ID are separated with " ", and weight has recorded the association depth of two words, if rel two A mark ID is existing, then is associated with depth value plus the first default value (such as 1 or 2).
In another preferred embodiment of the present invention, rel create-rules are:The ID of first word comes from number in dictionary data table According to the keyword of resource, personage, place or the mechanism of the ID of second word in the data resource in dictionary data table.Example Such as, after editorial staff pushes new document or data resource, by rel relationship map values, if rel values exist, by its weight Add 1.The texture field schematic diagram of the word association table of one embodiment of the invention offer is provided, it, should in Fig. 4 Tixmain_t2n_nr_d1 tables are the word association table of nearest one day personage, and d1 represents intraday word association, can be with There are d3 (in 3 days) table, d7 (in 7 days) tables or d30 (in 30 days) table etc..The ID of first word comes from dictionary data table in rel The keyword of middle data resource, personage (or place, the machine of the ID of second word in the data resource in dictionary data table Structure, attribute etc.) ID values.In weight fields, after editorial staff pushes new document or data resource is come in, reflected by rel relationships Value is penetrated, if rel values add 1 there are 100816.100799, by its weight.
In another preferred embodiment of the present invention, if in new data asset information storage to dictionary data table, it can be from word Successively according to (keyword, personage, place, mechanism, attribute) ID, combination producing rel, create-rule institute for example above in allusion quotation tables of data It states, i.e., the mark of multiple words is chosen from new data asset information, for each two word in multiple words, searches two words Mark rel whether there is, if so, the association depth value of two words is added the first default value.
In another preferred embodiment of the present invention, for each data item in word association table, worked as with predetermined period inspection Whether the preceding moment exceeds specified duration apart from the initial storage moment, if so, the corresponding association depth value of the data item is subtracted Remove the second default value.Further, for each data item in word association table, when the corresponding association depth value of the data item is During specified numerical value (such as 0 value or other numerical value), the data item is deleted.For example, scheduling script cyclic check all properties table d1, Data item whether respectively corresponding more than 24,72,168 hours in d3, d7, if it does, its weight is subtracted 1, when being kept to 0 When delete data item in the attribute list.In another example the record in Tzn_nr_d1, it can be with newly-increased, the mapping pass of data resource It is the record to identical rel values, weight adds 1.When obtaining hot word in one day, descending arrangement is done according to weight values, from And it gets the highest hot word of weights and comes front.After one day, weights can subtract 1, when being kept to 0, be deleted from word association table Except the data item.
In addition, a table is excessive in order to prevent, cause to inquire or store it is inconvenient, dictionary sheet in the embodiment of the present invention, Dictionary data table or word association table are that can be made of multiple tables, these tables meet Hash and are uniformly distributed.
After word association table described above is obtained, which can apply in subsequent lookup or storage In the work of data resource.For example, user requires to look up " Beijing " associated associated mechanisms resource, then dictionary sheet is arrived first Pekinese ID (mark) is searched in tixmain_data_term, i.e., first calculates Pekinese's hash values, is found according to the hash values Pekinese ID.Then arriving word association table Tzn_nt_d1, (here, which is associated therewith table, and is converged for nearest nature's mystery word-building Associated data can also have d3 and d7 and personage, place, attribute) according to Pekinese ID search with the associated word in Beijing, And then related resource is searched for according to Beijing and its associated word.Such as, it is 10001 that Pekinese ID is found from dictionary sheet, is arrived All records that rel is 10001.* are searched in Tzn_nt_d1, are sorted by weighted value, the ID of n mechanism word before taking, by the ID of word It is searched into dictionary sheet, obtains mechanism vocabulary title, provided according to mechanism vocabulary title retrieval to get to the associated mechanism in Beijing Source.
Corresponding to the generation method of the word association table in above-described embodiment, the present invention also provides a kind of word association tables Generating means.The structure diagram of the generating means of word association table in one embodiment of the invention is illustrated in figure 5, including:
Module 51 is chosen, for choosing the mark of multiple words from a plurality of data asset information of dictionary data table;
Searching module 52, for for each two word in multiple words, the mark of two words to be searched in word association table Knowledge whether there is;
Processing module 53 does not search the mark of two words for searching module 52 in word association table, then initially should The association depth value of two words using the mark of two words and is associated with number of the depth value as word association table to initial value It is stored according to item.
In an embodiment of the present invention, above-mentioned processing module 53 is additionally operable to:
If searching module 52 finds the mark of two words in word association table, by the association depth of two words Value is plus the first default value.
In an embodiment of the present invention, the pieces of data resource information in a plurality of data asset information is sent out including data resource Cloth person, data resource issuing time, the attribute of data resource, personage, place in data resource, mechanism, the pass of data resource One or more in keyword, every terms of information is deposited in the form of the mark in its each comfortable dictionary sheet in pieces of data resource information Storage is in dictionary data table.
In an embodiment of the present invention, as shown in fig. 6, the device of Fig. 5 displayings can also include:
Module 61 is checked, for for each data item in word association table, current time distance to be checked with predetermined period Whether the initial storage moment is beyond specified duration;
Here it is possible to determine whether according to the field published in dictionary data table beyond specified duration.
Above-mentioned processing module 53, if being additionally operable to check module check current time apart from the initial storage moment beyond specified The corresponding association depth value of the data item is then subtracted the second default value by duration.
In an embodiment of the present invention, as shown in fig. 7, the device of Fig. 6 displayings can also include:
Removing module 71, for for each data item in word association table, when the corresponding association depth value of the data item During for specified numerical value, the data item is deleted.
The above device of the embodiment of the present invention:In the embodiment of the present invention, from a plurality of data asset information of dictionary data table The middle mark for choosing multiple words, for each two word in multiple words, the mark of two words is searched in word association table is No presence, if being not present, the association depth value of initial two words is to initial value, and by the mark of two words and association Depth value is stored as the data item of word association table.If in the presence of the association depth value of two words is added first Default value.The present invention stores the mark of word in word association table as a result, and middle storage word in itself, saves compared with the prior art About resource memory space.Further, the present invention searches in word association table two words and identifies whether to exist, compared to existing Have in technology and search word in itself, lookup speed can be improved.In addition, the present invention stores the mark of each two word in word association table Know and be associated with depth value, in case subsequent searches use.
It should be understood by those skilled in the art that, the embodiment of the present invention can be provided as method, system or computer program Product.Therefore, the reality in terms of complete hardware embodiment, complete software embodiment or combination software and hardware can be used in the present invention Apply the form of example.Moreover, the computer for wherein including computer usable program code in one or more can be used in the present invention The shape of computer program product that usable storage medium is implemented on (including but not limited to magnetic disk storage and optical memory etc.) Formula.
The present invention be with reference to according to the method for the embodiment of the present invention, the flow of equipment (system) and computer program product Figure and/or block diagram describe.It should be understood that it can be realized by computer program instructions every first-class in flowchart and/or the block diagram The combination of flow and/or box in journey and/or box and flowchart and/or the block diagram.These computer programs can be provided The processor of all-purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices is instructed to produce A raw machine so that the instruction performed by computer or the processor of other programmable data processing devices is generated for real The device of function specified in present one flow of flow chart or one box of multiple flows and/or block diagram or multiple boxes.
These computer program instructions, which may also be stored in, can guide computer or other programmable data processing devices with spy Determine in the computer-readable memory that mode works so that the instruction generation being stored in the computer-readable memory includes referring to Enable the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one box of block diagram or The function of being specified in multiple boxes.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that counted Series of operation steps are performed on calculation machine or other programmable devices to generate computer implemented processing, so as in computer or The instruction offer performed on other programmable devices is used to implement in one flow of flow chart or multiple flows and/or block diagram one The step of function of being specified in a box or multiple boxes.
Obviously, various changes and modifications can be made to the invention without departing from essence of the invention by those skilled in the art God and range.In this way, if these modifications and changes of the present invention belongs to the range of the claims in the present invention and its equivalent technologies Within, then the present invention is also intended to include these modifications and variations.

Claims (8)

1. a kind of generation method of word association table, which is characterized in that including:
The mark of multiple words is chosen from a plurality of data asset information of dictionary data table;
For each two word in the multiple word, two words are searched in word association table and identify whether to exist;
If being not present, the association depth value of initial two words by the mark of two words and is associated with deep to initial value Angle value is stored as the data item of word association table;
For each data item in the word association table, check that current time is apart from the initial storage moment with predetermined period It is no to exceed specified duration;
If so, the corresponding association depth value of the data item is subtracted into the second default value.
2. according to the method described in claim 1, it is characterized in that, each two word in the multiple word, in word Searched in language contingency table two words identify whether to exist after, further include:
If in the presence of the association depth value of two words is added the first default value.
3. method according to claim 1 or 2, which is characterized in that the pieces of data in a plurality of data asset information Resource information includes data resource publisher, data resource issuing time, the attribute of data resource, personage in data resource, Place, mechanism, one or more in the keyword of data resource, every terms of information is each with it in the pieces of data resource information The form of mark in comfortable dictionary sheet is stored in the dictionary data table.
4. it according to the method described in claim 1, it is characterized in that, further includes:
For each data item in the word association table, when the corresponding association depth value of the data item is specified numerical value, delete Except the data item.
5. a kind of generating means of word association table, which is characterized in that including:
Module is chosen, for choosing the mark of multiple words from a plurality of data asset information of dictionary data table;
Searching module, for for each two word in the multiple word, the mark of two words to be searched in word association table It whether there is;
Processing module does not search the mark of two words for the searching module in word association table, then this two initial The association depth value of word using the mark of two words and is associated with data item of the depth value as word association table to initial value It is stored;
Module is checked, for for each data item in the word association table, current time distance to be checked just with predetermined period Whether the storage moment of beginning is beyond specified duration;
The processing module, if being additionally operable to the inspection module check current time apart from when exceeding specified at the initial storage moment It is long, then the corresponding association depth value of the data item is subtracted into the second default value.
6. device according to claim 5, which is characterized in that the processing module is additionally operable to:
If the searching module finds the mark of two words in word association table, by the association depth value of two words In addition the first default value.
7. device according to claim 5 or 6, which is characterized in that the pieces of data in a plurality of data asset information Resource information includes data resource publisher, data resource issuing time, the attribute of data resource, personage in data resource, Place, mechanism, one or more in the keyword of data resource, every terms of information is each with it in the pieces of data resource information The form of mark in comfortable dictionary sheet is stored in the dictionary data table.
8. device according to claim 5, which is characterized in that further include:
Removing module, for for each data item in the word association table, when the corresponding association depth value of the data item is During specified numerical value, the data item is deleted.
CN201510174138.8A 2015-04-13 2015-04-13 A kind of generation method and device of word association table Expired - Fee Related CN104765833B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510174138.8A CN104765833B (en) 2015-04-13 2015-04-13 A kind of generation method and device of word association table

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510174138.8A CN104765833B (en) 2015-04-13 2015-04-13 A kind of generation method and device of word association table

Publications (2)

Publication Number Publication Date
CN104765833A CN104765833A (en) 2015-07-08
CN104765833B true CN104765833B (en) 2018-06-19

Family

ID=53647662

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510174138.8A Expired - Fee Related CN104765833B (en) 2015-04-13 2015-04-13 A kind of generation method and device of word association table

Country Status (1)

Country Link
CN (1) CN104765833B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101561818A (en) * 2009-05-13 2009-10-21 北京用友移动商务科技有限公司 Method for word segmentation processing and method for full-text retrieval
CN103631909A (en) * 2013-11-26 2014-03-12 烽火通信科技股份有限公司 System and method for combined processing of large-scale structured and unstructured data
CN103914487A (en) * 2013-01-08 2014-07-09 邓寅生 Document collection, identification and association system
CN104462396A (en) * 2014-12-10 2015-03-25 北京国双科技有限公司 Method and device for handing character strings

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8611676B2 (en) * 2005-07-26 2013-12-17 Sony Corporation Information processing apparatus, feature extraction method, recording media, and program

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101561818A (en) * 2009-05-13 2009-10-21 北京用友移动商务科技有限公司 Method for word segmentation processing and method for full-text retrieval
CN103914487A (en) * 2013-01-08 2014-07-09 邓寅生 Document collection, identification and association system
CN103631909A (en) * 2013-11-26 2014-03-12 烽火通信科技股份有限公司 System and method for combined processing of large-scale structured and unstructured data
CN104462396A (en) * 2014-12-10 2015-03-25 北京国双科技有限公司 Method and device for handing character strings

Also Published As

Publication number Publication date
CN104765833A (en) 2015-07-08

Similar Documents

Publication Publication Date Title
US11580168B2 (en) Method and system for providing context based query suggestions
US9846696B2 (en) Apparatus and methods for indexing multimedia content
JP5420243B2 (en) Determining the desired repository
US20190005025A1 (en) Performing semantic graph search
US9043360B2 (en) Display entity relationship
CN108304444B (en) Information query method and device
US20130325847A1 (en) Graph-based searching
US8433666B2 (en) Link information extracting apparatus, link information extracting method, and recording medium
JP2007241451A (en) Information collection support device
Miyanishi et al. Combining recency and topic-dependent temporal variation for microblog search
Verberne et al. Query term suggestion in academic search
CN110515895B (en) Method and system for carrying out associated storage on data files in big data storage system
WO2014034383A1 (en) Information processing device, record location information specification method, and information processing program
CN104765833B (en) A kind of generation method and device of word association table
JP2011133928A (en) Retrieval device, retrieval system, retrieval method, and computer program for retrieving document file stored in storage device
CN104778247B (en) A kind of information retrieval method and device based on data-oriented resource
CN104765830B (en) A kind of information search method and device
CN104765829B (en) A kind of information retrieval method and device
JP2010160541A (en) Information processing device
CN104765835B (en) A kind of searching method and device of search term
JPH11282874A (en) Information filtering method and device
JP5899587B2 (en) File search method, file search device, and program
CN104765834B (en) A kind of information search method and device
CN104765831B (en) A kind of generation of dictionary sheet and its application process and device
JP2000348039A (en) Information provision system and information providing device using same system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
EXSB Decision made by sipo to initiate substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
PE01 Entry into force of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: A method and device for generating word association table

Effective date of registration: 20210104

Granted publication date: 20180619

Pledgee: Inner Mongolia Huipu Energy Co.,Ltd.

Pledgor: TVMINING (BEIJING) MEDIA TECHNOLOGY Co.,Ltd.

Registration number: Y2020990001527

CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20180619

Termination date: 20210413