CN105574162A - Automatic hyperlink method of keyword - Google Patents

Automatic hyperlink method of keyword Download PDF

Info

Publication number
CN105574162A
CN105574162A CN201510946128.1A CN201510946128A CN105574162A CN 105574162 A CN105574162 A CN 105574162A CN 201510946128 A CN201510946128 A CN 201510946128A CN 105574162 A CN105574162 A CN 105574162A
Authority
CN
China
Prior art keywords
data
key word
hyperlink
keyword
label
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.)
Granted
Application number
CN201510946128.1A
Other languages
Chinese (zh)
Other versions
CN105574162B (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.)
NANJING DINGYAN INFORMATION TECHNOLOGY Co Ltd
Original Assignee
NANJING DINGYAN INFORMATION 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 NANJING DINGYAN INFORMATION TECHNOLOGY Co Ltd filed Critical NANJING DINGYAN INFORMATION TECHNOLOGY Co Ltd
Priority to CN201510946128.1A priority Critical patent/CN105574162B/en
Publication of CN105574162A publication Critical patent/CN105574162A/en
Application granted granted Critical
Publication of CN105574162B publication Critical patent/CN105574162B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/955Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
    • G06F16/9558Details of hyperlinks; Management of linked annotations

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The invention discloses an automatic hyperlink method of a keyword. When a user starts an application program, the program judges whether keyword hyperlink data needs to be downloaded from an assigned server or not according to current configuration, if the keyword hyperlink data needs to be downloaded, the keyword hyperlink data is downloaded from the assigned server and is stored in locality; when the user opens a document through the application program, the application program automatically analyzes the keyword when the application program parses the document, and searches the matched keyword from a keyword hyperlink database to obtain corresponding hyperlink data; and if no keywords are matched in the database, the assigned server is accessed to obtain the keyword hyperlink data of the assigned keyword, the keyword hyperlink data is updated to the locality, and if the keywords can be matched in the database, the hyperlink is displayed in a keyword area when document contents are displayed according to the hyperlink data obtained by the matched keyword. The problem that the action and the effect of the hyperlink are seriously restricted since the hyperlink can not automatically form a hyperlink form through the keyword remotely can be avoided.

Description

The method of the automatic hyperlink of key word
Technical field
The present invention relates to a kind of hyperlink technical field, the method for the automatic hyperlink of especially a kind of key word.
Background technology
Hyperlink belongs to a part for a webpage in itself, and it a kind ofly allows us with the element carrying out between other webpages or website connecting.After each web page interlinkage together, really could form a website.So-called hyperlink refers to the annexation pointing to a target from a webpage, and this target can be another webpage, also can be the diverse location in same web page, it can also be a picture, an e-mail address, a file, or even an application program.And in a webpage, be used for the object of hyperlink, can be one section of text or a picture.After viewer clicks the word or picture linked, hyperlink target will show on a web browser, and open according to the type of target or run.
And this hyperlink at present also cannot realize by keyword the form automatically forming super chain long-range, limit to its action effect thus greatly.
Summary of the invention
The object of the present invention is to provide the method for the automatic hyperlink of a kind of key word, when user opens application program, program surpasses chain data according to current configuration determination the need of downloading key word from the server of specifying, if need to download, then the automatic server from specifying is downloaded and is saved in this locality; User is when by application program opening document, and automatic analysis key word during application program parse documents, and to surpass in chain database search coupling key word at key word, obtains corresponding super chain data; If do not match key word at database, then access the server of specifying, the hyperlink data of nominal key is obtained with this, and be updated to this locality, if can key word be matched at database, according to the hyperlink data that coupling key word obtains, when showing document content, show hyperlink in key word region.Avoid hyperlink also cannot limit to its action effect thus greatly problem in the long-range form by the super chain of the automatic formation of keyword realization.
In order to achieve the above object, technical scheme of the present invention is: the method for the automatic hyperlink of a kind of key word, when user opens application program, program surpasses chain data according to current configuration determination the need of downloading key word from the server of specifying, if need to download, then the automatic server from specifying is downloaded and is saved in this locality; User is when by application program opening document, and automatic analysis key word during application program parse documents, and to surpass in chain database search coupling key word at key word, obtains corresponding super chain data; If do not match key word at database, then access the server of specifying, the hyperlink data of nominal key is obtained with this, and be updated to this locality, if can key word be matched at database, according to the hyperlink data that coupling key word obtains, when showing document content, show hyperlink in key word region.
After adopting said method, the present invention just automatically can download key word from the server of specifying and surpasses chain data and be saved in this locality, thus according to analyzing and the super chain data obtained, when showing document content, shows hyperlink in key word region.
Accompanying drawing explanation
Fig. 1 is process flow diagram of the present invention.
Fig. 2 is the process flow diagram of random content extraction algorithm of the present invention.
Fig. 3 is the process flow diagram of layered contents extraction algorithm of the present invention.
Fig. 4 is the process flow diagram of keyword extraction of the present invention.
Fig. 5 is the process flow diagram that keyword of the present invention is collected automatically.
Embodiment
The present invention is further detailed explanation for the embodiment provided below in conjunction with accompanying drawing.Ginseng
See shown in Fig. 1-Fig. 5, the method of the automatic hyperlink of key word, when user opens application program, program surpasses chain data according to current configuration determination the need of downloading key word from the server of specifying, if need to download, then the automatic server from specifying is downloaded and is saved in this locality; User is when by application program opening document, and automatic analysis key word during application program parse documents, and to surpass in chain database search coupling key word at key word, obtains corresponding super chain data; If do not match key word at database, then access the server of specifying, the hyperlink data of nominal key is obtained with this, and be updated to this locality, if can key word be matched at database, according to the hyperlink data that coupling key word obtains, when showing document content, show hyperlink in key word region.
Wherein, the mode of application program parse documents is:
First carry out single document Sample Data Collection, the document namely opened according to user is analyzed, and the key message of general text data all can be kept at following place: filename, Document Title, bookmark, document first paragraph content, document final stage content.Given this, the present invention also will be main from these part sample drawn data.Sample data is first kept at this locality, treat user network after again these data upload to server to complete the preparation of the extraction of key word, classification, weight adjusting and super chain data, uncertain for opportunity owing to uploading ground, need the number of times recording document the last time of opening and the front opening uploaded during record sample data, need when these two information calculate key word weights after being, the storage format of described sample data is as shown in table 1 is followed successively by data package size, last opening time, open number of times, document language, file name length, file name data, Document Title length, Document Title data, first section of content-length, first section of content-data, latter end content-length, latter end content-data, bookmark entry quantity, first bookmark entry length, first bookmark entry content, second bookmark entry length, second bookmark entry content ... n-th bookmark entry length, n-th bookmark entry content, random content quantity, first random content length, first random content data, second random content length, second random content data ... n-th random content length, the data segment of the n-th random content data, wherein n is positive integer,
Table 1
The implication of said structure content describes as shown in table 2:
Table 2
And when carrying out random content and extracting, can adopt and randomly draw algorithm or layered extraction method extracts;
For smaller document or the document not having bookmark information and distributed intelligence, this is adopted to randomly draw algorithm, described algorithm of randomly drawing wants random write to round the content of a document, this algorithm idiographic flow is as follows, first determine the quantity needing the sample extracted, according to the size of document content, generate the list of random numbers of one group of sample size and do not repeat, again according to numerical value each in this array as document bias internal, read the content of text of regular length successively and preserve;
For larger document, adopt this layered extraction method algorithm.This algorithm can be the weights coefficient H that extraction comprehensively or emphasis extraction define ground floor sample according to the strategy of sample drawn.
Described layered extraction algorithm idiographic flow is as follows, and first determine the quantity N needing the sample extracted, ground floor needs the sample size extracted to be the N/H of total quantity.If the document has bookmark information, then using bookmark information as ground floor sample pool, if there is no bookmark information, then using paging information as ground floor sample pool.List is constructed with each bookmark ID or No. ID, each paging, then with the ground floor sample list that the quantity of bookmark or number of pages need for radix structure.Next according to the ground floor sample list extracted, H sample is extracted separately separately.Such as: if using bookmark information as sample pool, according to the ground floor sample list generated, each list item is a bookmark ID, when extracting two layers of sample separately, come the position of locating documents according to bookmark ID, then open preservation with randomly drawing algorithm extraction H samples of text data;
Carrying out the mode that sample data is uploaded and keyword message extracts is: sample data can be opened different documents according to user and upgrade, and is stored in local device; When subscriber equipment networking, upload the local sample data stored on server, to carry out keyword extraction and follow-up work according to strategy setting;
User's use scenes is varied, totally can be divided into: not networking, mobile network, fixed mesh (LAN, WIFI), according to different use networked environments, takes different sample datas to upload strategy, specific as follows:
(1) environment of networking is not had: do not carry out upload operation.
(1) mobile network environment: do not carry out upload operation.
(2) fixed network environment: idle is uploaded, limiting uploading speed.
(4) user can oneself definition strategy, such as: allow during mobile network to upload, allow to upload etc. in the time in fixed network time limit.
When carrying out client id calculating and verification, what often adopt is calculating and the method for calibration of following described several client ids, but client id is not only for this several method lower, also can be that several algorithm combination uses simultaneously:
1, the method for hardware combinations ID
The sample information of collecting needs to indicate the user belonging to this sample information when uploading, and software download user key words information and super chain data time also need to indicate user ID, i.e. data and user-association.This user ID needs uniquely to indicate user.
Computing method: the id information obtaining environment division hardware according to fixing order, the ID FF that cannot obtain fills, and synthesizes a string character according to this der group.
Method of calibration: owing to forming each several part information of ID, which hardware each equipment has different, and does not ensure that the hard disk of each equipment can not be changed.The method of verification like this just can not verify by simple coupling completely, and when specifically verifying, each hardware information is analyzed out and verified separately, and when all hardware informations match more than 50%, just verification is passed through.Not only one may be comprised for some hardware in the equipment had simultaneously, at this moment verify single hardware information, as long as there is a coupling in same item of hardware, namely represent this Hardware match success.
2, the method for client unique information
Information (such as: E-mail address, phone number etc.) according to unique identification user is come as client id.During verification, the match is successful will to mate just calculation completely.
Extract by keyword extraction algorithms when carrying out keyword extraction, after namely user's sample data is uploaded onto the server, server end just carries out keyword extraction according to these data.Algorithm is described below substantially:
1. pair text carries out word segmentation processing.
2. the text of pair different position is weighted process, as previously described, contains the information such as filename, Document Title, bookmark in the sample uploaded, and the weight of these information should be different, so will add different weights to these information.As: to filename weighted 5, Document Title weighted 3 etc.
3. reservation noun, verb and adjective, and calculate the frequency of each word appearance, obtain the < frequency of each word, weight > list.
4. the Words similarity of the word that the rank in the above-mentioned list of calculating is forward, merges for similar word.
5. finally obtain Keyword List.
Each key word belongs at least one category, and such as bicycle is included within multiple category such as " traffic ", " motion ".After extraction to key word, then sum up top's list of affiliated category further.
When carrying out key data accumulation, weight adjusting, key word and category can as the label datas of user, and these label datas also have different weight, adjust the priority of the propelling movement of super chain data according to this.
The time with key word hit of label data weights, the parameters such as hit-count are correlated with.Principle is, its label weights of key word of hit are larger in the recent period; Hit-count more multiple weighing value is larger.
Extract in the process of key word in analyzing samples data, likely not corresponding in keyword database keyword message, so also just cannot mate this key word and label information thereof.Devise the automatic collection method of this key word for this situation spy, the large principle that works is as follows:
1. according to described keyword extraction algorithm, sample data is extracted.
2., for not matching label and the higher key word of weight ratio, what join the association of this client id does not sort out in key table, joins not sorting out in key data table of the overall situation simultaneously yet.
3. automatically regularly or manually boot that process is above-mentioned does not sort out key data table process, according to the key word in frequency of occurrences order from high to low successively processing list:
Whether have synonym or near synonym sorted out, some words then use its label if a) searching this key word, and never classification key table deletes this key word, completes the processing procedure of this key word.Otherwise the step continued below.
B) obtain the label information of this key word from appointed website or server, if obtain successfully, then use this information, and never sort out in key table and delete this key word, complete the processing procedure of this key word.Otherwise, continue step below.
C) point out keeper manual trasaction key label data.Complete this key word processing procedure.
4. do not sort out keyword message for treated, what upgrade corresponding client tag information and these clients does not sort out key table.
When performing key word and super chain data-pushing, surpass chain data according to the condition adjudgement of networking the need of from service trasaction key time software is opened, specific rules is consistent with the rule uploading sample data; Need to provide software client id information when server downloads super chain data, server can according to finding key word to surpass chain data with ID and returning the such information of related data size, for software download;
The data layout downloaded is as shown in table 3, particularly, is followed successively by the data segment of size, number of labels, weights, key word quantity, Keyword List, super chain data, label data:
Table 3
The data downloaded are kept in local device, when user's opening document, software analysis document content, mate Keyword List in each label of above-mentioned data, the label that priority match weights are higher, then key word and super chain data in associated document after matching, show super chain content when displaying document according to strategy.
And key word hyperlink data update method conventional be two kinds of update methods, but be not limited only to this two kinds of methods, also can combinationally use by several method, two kinds of described update methods are as follows simultaneously:
1. manual update method
The manual update server database information of keeper, input < label, key word, hyperlink data > combined information; The corresponding relation of key word and label is the relation of multi-to-multi; When pushing hyperlink data to client, search above-mentioned label information, the < label of coupling, key word, hyperlink data > information are issued client;
2. automatic obtaining method
Administrator given server is used for automatically searching label, keyword message, at propelling movement hyperlink data to client, automatically asks its hyperlink data according on client tag, keyword message to server; Data on these servers of specifying generally are provided by third party, or large data generate automatically.
Key word hyperlink data pushes strategy in addition, specific as follows:
Same label and the hyperlink data of keyword association can have a lot of bar, need certain strategy in this case to allow server know how to choose data to push.
Below some strategies are only enumerated, but not only for this several strategy.Can be that several strategy combination uses simultaneously.
1. priority is set according to label.Default setting is automatic acquisition link data, and keeper can also manually for label adds hyperlink data, and the different link data of same label is set to different priority, pushes link data to preferentially pushing priority ratio higher data during client;
2. priority is set according to key word, default setting is automatic acquisition link data, keeper can also manually for key word adds hyperlink data, the different link data of same key word is set to different priority, push link data to preferentially pushing priority ratio higher data during client, when key word priority is identical, then compare the priority of its label, the data that preferential propelling movement priority ratio is higher;
3. priority is set according to < label, key word > combination.Default setting is automatic acquisition link data, keeper can also manually for hyperlink data be added in combination, the different link data of same combination is set to different priority, push link data to preferentially pushing priority ratio higher data during client, if the priority of combination is identical, then comparison keyword priority, if the priority of key word is still identical, compare the priority of its label again, the data that preferential propelling movement priority ratio is higher.
When described user opens application program program according to current configuration determination the need of the judgment mechanism downloading key word from the server of specifying and surpass chain data at least comprise following some:
1) when this locality does not have hyperlink data time, need to download hyperlink data from server.
2) whether the Keyword Tag that contact server detects this client upgrades, if upgraded, needs to download hyperlink data.
3, contact server detect this client corresponding Keyword Tag association hyperlink data whether have updated, if upgraded, need download hyperlink data.
Above-described is only the preferred embodiment of the present invention, it should be pointed out that for the person of ordinary skill of the art, and without departing from the concept of the premise of the invention, can also make some distortion and improvement, these all belong to protection scope of the present invention.

Claims (8)

1. the method for the automatic hyperlink of key word, it is characterized in that: when user opens application program, program surpasses chain data according to current configuration determination the need of downloading key word from the server of specifying, if need to download, then the automatic server from specifying is downloaded and is saved in this locality; User is when by application program opening document, and automatic analysis key word during application program parse documents, and to surpass in chain database search coupling key word at key word, obtains corresponding super chain data; If do not match key word at database, then access the server of specifying, the hyperlink data of nominal key is obtained with this, and be updated to this locality, if can key word be matched at database, according to the hyperlink data that coupling key word obtains, when showing document content, show hyperlink in key word region.
2. the method for the automatic hyperlink of key word according to claim 1, it is characterized in that: wherein, in the mode of described application program parse documents be: first carry out single document Sample Data Collection, the document namely opened according to user is analyzed, sample data is first kept at this locality, treat user network after again these data upload to server to complete the preparation of the extraction of key word, classification, weight adjusting and super chain data, need the number of times recording document the last time of opening and the front opening uploaded during record sample data, need when these two information calculate key word weights after being, the storage format of described sample data is followed successively by storage data package size, last opening time, open number of times, document language, file name length, file name data, Document Title length, Document Title data, first section of content-length, first section of content-data, latter end content-length, latter end content-data, bookmark entry quantity, first bookmark entry length, first bookmark entry content, second bookmark entry length, second bookmark entry content ... n-th bookmark entry length, n-th bookmark entry content, random content quantity, first random content length, first random content data, second random content length, second random content data ... n-th random content length, the data segment of the n-th random content data, wherein n is positive integer, when extracting random content, can adopt and randomly draw algorithm or layered extraction method extracts, described algorithm of randomly drawing wants random write to round the content of a document, this algorithm idiographic flow is as follows, first the quantity needing the sample extracted is determined, according to the size of document content, generate the list of random numbers of one group of sample size and do not repeat, again according to numerical value each in this array as document bias internal, read the content of text of regular length successively and preserve, described layered extraction algorithm idiographic flow is as follows, and first determine the quantity N needing the sample extracted, ground floor needs the sample size extracted to be the N/H of total quantity, if the document has bookmark information, then using bookmark information as ground floor sample pool, if there is no bookmark information, then using paging information as ground floor sample pool, list is constructed with each bookmark ID or No. ID, each paging, then with the ground floor sample list that the quantity of bookmark or number of pages need for radix structure, next according to the ground floor sample list extracted, H sample is extracted separately separately, if using bookmark information as sample pool, according to the ground floor sample list generated, each list item is a bookmark ID, when extracting two layers of sample separately, come the position of locating documents according to bookmark ID, then open preservation with randomly drawing algorithm extraction H samples of text data, and carry out sample data upload and keyword message extract mode be: sample data can be opened different documents according to user and upgrade, and is stored in local device, when subscriber equipment networking, upload the local sample data stored on server, to carry out keyword extraction and follow-up work according to strategy setting, when carrying out client id calculating and verification, its method comprises the method for hardware combinations ID or the method for client unique information, also can be the combination of several method, carry out keyword extraction keyword extraction algorithms to extract, after namely user's sample data is uploaded onto the server, server end just carries out keyword extraction according to these data, after extraction to key word, then sum up top's list of affiliated category further, when carrying out key data accumulation, weight adjusting, key word and category can as the label datas of user, these label datas also have different weight, adjust the priority of the propelling movement of super chain data according to this, the time with key word hit of label data weights, the such parameter of hit-count is correlated with, and principle is, its label weights of key word of hit are larger in the recent period, and hit-count more multiple weighing value is larger, when performing key word and super chain data-pushing, surpass chain data according to the condition adjudgement of networking the need of from service trasaction key time software is opened, specific rules is consistent with the rule uploading sample data, need to provide software client id information when server downloads super chain data, server can according to finding key word to surpass chain data with ID and returning the such information of related data size, for software download, the data layout downloaded particularly, is followed successively by the data segment of size, number of labels, weights, key word quantity, Keyword List, super chain data, label data, the data downloaded are kept in local device, when user's opening document, software analysis document content, mate Keyword List in each label of above-mentioned data, the label that priority match weights are higher, then key word and super chain data in associated document after matching, show super chain content when displaying document according to strategy.
3. the method for the automatic hyperlink of key word according to claim 2, is characterized in that: the strategy that sample data is uploaded is:
(1) environment of networking is not had: do not carry out upload operation;
(2) mobile network environment: do not carry out upload operation;
(3) fixed network environment: idle is uploaded, limiting uploading speed;
(4) user can oneself definition strategy, comprising: allow during mobile network to upload, allow to upload in the time in fixed network time limit.
4. the method for the automatic hyperlink of key word according to claim 3, is characterized in that: and key word hyperlink data update method comprises two kinds of update methods as follows:
(1) manual update method: the i.e. manual update server database information of keeper, input < label, key word, hyperlink data > combined information; The corresponding relation of key word and label is the relation of multi-to-multi; When pushing hyperlink data to client, search above-mentioned label information, the < label of coupling, key word, hyperlink data > information are issued client;
(2) update method of automatic acquisition: namely Administrator given server is used for automatically searching label, keyword message, at propelling movement hyperlink data to client, automatically ask its hyperlink data according on client tag, keyword message to server; Data on these servers of specifying generally are provided by third party, or large data generate automatically;
Key word hyperlink data pushes strategy in addition, and specific as follows three kinds push strategy:
(1) priority is set according to label, default setting is automatic acquisition link data, keeper can also manually for label adds hyperlink data, the different link data of same label is set to different priority, pushes link data to preferentially pushing priority ratio higher data during client;
(2) priority is set according to key word, default setting is automatic acquisition link data, keeper can also manually for key word adds hyperlink data, the different link data of same key word is set to different priority, push link data to preferentially pushing priority ratio higher data during client, when key word priority is identical, then compare the priority of its label, the data that preferential propelling movement priority ratio is higher;
(3) priority is set according to < label, key word > combination, default setting is automatic acquisition link data, keeper can also manually for hyperlink data be added in combination, the different link data of same combination is set to different priority, push link data to preferentially pushing priority ratio higher data during client, if the priority of combination is identical, comparison keyword priority again, if the priority of key word is still identical, compare the priority of its label again, the data that preferential propelling movement priority ratio is higher.
5. the method for the automatic hyperlink of key word according to claim 4, it is characterized in that: wherein keyword extraction algorithms is, its arthmetic statement is as follows:
(1) word segmentation processing is carried out to text;
(2) process is weighted to the text of different positions, contains the information that filename, Document Title, bookmark are such in the sample uploaded, different weights is added to these information;
(3) only retain noun, verb and adjective, and calculate the frequency of each word appearance, obtain the < frequency of each word, weight > list;
(4) calculate the Words similarity of the forward word of rank in above-mentioned list, similar word is merged;
(5) finally Keyword List is obtained.
6. the method for the automatic hyperlink of key word according to claim 2, it is characterized in that: the computing method of described hardware combinations ID are: the id information obtaining environment division hardware according to fixing order, the ID FF that cannot obtain fills, and synthesizes a string character according to this der group; The method of calibration of described hardware combinations ID is: when specifically verifying, and each hardware information is analyzed out and verified separately, and when all hardware informations match more than 50%, just verification is passed through; Not only one may be comprised for some hardware in the equipment had simultaneously, at this moment verify single hardware information, as long as there is a coupling in same item of hardware, namely represent this Hardware match success;
The method of described client unique information is: the information according to unique identification user is come as client id; During verification, the match is successful will to mate just calculation completely; The information of described unique identification user can be E-mail address or phone number.
7. the method for the automatic hyperlink of key word according to claim 2, is characterized in that: automatically collect for key word, and its concrete mode of collecting is as follows:
(1) according to described keyword extraction algorithm, sample data is extracted.
(2) for not matching label and the higher key word of weight ratio, what join the association of this client id does not sort out in key table, and what join the overall situation does not sort out in key data table simultaneously yet;
(3) automatically regularly or manually boot that process is above-mentioned does not sort out key data table process, according to the key word in frequency of occurrences order from high to low successively processing list:
Whether have synonym or near synonym sorted out, if having, then use its label if a) searching this key word, and never classification key table deletes this key word, completes the processing procedure of this key word, otherwise continue step below;
B) obtain the label information of this key word from appointed website or server, if obtain successfully, then use this information, and never sort out in key table and delete this key word, complete the processing procedure of this key word, otherwise, continue step below;
C) point out keeper manual trasaction key label data, complete this key word processing procedure;
(4) do not sort out keyword message for treated, what upgrade corresponding client tag information and these clients does not sort out key table.
8. the method for the automatic hyperlink of key word according to claim 1, is characterized in that: when described user opens application program program according to current configuration determination the need of the judgment mechanism downloading key word from the server of specifying and surpass chain data at least comprise following some:
1) when this locality does not have hyperlink data time, need to download hyperlink data from server;
2) whether the Keyword Tag that contact server detects this client upgrades, if upgraded, needs to download hyperlink data;
3) contact server detect this client corresponding Keyword Tag association hyperlink data whether have updated, if upgraded, need download hyperlink data.
CN201510946128.1A 2015-12-16 2015-12-16 The method of the automatic hyperlink of keyword Active CN105574162B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510946128.1A CN105574162B (en) 2015-12-16 2015-12-16 The method of the automatic hyperlink of keyword

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510946128.1A CN105574162B (en) 2015-12-16 2015-12-16 The method of the automatic hyperlink of keyword

Publications (2)

Publication Number Publication Date
CN105574162A true CN105574162A (en) 2016-05-11
CN105574162B CN105574162B (en) 2019-05-03

Family

ID=55884293

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510946128.1A Active CN105574162B (en) 2015-12-16 2015-12-16 The method of the automatic hyperlink of keyword

Country Status (1)

Country Link
CN (1) CN105574162B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109446443A (en) * 2018-10-18 2019-03-08 武汉斗鱼网络科技有限公司 A kind of tag update method, apparatus, equipment and storage medium
CN109716734A (en) * 2016-09-19 2019-05-03 微软技术许可有限责任公司 Telemetering in computing system drives configuration
CN110020309A (en) * 2017-12-04 2019-07-16 北京搜狗科技发展有限公司 A kind of page processing method and device
CN110096695A (en) * 2018-01-30 2019-08-06 腾讯科技(深圳)有限公司 Hyperlink label method and apparatus, file classification method and device
CN111611411A (en) * 2020-05-14 2020-09-01 安徽新华传媒股份有限公司 Local calling method for interaction with PPT courseware
US20230062267A1 (en) * 2021-08-27 2023-03-02 Rock Cube Holdings LLC Systems and methods for structure-based automated hyperlinking

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1932811A (en) * 2005-09-13 2007-03-21 中时网路科技股份有限公司 System for establising associated keyword interlinking in words of content network site
CN101004737A (en) * 2007-01-24 2007-07-25 贵阳易特软件有限公司 Individualized document processing system based on keywords
CN102567435A (en) * 2010-12-31 2012-07-11 宏碁股份有限公司 Integration method of multimedia information source and hyperlink device and electronic device thereof
WO2015158249A1 (en) * 2014-04-16 2015-10-22 华为技术有限公司 Information processing method, apparatus, and system based on instant messaging

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1932811A (en) * 2005-09-13 2007-03-21 中时网路科技股份有限公司 System for establising associated keyword interlinking in words of content network site
CN101004737A (en) * 2007-01-24 2007-07-25 贵阳易特软件有限公司 Individualized document processing system based on keywords
CN102567435A (en) * 2010-12-31 2012-07-11 宏碁股份有限公司 Integration method of multimedia information source and hyperlink device and electronic device thereof
WO2015158249A1 (en) * 2014-04-16 2015-10-22 华为技术有限公司 Information processing method, apparatus, and system based on instant messaging

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109716734A (en) * 2016-09-19 2019-05-03 微软技术许可有限责任公司 Telemetering in computing system drives configuration
CN109716734B (en) * 2016-09-19 2021-12-03 微软技术许可有限责任公司 Telemetry driver configuration in a computing system
CN110020309A (en) * 2017-12-04 2019-07-16 北京搜狗科技发展有限公司 A kind of page processing method and device
CN110096695A (en) * 2018-01-30 2019-08-06 腾讯科技(深圳)有限公司 Hyperlink label method and apparatus, file classification method and device
CN110096695B (en) * 2018-01-30 2023-01-03 腾讯科技(深圳)有限公司 Hyperlink marking method and device and text classification method and device
CN109446443A (en) * 2018-10-18 2019-03-08 武汉斗鱼网络科技有限公司 A kind of tag update method, apparatus, equipment and storage medium
CN109446443B (en) * 2018-10-18 2021-11-09 武汉斗鱼网络科技有限公司 Label updating method, device, equipment and storage medium
CN111611411A (en) * 2020-05-14 2020-09-01 安徽新华传媒股份有限公司 Local calling method for interaction with PPT courseware
US20230062267A1 (en) * 2021-08-27 2023-03-02 Rock Cube Holdings LLC Systems and methods for structure-based automated hyperlinking
US11954422B2 (en) * 2021-08-27 2024-04-09 Rock Cube Holdings LLC Systems and methods for structure-based automated hyperlinking

Also Published As

Publication number Publication date
CN105574162B (en) 2019-05-03

Similar Documents

Publication Publication Date Title
CN105574162A (en) Automatic hyperlink method of keyword
US9489401B1 (en) Methods and systems for object recognition
JP6423845B2 (en) Method and system for dynamically ranking images to be matched with content in response to a search query
CN102053991B (en) Method and system for multi-language document retrieval
CN103631794B (en) A kind of method, apparatus and equipment for being ranked up to search result
CN107480158A (en) The method and system of the matching of content item and image is assessed based on similarity score
CN107103016A (en) Represent to make the method for image and content matching based on keyword
JP4896268B2 (en) Information retrieval method and apparatus reflecting information value
KR100485321B1 (en) A method of managing web sites registered in search engine and a system thereof
CN107784059A (en) For searching for and selecting the method and system and machine-readable medium of image
US20080228750A1 (en) &#34;Query-log match&#34; relevance features
CN103970800B (en) The extraction processing method and system of webpage associative key
WO2023108980A1 (en) Information push method and device based on text adversarial sample
CN107766399A (en) For the method and system and machine readable media for image is matched with content item
CN107491465A (en) For searching for the method and apparatus and data handling system of content
TWI417751B (en) Information providing device, information providing method, information application program, and information recording medium
CN101310277B (en) Method of obtaining a representation of a text and system
Klein et al. Evaluating methods to rediscover missing web pages from the web infrastructure
CN108681571B (en) Theme crawler system and method based on Word2Vec
CN107766398A (en) For the method, apparatus and data handling system for image is matched with content item
TWI399657B (en) A provider, a method of providing information, a program, and an information recording medium
CN103092945B (en) A kind of searching method and device returned based on interface
Sluban et al. URL Tree: Efficient unsupervised content extraction from streams of web documents
Saberi¹ et al. What does the future of search engine optimization hold?
CN108733687A (en) A kind of information retrieval method and system based on Text region

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