CN107330037B - Keyword optimization method and device and terminal equipment - Google Patents

Keyword optimization method and device and terminal equipment Download PDF

Info

Publication number
CN107330037B
CN107330037B CN201710499583.0A CN201710499583A CN107330037B CN 107330037 B CN107330037 B CN 107330037B CN 201710499583 A CN201710499583 A CN 201710499583A CN 107330037 B CN107330037 B CN 107330037B
Authority
CN
China
Prior art keywords
file
target
words
target associated
currently read
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
Application number
CN201710499583.0A
Other languages
Chinese (zh)
Other versions
CN107330037A (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.)
Beijing Kingsoft Internet Security Software Co Ltd
Original Assignee
Beijing Kingsoft Internet Security Software 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 Beijing Kingsoft Internet Security Software Co Ltd filed Critical Beijing Kingsoft Internet Security Software Co Ltd
Priority to CN201710499583.0A priority Critical patent/CN107330037B/en
Publication of CN107330037A publication Critical patent/CN107330037A/en
Application granted granted Critical
Publication of CN107330037B publication Critical patent/CN107330037B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/958Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
    • 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/951Indexing; Web crawling techniques

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 Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a method, a device, terminal equipment and a storage medium for keyword optimization. The method comprises the following steps: acquiring a first file for storing keywords to be optimized; sequentially reading keywords to be optimized from a first file, taking the currently read keywords to be optimized as first parameters through a first function, and obtaining a plurality of target associated words through a first target tool according to the parameters; writing a plurality of target associated words into a second file in the appointed folder; sequentially reading a plurality of target related words from a second file, taking the currently read target related words as second parameters through a second function, and obtaining the relevance, difficulty value and flow value of the currently read target related words through a second target tool according to the second parameters; creating a table file, writing the plurality of target related words, the relevance of the plurality of target related words, the difficulty value and the flow value into the table file, and outputting the table file.

Description

Keyword optimization method and device and terminal equipment
Technical Field
The invention relates to the technical field of internet, in particular to a method and a device for keyword optimization and terminal equipment.
Background
In the network era of the present time, the production of various applications leads to the flooding of the applications, and the number of the applications forming a basic function can reach hundreds of thousands, so that a new online application can not attract the attention of others, and at the moment, the name and the description of the application play a very important role. Therefore, before a promotion facilitator of an application promotes a certain application, keywords in the name and description of the application need to be optimized to obtain keywords with higher search heat, and the name and description of the application are generated by the keywords with higher search heat, so that the application can have more chances to be presented to a user.
In the related technology, a promotion facilitator of an application program usually manually searches some hotness words, associated words and the like for the application program to be promoted through a website so as to achieve the purpose of keyword optimization. However, the number of the hotness words and the associated words obtained manually is often limited, a large amount of time and cost are consumed, and the efficiency is low. Therefore, how to effectively perform keyword optimization has become an urgent problem to be solved.
Disclosure of Invention
The object of the present invention is to solve at least to some extent one of the above mentioned technical problems.
To this end, a first object of the invention is to propose a method for keyword optimization. The method can acquire enough hot words in an automatic mode so as to achieve the aim of optimizing the keywords, greatly saves labor cost and time cost, and improves efficiency.
A second object of the present invention is to provide an apparatus for keyword optimization.
A third object of the present invention is to provide a terminal device.
A fourth object of the invention is to propose a non-transitory computer-readable storage medium.
In order to achieve the above object, an embodiment of the first aspect of the present invention provides a method for keyword optimization, including: acquiring a first file for storing keywords to be optimized; reading the keywords to be optimized from the first file, taking the currently read keywords to be optimized as first parameters through a first function, and obtaining a plurality of target associated words through a first target tool according to the first parameters; writing the target associated words into a second file in a designated folder; sequentially reading the plurality of target associated words from the second file, taking the currently read target associated words as second parameters through a second function, and obtaining the relevance, difficulty value and flow value of the currently read target associated words through a second target tool according to the second parameters; creating a table file, writing the target related words, the relevance of the target related words, the difficulty value and the flow value into the table file, and outputting the table file.
According to the method for optimizing the keywords, the keywords to be optimized can be read from the first file, the currently read keywords to be optimized serve as first parameters through a first function, the target associated words are obtained through a first target tool according to the first parameters, and the target associated words are written into a second file under an appointed folder; and then, reading the target related word from the second file, taking the currently read target related word as a second parameter through a second function, creating a table file according to the target related word and the currently read target related word as the second parameter through the second function, and according to the relevance, the difficulty value and the flow value of the target related word, writing the target related word, the relevance, the difficulty value and the flow value of the target related word into the table file respectively, and outputting the table file, so that a user can select the most suitable keyword according to the content in the table file, and the ranking list of the application program in the application store and the presentation rate of the search result can be improved through the most suitable keyword. Therefore, enough hot words are obtained in an automatic mode, the purpose of optimizing the keywords is achieved, labor cost and time cost are greatly saved, and efficiency is improved.
According to an embodiment of the present invention, before writing the plurality of target related words in the second file under the specified folder, the method further includes: judging whether a specified folder exists at present; if the specified folder exists currently, writing the target associated words into a second file in the specified folder; and if the specified folder does not exist currently, creating a multilevel directory through a third function to create the specified folder.
According to an embodiment of the present invention, the obtaining, by a second target tool, the relevance, the difficulty value, and the flow value of the currently read target related word according to the second parameter includes: generating URL (uniform resource locator) website link information aiming at the currently read target associated word according to the second parameter and the second target tool; acquiring HTML information of a corresponding website according to the URL website link information; and analyzing the HTML information to obtain the relevance, the difficulty value and the flow value of the currently read target associated word.
According to one embodiment of the present invention, the first function is str (item). strip (), the second function is keyitem. strip (), and the third function is os.mkdir () or os.makedirs ().
In order to achieve the above object, an apparatus for keyword optimization according to an embodiment of the second aspect of the present invention includes: the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a first file for storing keywords to be optimized; the second obtaining module is used for reading the keywords to be optimized from the first file, taking the currently read keywords to be optimized as first parameters through a first function, and obtaining a plurality of target associated words through a first target tool according to the first parameters; the first writing module is used for writing the target associated words into a second file in a specified folder; the third obtaining module is used for sequentially reading the plurality of target associated words from the second file, taking the currently read target associated words as second parameters through a second function, and obtaining the relevance, the difficulty value and the flow value of the currently read target associated words through a second target tool according to the second parameters; the first creating module is used for creating a table file; and the second writing module is used for writing the target associated words, the relevance of the target associated words, the difficulty value and the flow value into the table file and outputting the table file.
According to the device for optimizing the keywords, provided by the embodiment of the invention, the keywords to be optimized can be read from the first file, the currently read keywords to be optimized are taken as first parameters through a first function, the target associated words are obtained through a first target tool according to the first parameters, and the target associated words are written into a second file under a specified folder; and then, reading the target related word from the second file, taking the currently read target related word as a second parameter through a second function, creating a table file according to the target related word and the currently read target related word as the second parameter through the second function, and according to the relevance, the difficulty value and the flow value of the target related word, writing the target related word, the relevance, the difficulty value and the flow value of the target related word into the table file respectively, and outputting the table file, so that a user can select the most suitable keyword according to the content in the table file, and the ranking list of the application program in the application store and the presentation rate of the search result can be improved through the most suitable keyword. Therefore, enough hot words are obtained in an automatic mode, the purpose of optimizing the keywords is achieved, labor cost and time cost are greatly saved, and efficiency is improved.
According to an embodiment of the invention, the apparatus further comprises: the judging module is used for judging whether the specified folder exists at present before writing the target associated words into a second file under the specified folder; the second creating module is used for creating a multilevel directory through a third function to create the specified folder when the specified folder does not exist currently; the first writing module is further configured to write the target related words into a second file in the specified folder when the specified folder currently exists.
According to an embodiment of the invention, the third obtaining module comprises: the generating unit is used for generating URL (Uniform resource locator) website link information aiming at the currently read target associated word according to the second parameter and the second target tool; the first acquisition unit is used for acquiring HTML information of a corresponding website according to the URL website link information; and the second acquisition unit is used for analyzing the HTML information to acquire the relevance, the difficulty value and the flow value of the currently read target relevant word.
According to one embodiment of the present invention, the first function is str (item). strip (), the second function is keyitem. strip (), and the third function is os.mkdir () or os.makedirs ().
In order to achieve the above object, a terminal device according to an embodiment of the third aspect of the present invention includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement the method for keyword optimization according to the embodiment of the first aspect of the present invention.
In order to achieve the above object, a non-transitory computer-readable storage medium is proposed in an embodiment of a fourth aspect of the present invention, on which a computer program is stored, which when executed by a processor implements the method for keyword optimization described in the embodiment of the first aspect of the present invention.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The above and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which,
FIG. 1 is a flow diagram of a method for keyword optimization according to one embodiment of the invention;
FIG. 2 is a schematic structural diagram of an apparatus for keyword optimization according to an embodiment of the present invention;
FIG. 3 is a block diagram of an apparatus for keyword optimization according to an embodiment of the present invention;
FIG. 4 is a block diagram of an apparatus for keyword optimization according to another embodiment of the present invention;
fig. 5 is a schematic structural diagram of a terminal device according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative and intended to be illustrative of the invention and are not to be construed as limiting the invention.
A method, an apparatus, and a terminal device for keyword optimization according to embodiments of the present invention are described below with reference to the accompanying drawings.
FIG. 1 is a flow diagram of a method for keyword optimization according to one embodiment of the invention. It should be noted that the method for keyword optimization according to the embodiment of the present invention is applicable to the apparatus for keyword optimization according to the embodiment of the present invention, and the apparatus may be configured in a terminal device.
As shown in fig. 1, the method for keyword optimization may include:
s110, acquiring a first file for storing the keywords to be optimized.
It is understood that the keywords to be optimized may be pre-configured. That is, the keyword to be optimized may be configured in advance, and stored in the first file. In this way, when keyword optimization is performed, a first file for storing a keyword to be optimized may be acquired first. In the embodiment of the present invention, the number of the keywords to be optimized may be one or more.
As an example, the format type of the first file may be a TXT format. When the number of the keywords to be optimized is multiple, the format of the content in the first file can be written from top to bottom in a keyword-line format. That is, the keywords to be optimized can be written into the first file from top to bottom in a word-line format.
S120, the keywords to be optimized are read from the first file, the currently read keywords to be optimized are used as first parameters through a first function, and a plurality of target associated words are obtained through a first target tool according to the first parameters.
Specifically, the keyword to be optimized may be read from the first file, and the currently read keyword to be optimized is transferred in the first target tool as the first parameter through the first function to obtain the target keyword. In an embodiment of the present invention, the first function may be str (item), strip (), and the first target tool may be a website for searching for relevant words of a word, such as a website in wordasiococcications.
For example, the keyword to be optimized can be read from the first file, and by using the currently read keyword to be optimized, the keyword can be optimized through str (item) · strip () as a parameter at https:///word associations. The button' is transmitted to obtain corresponding web page content information, the web page content information is analyzed through an analyzer (such as beautiful soup) to obtain all relevant words in the web page, and the relevant words obtained through analysis are used as target relevant words corresponding to the currently read keywords to be optimized.
It can be understood that when a plurality of keywords to be optimized are provided, the keywords to be optimized may be sequentially read from the first file in a traversal manner, and the currently read keywords to be optimized are transmitted in the first target tool as the first parameter through the first function, so as to obtain the target keywords corresponding to the currently read keywords to be optimized. Therefore, the target related words corresponding to the keywords to be optimized can be obtained through the steps.
And S130, writing the target related words into a second file in the specified folder.
Specifically, after the target related word corresponding to the keyword to be optimized is obtained, the target related word corresponding to the keyword to be optimized may be written into the second file in the specified folder. Wherein, the format type of the second file can be TXT format.
It should be noted that, before writing the plurality of target related words into the second file under the specified folder, the method may further include: judging whether a specified folder exists at present; if the specified folder exists currently, writing a plurality of target associated words into a second file under the specified folder; and if the specified folder does not exist currently, creating a multilevel directory through a third function to create the specified folder. Wherein, in the embodiment of the present invention, the third function may be os.mkdir () or os.makedirs ().
That is, before writing a plurality of target related words into the second file in the specified folder, it may be determined whether the specified folder exists currently, and if so, the plurality of target related words may be directly written into the second file in the specified folder. If the specified folder does not currently exist, a multi-level directory needs to be created by a third function (e.g., os.mkdir () function or os.makedir () function in python method) to create a specified folder.
And S140, sequentially reading a plurality of target associated words from the second file, taking the currently read target associated words as second parameters through a second function, and obtaining the relevance, difficulty value and flow value of the currently read target associated words through a second target tool according to the second parameters.
Optionally, in an embodiment of the present invention, before sequentially reading the plurality of target related words from the second file, the method may further include: completing the login of the second target tool through a URL transmission tool; after the second target tool is logged in, the step of sequentially reading the plurality of target related words from the second file is executed.
That is to say, a URL transfer tool (such as a pycurl package) may be called first to log in the second target tool, and after the second target tool is logged in, the target associated words may be sequentially read from the second file in a loop manner, and the currently read target associated words may be used as the second parameter through the second function, and the relevance, the difficulty value, and the flow value of the currently read target associated words may be obtained through the second target tool according to the second parameter. Wherein, in an embodiment of the present invention, the second function may be keyitem.
As an example, the specific implementation process of obtaining the relevance, the difficulty value and the flow value of the currently read target related word by the second target tool according to the second parameter may be as follows: generating URL website link information aiming at the currently read target associated word according to the second parameter and a second target tool; acquiring HTML information of a corresponding website according to the URL website link information; and analyzing the HTML information to obtain the relevance, difficulty value and flow value of the currently read target associated word. In an embodiment of the present invention, the second target tool may be a website for searching for a research keyword, such as a sensorwatch.
For example, target related words may be sequentially read from the second file in a round-robin manner, and the currently read target related words may be transmitted in a parameter (e.g., keyitem. strip ()) form through the following link to request a new website:
https://sensortower.com/api/android/ajax/research_keyword?page_index=0&ter m='+keyitem.strip()+'&country=US&realtime=true&app_id=com.cleanmaster.security.applock.halloween'。
and acquiring HTML information of the corresponding website according to the link, and analyzing the HTML information by adopting a beautiful Soup analyzer to obtain the relevance, difficulty value and flow value of the currently read target associated word.
And S150, creating a table file, writing the target related words, the relevance of the target related words, the difficulty value and the flow value into the table file, and outputting the table file.
For example, an open _ workflow () method inside an lxml packet may be used to create an excel form file, and write a plurality of target related words, the relevance of the plurality of target related words, the difficulty value, and the flow value into the form file, and output the form file, so that a user can select the most suitable keyword according to the content in the form file.
For example, assuming that the keyword to be optimized stored in the first file a is secure, the keyword to be optimized secure can be read from the first file, and the keyword secure (item) () strip () is used as a parameter in https:// words. The method includes the steps of transmitting button in Search ' to obtain corresponding webpage content information, analyzing the webpage content information through an analyzer (such as beautifull Soup) to obtain all relevant words in the webpage, taking the relevant words obtained through analysis as target relevant words ' Berth, Encryption, Finaining, Posterity, Safe and Funding ' corresponding to currently read keywords to be optimized, and writing the target relevant words into a second file B under a specified folder. Then, the target related words are sequentially read from the second file B, and the currently read target related words are transmitted in the form of parameters (such as keyitem. strip ()) through the following link to request a new website: https:// sensorlower. com/api/android/ajax/research _ keyword? page _ index ═ 0& term ═ key ═ strip () + & counter ═ US & time ═ com. And acquiring HTML information of the corresponding website according to the link, and analyzing the HTML information by adopting a beautiful Soup analyzer to obtain the relevance, difficulty value and flow value of the currently read target associated word. Then, writing each target related word, and the relevance, difficulty value and flow value of each target related word into a table file C, and outputting the table file C, so that a user can select the most suitable keyword according to the content in the table file. Wherein, the table file C can be expressed as follows:
associated word Relevance Value of difficulty Flow rate value
secure 4.8 9.4 5.4
Berth 3.4 3.6 4.0
Encryption 4.7 7.2 3.4
Financing 4.0 8.0 3.5
Posterity 4.6 4.5 5.8
Safe 5.4 9.1 6.7
Funding 4.3 4.9 5.0
According to the method for optimizing the keywords, the keywords to be optimized can be read from the first file, the currently read keywords to be optimized serve as first parameters through a first function, the target associated words are obtained through a first target tool according to the first parameters, and the target associated words are written into a second file under an appointed folder; and then, reading the target related word from the second file, taking the currently read target related word as a second parameter through a second function, creating a table file according to the target related word and the currently read target related word as the second parameter through the second function, and according to the relevance, the difficulty value and the flow value of the target related word, writing the target related word, the relevance, the difficulty value and the flow value of the target related word into the table file respectively, and outputting the table file, so that a user can select the most suitable keyword according to the content in the table file, and the ranking list of the application program in the application store and the presentation rate of the search result can be improved through the most suitable keyword. Therefore, the preset keywords to be optimized can be perfectly expanded in an automatic mode by finding out associated words so as to obtain enough hot words, the purpose of optimizing the keywords is further achieved, the labor cost and the time cost are greatly saved, and the efficiency is improved.
Corresponding to the methods for keyword optimization provided in the foregoing several embodiments, an embodiment of the present invention further provides an apparatus for keyword optimization, and since the apparatus for keyword optimization provided in the embodiment of the present invention corresponds to the methods for keyword optimization provided in the foregoing several embodiments, the embodiments of the method for keyword optimization described above are also applicable to the apparatus for keyword optimization provided in this embodiment, and will not be described in detail in this embodiment. Fig. 2 is a schematic structural diagram of an apparatus for keyword optimization according to an embodiment of the present invention. As shown in fig. 2, the apparatus for keyword optimization may include: a first obtaining module 210, a second obtaining module 220, a first writing module 230, a third obtaining module 240, a first creating module 250, and a second writing module 260.
Specifically, the first obtaining module 210 is configured to obtain a first file for storing the keyword to be optimized.
The second obtaining module 220 is configured to read a keyword to be optimized from the first file, take the currently read keyword to be optimized as a first parameter through a first function, and obtain a plurality of target associated words through a first target tool according to the first parameter. In an embodiment of the present invention, the first function may be str (item).
The first writing module 230 is configured to write a plurality of target related words into a second file in the specified folder. As an example, as shown in fig. 3, the apparatus may further include: a decision module 270 and a second creation module 280. The judging module 270 is configured to judge whether the specified folder exists currently before writing the plurality of target related words into the second file in the specified folder; the second creating module 280 is configured to create a multi-level directory through a third function to create a designated folder when the designated folder does not exist currently; the first writing module 230 is further configured to, when the specified folder currently exists, write the plurality of target related words into a second file in the specified folder. Wherein, in the embodiment of the present invention, the third function may be os.mkdir () or os.makedirs ().
The third obtaining module 240 is configured to sequentially read a plurality of target related words from the second file, take the currently read target related word as a second parameter through a second function, and obtain relevance, a difficulty value, and a flow value of the currently read target related word through a second target tool according to the second parameter. Wherein, in an embodiment of the present invention, the second function may be keyitem.
As an example, as shown in fig. 4, the third obtaining module 240 may include: a generating unit 241, a first acquiring unit 242, and a second acquiring unit 243. The generating unit 241 is configured to generate URL website link information for the currently read target related word according to the second parameter and the second target tool; the first obtaining unit 242 is configured to obtain HTML information of a corresponding website according to the URL website link information; the second obtaining unit 243 is configured to parse the HTML information to obtain relevance, difficulty value, and flow value of the target relevant word currently read.
The first creation module 250 is used to create a table file.
The second writing module 260 is configured to write the plurality of target related words, the relevance of the plurality of target related words, the difficulty value, and the flow value into the table file, and output the table file.
According to the device for optimizing the keywords, provided by the embodiment of the invention, the keywords to be optimized can be read from the first file, the currently read keywords to be optimized are taken as first parameters through a first function, the target associated words are obtained through a first target tool according to the first parameters, and the target associated words are written into a second file under a specified folder; and then, reading the target related word from the second file, taking the currently read target related word as a second parameter through a second function, creating a table file according to the target related word and the currently read target related word as the second parameter through the second function, and according to the relevance, the difficulty value and the flow value of the target related word, writing the target related word, the relevance, the difficulty value and the flow value of the target related word into the table file respectively, and outputting the table file, so that a user can select the most suitable keyword according to the content in the table file, and the ranking list of the application program in the application store and the presentation rate of the search result can be improved through the most suitable keyword. Therefore, enough hot words are obtained in an automatic mode, the purpose of optimizing the keywords is achieved, labor cost and time cost are greatly saved, and efficiency is improved.
In order to implement the above embodiments, the present invention further provides a terminal device.
Fig. 5 is a schematic structural diagram of a terminal device according to an embodiment of the present invention. As shown in fig. 5, the terminal device 50 may include: a memory 51, a processor 52 and a computer program 53 stored on the memory 51 and executable on the processor 52, wherein the processor 52 implements the method for keyword optimization according to any of the above embodiments of the present invention when executing the program 53.
In order to achieve the above embodiments, the present invention further proposes a non-transitory computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method for keyword optimization according to any of the above embodiments of the present invention.
In the description of the present invention, it is to be understood that the terms "first", "second" and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implying any number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and alternate implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and when the program is executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc. Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.

Claims (8)

1. A method for keyword optimization, comprising the steps of:
acquiring a first file for storing keywords to be optimized;
reading the keywords to be optimized from the first file, taking the currently read keywords to be optimized as first parameters through a first function, and obtaining a plurality of target associated words through a first target tool according to the first parameters;
writing the target associated words into a second file in a designated folder;
sequentially reading the plurality of target associated words from the second file, taking the currently read target associated words as second parameters through a second function, and obtaining the relevance, difficulty value and flow value of the currently read target associated words through a second target tool according to the second parameters; the obtaining of the relevance, the difficulty value and the flow value of the currently read target related word through a second target tool according to the second parameter includes:
generating URL (uniform resource locator) website link information aiming at the currently read target associated word according to the second parameter and the second target tool;
acquiring HTML information of a corresponding website according to the URL website link information;
analyzing the HTML information to obtain the relevance, the difficulty value and the flow value of the currently read target associated word;
creating a table file, writing the target related words, the relevance of the target related words, the difficulty value and the flow value into the table file, and outputting the table file.
2. The method of claim 1, wherein before writing the plurality of target related words into the second file under a specified folder, the method further comprises:
judging whether a specified folder exists at present;
if the specified folder exists currently, writing the target associated words into a second file in the specified folder;
and if the specified folder does not exist currently, creating a multilevel directory through a third function to create the specified folder.
3. The method of claim 2, wherein the first function is str (item).
4. An apparatus for keyword optimization, comprising:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a first file for storing keywords to be optimized;
the second obtaining module is used for reading the keywords to be optimized from the first file, taking the currently read keywords to be optimized as first parameters through a first function, and obtaining a plurality of target associated words through a first target tool according to the first parameters;
the first writing module is used for writing the target associated words into a second file in a specified folder;
the third obtaining module is used for sequentially reading the plurality of target associated words from the second file, taking the currently read target associated words as second parameters through a second function, and obtaining the relevance, the difficulty value and the flow value of the currently read target associated words through a second target tool according to the second parameters; wherein the third obtaining module comprises:
the generating unit is used for generating URL (Uniform resource locator) website link information aiming at the currently read target associated word according to the second parameter and the second target tool;
the first acquisition unit is used for acquiring HTML information of a corresponding website according to the URL website link information;
the second acquisition unit is used for analyzing the HTML information to acquire the relevance, the difficulty value and the flow value of the currently read target associated word;
the first creating module is used for creating a table file;
and the second writing module is used for writing the target associated words, the relevance of the target associated words, the difficulty value and the flow value into the table file and outputting the table file.
5. The apparatus of claim 4, further comprising:
the judging module is used for judging whether the specified folder exists at present before writing the target associated words into a second file under the specified folder;
the second creating module is used for creating a multilevel directory through a third function to create the specified folder when the specified folder does not exist currently;
the first writing module is further configured to write the target related words into a second file in the specified folder when the specified folder currently exists.
6. The apparatus of claim 5, wherein the first function is str (item).
7. A terminal device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor, when executing the program, implements a method for keyword optimization according to any one of claims 1 to 3.
8. A non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the method for keyword optimization according to any one of claims 1 to 3.
CN201710499583.0A 2017-06-27 2017-06-27 Keyword optimization method and device and terminal equipment Active CN107330037B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710499583.0A CN107330037B (en) 2017-06-27 2017-06-27 Keyword optimization method and device and terminal equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710499583.0A CN107330037B (en) 2017-06-27 2017-06-27 Keyword optimization method and device and terminal equipment

Publications (2)

Publication Number Publication Date
CN107330037A CN107330037A (en) 2017-11-07
CN107330037B true CN107330037B (en) 2020-03-27

Family

ID=60197611

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710499583.0A Active CN107330037B (en) 2017-06-27 2017-06-27 Keyword optimization method and device and terminal equipment

Country Status (1)

Country Link
CN (1) CN107330037B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101694666A (en) * 2009-07-17 2010-04-14 刘二中 Method for inputting and processing characteristic words of file contents
CN105843850A (en) * 2016-03-15 2016-08-10 北京百度网讯科技有限公司 Searching optimization method and device
CN106547906A (en) * 2016-11-10 2017-03-29 乐视控股(北京)有限公司 Content of pages generation method, device and terminal
CN106844371A (en) * 2015-12-03 2017-06-13 阿里巴巴集团控股有限公司 Chess game optimization method and apparatus
CN106874377A (en) * 2017-01-04 2017-06-20 四川用联信息技术有限公司 The improved clustering algorithm based on constraints realizes that search engine keywords optimize

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10496662B2 (en) * 2015-08-28 2019-12-03 Microsoft Technology Licensing, Llc Generating relevance scores for keywords
US20170148107A1 (en) * 2015-11-23 2017-05-25 Linkedln Corporation Prioritizing search terms representing locations

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101694666A (en) * 2009-07-17 2010-04-14 刘二中 Method for inputting and processing characteristic words of file contents
CN106844371A (en) * 2015-12-03 2017-06-13 阿里巴巴集团控股有限公司 Chess game optimization method and apparatus
CN105843850A (en) * 2016-03-15 2016-08-10 北京百度网讯科技有限公司 Searching optimization method and device
CN106547906A (en) * 2016-11-10 2017-03-29 乐视控股(北京)有限公司 Content of pages generation method, device and terminal
CN106874377A (en) * 2017-01-04 2017-06-20 四川用联信息技术有限公司 The improved clustering algorithm based on constraints realizes that search engine keywords optimize

Also Published As

Publication number Publication date
CN107330037A (en) 2017-11-07

Similar Documents

Publication Publication Date Title
US9886500B2 (en) System and method for providing technology assisted data review with optimizing features
JP2018077879A5 (en)
KR102036392B1 (en) Managing script file dependencies and load times
US8560519B2 (en) Indexing and searching employing virtual documents
CN103914529B (en) Search exhibiting method and device
US10713330B2 (en) Optimized browser render process
US9792370B2 (en) Identifying equivalent links on a page
US9514113B1 (en) Methods for automatic footnote generation
JP6932360B2 (en) Object search method, device and server
US20200074509A1 (en) Business data promotion method, device, terminal and computer-readable storage medium
US9741018B2 (en) Systems and methods for extracting similar group elements
CN110704418A (en) Block chain information query method, device and equipment
CN113220657B (en) Data processing method and device and computer equipment
CN105528218A (en) Data diagram cascaded method and data diagram cascaded system
US20160063061A1 (en) Ranking documents with topics within graph
CN110969000B (en) Data merging processing method and device
US8712992B2 (en) Method and apparatus for web crawling
US9092338B1 (en) Multi-level caching event lookup
CN105354344A (en) SEO (search engine optimization) system and method
CN107330037B (en) Keyword optimization method and device and terminal equipment
CN105243073A (en) Bookmark access method and device and terminal
CN110019357B (en) Database query script generation method and device
US11403315B2 (en) Reporting and knowledge discovery for databases
CN109190003B (en) Method and apparatus for determining list page nodes
CN107656985B (en) Webpage query method and system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant