A keyword optimization method, device, equipment and readable storage medium

By filtering and combining the keywords of the application, the problem of manual writing of keywords in the prior art is solved, and the effect of improving the visibility and competitiveness of the application is achieved.

CN119025716BActive Publication Date: 2025-02-25GUANGZHOU YINGFENG NETWORK TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202411106624.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-12
Publication Date
2025-02-25
Estimated Expiration
2044-08-12

AI Technical Summary

Technical Problem

In the prior art, the keyword writing of applications relies on manual labor, which consumes a lot of manpower and is difficult to guarantee, reducing the competitiveness of applications.

Method used

By obtaining the current keywords and evaluation indicators of the target application, filtering out efficient keywords, and building a keyword lexicon based on the keywords of the reference application, and combining them to determine the keyword sequence of the target application.

Benefits of technology

It realizes efficient and accurate keyword selection and combination, saves manpower and time costs, and improves the visibility and competitiveness of the application.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119025716B_ABST
    Figure CN119025716B_ABST
Patent Text Reader

Abstract

This specification discloses a keyword optimization method, device, equipment and readable storage medium, which obtains each current keyword of the target application and the evaluation index corresponding to each current keyword, the evaluation index includes at least one of search indication, search index, search result ranking and download volume, and filters each current keyword according to the evaluation index, builds a keyword thesaurus based on each filtered current keyword and each reference keyword of the reference application related to the target application, and combines each keyword in the keyword thesaurus to obtain a keyword sequence of the target application. It can be seen that based on the above scheme, by filtering the current keywords through the evaluation index and combining the reference keywords to build the keyword thesaurus, efficient and accurate keyword selection and combination are achieved, saving manpower and time costs, and further improving the visibility and competitiveness of the target application.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a keyword optimization method, device, equipment and readable storage medium. Background Art

[0002] With the rapid development of computer technology, more and more applications are available on application download platforms, providing users with various types of functions and services. Generally, users will enter search terms on the application download platform, and the application download platform will display multiple applications related to the search terms to meet the user's application download needs. Application developers can write keywords for the application so that the application can appear in the search results of various search terms and rank high in the search results to increase the exposure and download volume of the application.

[0003] Currently, keywords for applications are usually determined based on manually written methods.

[0004] However, this method not only consumes a lot of manpower, but also the effect of the keywords written on improving the exposure and download volume of the application is difficult to guarantee, which greatly reduces the competitiveness of the application.

[0005] Based on this, this specification provides a keyword optimization method. Summary of the invention

[0006] This specification provides a keyword optimization method, device, equipment and readable storage medium to partially solve the above-mentioned problems existing in the prior art.

[0007] This manual adopts the following technical solutions:

[0008] This specification provides a keyword optimization method, including:

[0009] Get the current keywords of the target application;

[0010] Obtaining evaluation indicators corresponding to the current keywords, and filtering the current keywords according to the evaluation indicators corresponding to the current keywords, wherein the evaluation indicators include at least one of a search index, a search result ranking, and a download volume;

[0011] Acquire reference keywords corresponding to reference applications related to the target application;

[0012] Building a keyword thesaurus based on the screened current keywords and the reference keywords;

[0013] The keywords contained in the keyword library are combined to determine a keyword sequence of the target application.

[0014] Optionally, combining the keywords contained in the keyword library to determine the keyword sequence of the target application specifically includes:

[0015] Iterative execution: according to the current last several words in each word contained in the keyword sequence of the target application, from each keyword contained in the keyword word library, search for keywords whose first several words are the same as the current last several words, splice the found keywords to the end of the keyword sequence of the target application, and delete the repeated several words at the splicing, until the number of words corresponding to the keyword sequence of the target application reaches a preset word limit;

[0016] The first keyword included in the keyword sequence of the target application is the keyword with the highest priority in the keyword library.

[0017] Optionally, before combining the keywords included in the keyword library to determine the keyword sequence of the target application, the method further includes:

[0018] Determine the priorities of the selected current keywords according to the evaluation indicators respectively corresponding to the selected current keywords;

[0019] Obtaining the evaluation indicators corresponding to the reference keywords according to the types of indicators included in the evaluation indicators corresponding to the selected current keywords;

[0020] The priorities respectively corresponding to the reference keywords are determined according to the evaluation indicators respectively corresponding to the reference keywords.

[0021] Optionally, the step of adding the found keyword to the end of the keyword sequence of the target application specifically includes:

[0022] When multiple keywords are found, according to the priorities corresponding to the found keywords, the keyword with the highest priority among the found keywords is spliced ​​to the end of the keyword sequence of the target application.

[0023] Optionally, after constructing a keyword thesaurus according to the screened current keywords and the reference keywords, and before combining the keywords included in the keyword thesaurus to determine the keyword sequence of the target application, the method further includes:

[0024] Detecting each keyword in the keyword database and removing keywords that do not meet preset conditions;

[0025] Among them, the keywords that do not meet the preset conditions include at least one of keywords with repeated words, keywords with repeated pronunciations, keywords that hit sensitive words, and keywords that fall into a preset blacklist.

[0026] Optionally, the step of constructing a keyword thesaurus based on the screened current keywords and the reference keywords specifically includes:

[0027] Obtain user comments on the target application;

[0028] Extracting a plurality of candidate keywords from user comments on the target application, wherein the candidate keywords at least include a description of the target application by the user;

[0029] Constructing a plurality of long-tail keywords according to the plurality of candidate keywords, wherein the number of characters of the long-tail keywords is greater than the number of characters of the current keyword;

[0030] A keyword thesaurus is constructed based on the screened current keywords, the reference keywords and the long-tail keywords.

[0031] Optionally, the method further comprises:

[0032] Determine the keyword update cycle;

[0033] When the duration of using the keyword sequence as the keyword of the target application exceeds the keyword update period, the evaluation index corresponding to each keyword contained in the keyword sequence is obtained, and the keyword thesaurus is updated according to the obtained evaluation index, and the keyword sequence of the target application is re-determined according to the updated keyword thesaurus.

[0034] This specification provides a keyword optimization device, including:

[0035] A current keyword acquisition module is used to acquire the current keywords of the target application;

[0036] An evaluation index acquisition module, used to acquire evaluation indexes corresponding to the current keywords, wherein the evaluation indexes include at least one of a search index, a search result ranking, and a download volume;

[0037] A reference keyword acquisition module, used to acquire reference keywords corresponding to reference applications related to the target application;

[0038] A keyword thesaurus building module, used to filter the current keywords according to the evaluation indicators respectively corresponding to the current keywords, and build a keyword thesaurus according to the filtered current keywords and the reference keywords;

[0039] The keyword sequence determination module is used to combine the keywords contained in the keyword vocabulary to determine the keyword sequence of the target application.

[0040] This specification provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the above keyword optimization method is implemented.

[0041] This specification provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned keyword optimization method when executing the program.

[0042] At least one of the above technical solutions adopted in this specification can achieve the following beneficial effects:

[0043] In the keyword optimization method provided in this specification, each current keyword of the target application and the evaluation index corresponding to each current keyword are obtained, and the evaluation index includes at least one of the search indication, search index, search result ranking, and download volume. Each current keyword is screened according to the evaluation index, and a keyword thesaurus is constructed according to each screened current keyword and each reference keyword of the reference application related to the target application. Each keyword in the keyword thesaurus is combined to obtain a keyword sequence of the target application. It can be seen that based on the above scheme, the current keywords are screened by the evaluation index, and the keyword thesaurus is constructed in combination with the reference keywords, which realizes efficient and accurate keyword selection and combination, saves manpower and time costs, and further improves the visibility and competitiveness of the target application. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] The drawings described herein are used to provide a further understanding of this specification and constitute a part of this specification. The exemplary embodiments and descriptions of this specification are used to explain this specification and do not constitute an improper limitation on this specification.

[0045] In the figure:

[0046] Figure 1 A flowchart of a keyword optimization method in this specification;

[0047] Figure 2 A flowchart of a keyword optimization method in this specification;

[0048] Figure 3 A flowchart of a keyword optimization method in this specification;

[0049] Figure 4 A schematic diagram of a keyword optimization device provided in this specification;

[0050] Figure 5 The corresponding Figure 1 Schematic diagram of electronic equipment. DETAILED DESCRIPTION

[0051] In order to make the purpose, technical solutions and advantages of this specification more clear, the technical solutions of this specification will be clearly and completely described below in combination with the specific embodiments of this specification and the corresponding drawings. Obviously, the described embodiments are only part of the embodiments of this specification, not all of them. Based on the embodiments in this specification, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this specification.

[0052] In addition, it should be noted that all actions of acquiring signals, information or data in this manual are performed in compliance with the relevant local data protection laws and policies and with the authorization given by the owner of the corresponding device.

[0053] It should be noted that, in the absence of conflict, the features in the following embodiments and implementations may be combined with each other.

[0054] The technical solutions provided by the embodiments of this specification are described in detail below in conjunction with the accompanying drawings.

[0055] Figure 1 A flowchart of a keyword optimization method provided in this specification.

[0056] S100: Acquire current keywords of the target application.

[0057] In the embodiments of this specification, a keyword optimization method is provided, and the execution process of the method can be performed by an electronic device such as a server for keyword optimization, and this specification does not limit the specific type of the electronic device. For the sake of convenience, this specification describes the specific technical solution with the execution subject being the server.

[0058] In actual applications, search engines or application download platforms can provide application developers with a developer backend for them to upload, modify, and maintain their own developed applications and related information. In the developer backend, application developers can enter and upload one or more keywords of their own developed applications. When users search for applications through search engines or application download platforms, if the search terms entered by the users can hit the application keywords, the applications whose keywords hit the search terms can be displayed to the users, so that the users can select one or more applications that meet their own search intentions from the various applications included in the search results for download.

[0059] Based on this scenario, the keyword optimization method provided in this specification can automatically and efficiently select keywords suitable for the target application, combine these keywords to obtain a keyword sequence, and use the keyword sequence as the keyword input of the target application and upload it to the search engine or the developer backend of the application download platform. Through this method, manpower and time costs are saved, the efficiency of keyword construction is improved, and the probability and ranking of the target application appearing in the search results of the application store / search engine are increased, thereby increasing the exposure of the target application.

[0060] Specifically, the target application in this specification can be any type of existing application program, such as entertainment and game applications, social communication applications, education and learning applications, life service applications, etc. This specification does not limit the specific type of the target application.

[0061] The server can automatically obtain the current keywords of the target application from the developer of the search engine / application download platform. The current keywords can be manually written and input by the developer at a historical moment, or can be automatically generated and input by executing the method provided in this specification or other methods at a historical moment, where the historical moment is the moment before executing this step. This specification does not limit the time between the last input of the keyword of the target application and the current execution of step S100.

[0062] In addition, in actual applications, a target application can be listed on different search engines and different application download platforms respectively. In each different search engine or each different application download platform, the same target application can correspond to the same or different current keywords. Therefore, in step S100, the server can obtain the current keywords corresponding to the target application in different search engines and different application download platforms from the developer backends of different search engines and different application download platforms.

[0063] According to different keyword input rules, the current keywords of the target application can be independent words separated by specific symbols, and the independent words can be directly used as the current keywords. The current keywords of the target application can also be word sequences that are not separated by any symbols. If a word sequence is obtained, it is necessary to use a word segmentation tool to segment the word sequence to obtain the current keywords of the target application. It should be noted that in the keyword optimization method provided in this specification, what is finally obtained is the keyword sequence of the target application. This is because the scenario applicable to this method can be that the search engine / application download platform supports the use of word sequences that are not separated by any symbols as keywords of the target application, but it does not mean that the current keywords of the target application obtained in step S100 must be word sequences. In fact, they can be independent words separated by specific symbols.

[0064] S102: Obtain evaluation indicators corresponding to the current keywords, and filter the current keywords according to the evaluation indicators corresponding to the current keywords, wherein the evaluation indicators include at least one of a search index, a search result ranking, and a download volume.

[0065] Further, the evaluation index corresponding to each current keyword is obtained respectively, and the evaluation index can reflect the degree of adaptation and excellence of the corresponding current keyword to the target application in terms of user attention, relevance to the target application, competitiveness in the field corresponding to the current keyword, and promotion of downloading the target application. The evaluation index may include one or more of the search index, search result ranking, and download volume, and of course may also include other types of indicators, such as search click-through rate, competitiveness, search volume, user retention rate, bounce rate, etc. This specification does not limit the specific types of each indicator included in this evaluation index.

[0066] Generally, the evaluation index of the current keyword is better, and the effect of the current keyword on exposing / downloading the target application is better. That is, the higher the evaluation index of the current keyword is, the more users will search for the target application through the current keyword, and the probability of the target application being exposed and downloaded will be greater or the number of times will be greater. Conversely, the lower the evaluation index of the current keyword is, the fewer users will search for the target application through the current keyword, and the probability of the target application being exposed and downloaded will be smaller or the number of times will be smaller.

[0067] Specifically, the search index measures the search frequency or search popularity of the current keyword. By quantifying the search index, it can reflect the content or field of interest of users in a certain period of time. The search index can be used to analyze the popularity and search trends of the current keyword. Generally speaking, the higher the search index, the more frequently the corresponding current keyword is hit by the search term entered by the user, and the more interested the user is in the current keyword.

[0068] The search result ranking reflects the ranking of the target application in the search results when the search term entered by the user hits the current keyword. The higher the search result ranking, the more accurately the current keyword can describe the target application. When the target application uses the current keyword as the search keyword, the target application has a higher exposure rate and click-through rate, and is more likely to be seen by users.

[0069] The download volume represents the number of users who see, click, and then download the target application when the search term entered by the user hits the current keyword. The higher the download volume, the better the effect of the current keyword in attracting actual download users for the target application.

[0070] Furthermore, in this specification, the optimization of keywords for the target application is due to the fact that some of the current keywords of the target application are not adapted to market changes, cannot cope with competitive situations, or have poor actual conversions. It is necessary to eliminate these current keywords, or introduce new keywords to obtain new keyword sequences, thereby improving conversion rates and downloads, and bringing more users and retention to the target application.

[0071] Based on this, each current keyword is screened according to the evaluation index corresponding to each current keyword, and the current keywords with better effects are retained, and the current keywords with poor effects are eliminated. The screening method can be to determine the evaluation index threshold, and for each current keyword, determine whether the evaluation index of the current keyword is higher than the evaluation index threshold, if so, retain the current keyword, if not, eliminate the current keyword.

[0072] Among them, if the evaluation index of the current keyword is composed of multiple types of indicators, the indicator threshold corresponding to each type of indicator can be obtained respectively, and for each type of indicator included in the evaluation index of a current keyword, it is judged whether the indicator of this type is higher than the indicator threshold corresponding to this type of indicator, so as to determine whether the current keyword is eliminated based on the judgment result. For example, the current keyword will be retained only when each type of indicator included in the evaluation index of the current keyword is higher than the corresponding indicator threshold. When one or more types of indicators in the various types of indicators included in the evaluation index of the current keyword are not higher than the corresponding indicator threshold, the current keyword will be eliminated. The above is only an optional judgment method. The specific method of judging whether the current keyword is retained can be determined according to the specific application scenario, and this specification does not limit this.

[0073] S104: Acquire reference keywords corresponding to reference applications related to the target application.

[0074] Furthermore, when constructing or updating the keyword sequence of the target application, the information of each reference application related to the target application can also be introduced. Specifically, each reference application related to the target application can be other application programs that are similar to the target application in one or more aspects such as function, application type, target audience, keyword overlap, profit model, etc. For example, if the target application is a health management application, each reference application related to the target application can be a diet record application, a sports tracking application, etc.

[0075] The method for obtaining reference keywords is similar to the aforementioned step S100 and will not be described again here.

[0076] In addition, the reference keywords may also be other words such as the application name of each reference application, the industry to which each reference application belongs, the function implemented by each reference application, etc., and this specification does not limit this.

[0077] Of course, not all reference keywords obtained may be stored in the keyword thesaurus. It is also possible to obtain evaluation indicators for reference keywords and screen each reference keyword according to the evaluation indicators to obtain screened reference keywords to execute the subsequent method of constructing a keyword thesaurus.

[0078] In an optional embodiment of the present specification, if the target application is a newly developed application and has not been published or listed on any search engine or application download platform, it will be impossible to obtain the current keywords of the target application. At this time, steps S100 to S102 are directly skipped and step S104 is directly executed. Therefore, the keyword library of the target application at this time only contains the reference keywords.

[0079] S106: constructing a keyword thesaurus according to the screened current keywords and the reference keywords.

[0080] Afterwards, the screened current keywords and reference keywords are stored in the keyword thesaurus. In the keyword thesaurus, the source of each keyword and the evaluation index corresponding to each keyword can also be stored. Thus, the keywords can be grouped according to the source of the keywords or the evaluation index corresponding to the keywords. For example, the screened current keywords are divided into the same group, the reference keywords belonging to the same reference application function are divided into the same group, and the name of the application is marked for each group. Alternatively, multiple evaluation index intervals can be divided, and multiple keywords whose evaluation indexes fall into the same evaluation index interval are divided into the same group, and the corresponding evaluation index interval is marked for each group. Of course, each keyword in the keyword thesaurus can also be marked with the name of the application to which it belongs, as well as the corresponding evaluation index.

[0081] In an optional embodiment of this specification, Figure 1In the keyword word library established in step S106, there may be keywords that do not meet the search requirements of the target application. In order to improve the accuracy of the keyword sequence, it is necessary to process the keyword word library before executing S108 to remove keywords that do not meet the requirements. Specifically, each keyword in the keyword word library is detected, and keywords that do not meet the preset conditions are removed. Among them, the detection means for detecting each keyword in the keyword word library can be word repetition detection, that is, determining multiple repeated keywords, retaining one of them, and removing other repeated keywords; it can be pronunciation repetition detection, that is, determining multiple keywords with repeated pronunciation, retaining one of them, and removing other keywords with repeated pronunciation; it can be sensitive word detection, that is, using artificial intelligence methods or comparing with preset sensitive word word libraries to detect whether each keyword in the keyword word library belongs to a sensitive word, and remove the keywords belonging to sensitive words to meet compliance requirements; it can be blacklist detection, that is, comparing each keyword in the keyword word library with the words in the blacklist, and removing keywords that are the same or similar to the words in the blacklist. This specification does not limit the specific type and number of detection means used. Therefore, the keywords that do not meet the preset conditions include at least one of keywords with repeated words, keywords with repeated pronunciations, keywords that hit sensitive words, and keywords that fall into a preset blacklist.

[0082] S108: Combining the keywords contained in the keyword database to determine a keyword sequence of the target application.

[0083] Afterwards, multiple keywords are selected from the keyword word library and arranged and combined to form a keyword sequence. The method of selecting keywords from the keyword word library can be screening based on evaluation indicators or based on the source of keywords. The arrangement and combination method can be random arrangement, or it can be arranged from high to low based on evaluation indicators, or it can be arranged in a way that the current keyword comes first and the reference keyword comes later. This specification does not limit the specific selection method and arrangement method.

[0084] In actual applications, if the search engine / application download platform supports automatic word segmentation of keywords, no symbols may be used to separate the keywords in the constructed keyword sequence. If the search engine / application download platform does not support automatic word segmentation of keywords, or the word segmentation effect is poor, specific separators such as commas and semicolons may be used to separate the keywords in the keyword sequence.

[0085] In an optional embodiment of the present specification, after the keyword sequence of the target application is input as the search keyword of the target application into the developer backend of the search engine or application download platform, as long as the search term input by the user hits a number of continuous or discontinuous characters in the keyword sequence, the target application will appear in the search results displayed to the user by the search engine or application download platform. In order to maintain the timeliness and relevance of the keyword sequence, the keyword thesaurus can also be regularly updated according to new user feedback and market changes. An optional implementation method can be as follows:

[0086] First, determine the keyword update cycle.

[0087] The keyword update cycle can be determined based on the keyword update frequency allowed by the search engine or application download platform, as well as the actual application scenario, such as the changing pattern of hot search topics, the changing cycle of industry trends, the version update of the target application, etc. The keyword update cycle can be a fixed value or a variable value, which is not limited in this specification.

[0088] Secondly, when the duration of using the keyword sequence as the keyword of the target application exceeds the keyword update period, the evaluation indicators corresponding to each keyword contained in the keyword sequence are obtained, and the keyword thesaurus is updated according to the obtained evaluation indicators, and the keyword sequence of the target application is re-determined according to the updated keyword thesaurus.

[0089] Specifically, in Figure 1 After the keyword sequence is determined in step S108, the developer of the target application can input and upload the keyword sequence through the developer background of the search engine / application download platform, and use the keyword sequence as the keyword of the target application. As long as the search term input by the user hits several consecutive or non-consecutive words in the keyword sequence, the target application can be displayed in the search results displayed to the user. When the duration of using the keyword sequence as the keyword of the target application exceeds the keyword update cycle, the execution can be repeated. Figure 1 Steps S100 to S108 are shown to retrieve the keyword sequence.

[0090] In the keyword optimization method provided in this specification, each current keyword of the target application and the evaluation index corresponding to each current keyword are obtained, and the evaluation index includes at least one of the search indication, search index, search result ranking, and download volume. Each current keyword is screened according to the evaluation index, and a keyword thesaurus is constructed according to the screened current keywords and the reference keywords of the reference application related to the target application. The keywords in the keyword thesaurus are combined to obtain a keyword sequence of the target application.

[0091] It can be seen that based on the above scheme, by screening the current keywords through evaluation indicators and building a keyword thesaurus in combination with reference keywords, efficient and accurate keyword selection and combination are achieved, which saves manpower and time costs and further improves the visibility and competitiveness of the target application.

[0092] In one or more embodiments of this specification, Figure 1 In step S108, the keywords included in the keyword library are combined to determine the keyword sequence of the target application. The combination of keywords can be in a form similar to "word chain" to fill in as many keywords as possible in the scenario where the keyword has a word limit to improve the search visibility of the target application. The specific implementation method can be as follows: Figure 2 As shown:

[0093] S200: searching for keywords whose first several characters are the same as the current last several characters from among the keywords in the keyword sequence of the target application.

[0094] Specifically, in order to use as many keywords as possible to construct a keyword sequence within the preset word limit, in addition to not using any symbols to separate the keywords, multiple keywords with repeated words can be spliced ​​together, and then the repeated words can be deleted, so that the number of words corresponding to the repeated words can be saved. This keyword combination method similar to "word chain" can reduce the character usage when more keywords are used to construct a keyword sequence. When the keyword sequence contains more keywords, the keyword sequence as the keyword of the target application can increase the probability that the search term entered by the user hits the keyword of the target application, thereby increasing the exposure and visibility of the target application.

[0095] In addition, when determining the keyword sequence, the evaluation index corresponding to each keyword in the keyword word library can also be considered. In this specification, by determining the priority according to the evaluation index corresponding to the keyword, the effect of improving the exposure rate and download volume of the target application when each keyword in the keyword word library is placed in the keyword sequence is evaluated. In other words, the higher the priority corresponding to the keyword, the more beneficial it is to put the keyword into the keyword sequence for the exposure and download of the target application.

[0096] Therefore, before selecting the keywords used to construct the keyword sequence from the keywords included in the keyword word library, the priority of the keyword is determined according to the evaluation index corresponding to the keyword. The keywords are sorted in descending order according to the priority corresponding to each keyword. Therefore, the keyword with the highest priority is used as the first keyword of the keyword sequence of the target application.

[0097] In the keyword combination method similar to "word chain" adopted in this specification, it is necessary to determine the next keyword to be put into the keyword sequence according to the last several characters of each character already put into the keyword sequence. Therefore, according to the current last several characters of each character included in the keyword sequence, the keyword whose first several characters are the same as the current last several characters is searched from each keyword included in the keyword word library.

[0098] In addition, if, based on the current last several words of the keywords included in the keyword sequence, a keyword whose first several words are the same as the current last several words cannot be found from the keywords included in the keyword thesaurus, then the keyword with the highest priority among the keywords in the keyword thesaurus that are not filled in the keyword sequence can be used as the found keyword.

[0099] S202: Splice the found keywords to the end of the keyword sequence of the target application, and delete a number of repeated words at the splicing position.

[0100] Then, the found keywords are spliced ​​to the end of the keyword sequence. At this time, it is just a direct splicing, and there will be repeated words at the splicing. Therefore, the repeated words at the splicing are deleted, so that as many keywords as possible can be filled in without changing the semantics of the keywords.

[0101] In addition, in an optional embodiment of the present specification, when multiple keywords are found based on the current last several words, the keyword with the highest priority among the found keywords can be spliced ​​to the end of the keyword sequence of the target application according to the priority corresponding to each of the found keywords.

[0102] S204: Determine whether the number of words corresponding to the keyword sequence after deleting repeated words reaches a preset upper limit of the number of words. If so, execute step S206; otherwise, return to execute step S200.

[0103] This keyword combination method provided in this specification is suitable for the scenario where the search engine or application download platform has a word limit on the keywords of the target application. Therefore, the preset word limit specified by the search engine or application download platform on which the target application is published or put on the shelf can be obtained. After splicing the found keywords to the end of the keyword sequence and deleting duplicate words, it is determined whether the number of words contained in the currently constructed keyword sequence has reached the preset word limit. If the number of words contained in the currently constructed keyword sequence has reached the preset word limit, it means that keywords can no longer be filled into the keyword sequence. At this time, step S206 can be directly executed, and the keyword sequence with the number of words constructed that has reached the preset word limit is used as the keyword sequence of the target application. If the number of words contained in the currently constructed keyword sequence does not reach the preset word limit, it means that keywords can still be filled into the keyword sequence. At this time, step S200 can be returned to repeat the aforementioned process of searching for keywords, splicing, and deleting duplicate words until the number of words contained in the keyword sequence reaches the preset word limit.

[0104] S206: Using the keyword sequence whose word count reaches the preset word count upper limit as the keyword sequence of the target application, wherein the first keyword included in the keyword sequence of the target application is the keyword with the highest priority in the keyword database.

[0105] Different preset word limits can be obtained according to the search engine or application download platform where the target application is published or listed. Thus, the above method can be repeatedly used to construct keyword sequences of the target application that meet different preset word limits.

[0106] For example, the target application is sports software. The keyword thesaurus corresponding to the target application contains the three keywords "physical health", "rehabilitation exercise", and "fitness". It is determined that the keyword "fitness" has the highest priority. Then the first keyword in the keyword sequence of the target application is "fitness". Then, according to the last word "body" in the keyword "fitness" already included in the keyword sequence, the keyword whose first word is "body" is searched from the keyword thesaurus, and the keyword found is physical health. Then the keyword "physical health" is spliced ​​to the end of the keyword sequence, and the repeated word "body" at the splicing is deleted. Thus, the keyword sequence "fitness and physical health" is obtained. Then return to step S200, that is, according to the last word "kang" in each word included in the keyword sequence, the keyword whose first word is "kang" is searched from the keyword thesaurus, and the keyword found is rehabilitation exercise. Then execute step S202 again to splice "rehabilitation exercise" to the end of the keyword sequence, and then delete the repeated "kang" at the splicing, so as to obtain the keyword sequence "fitness and physical health and rehabilitation exercise". This iteration is repeated until the number of words contained in the keyword sequence reaches the preset upper limit of the number of words.

[0107] based on Figure 2 The method shown fills in as many keywords as possible in the keyword word library in the scenario where the keyword has a word limit, so that the keyword sequence of the target application contains more keywords, thereby increasing the possibility of the target application being searched. In addition, through this combination method, the combination of keywords is automatically and efficiently completed, reducing labor costs.

[0108] In one or more embodiments of this specification, Figure 2 In the keyword combination scheme shown, the first keyword included in the keyword sequence can be the keyword with the highest priority in the keyword thesaurus, wherein the priority of the keyword can be used to characterize the relevance of the keyword to the target application, the importance of the keyword to the target application, and the probability that the target application is in the search results when the keyword is used as the search term. That is, the more relevant the keyword is to the target application, the more important it is to the target application, and the greater the probability that the target application is in the search results when the keyword is used as the search term, the higher the priority of the keyword. In short, the higher the priority of the keyword is filled into the keyword sequence of the target application, the higher the probability of the target application being searched, and the higher the ranking in the search results.

[0109] Based on this, Figure 2 In the keyword combination scheme shown in FIG. 1 , the keyword priority is introduced, and the keywords are combined based on the keyword priority to further improve the optimization effect of the keyword sequence. Figure 2 The keyword combination scheme shown introduces the priority of keywords, so it is necessary to determine the priority of each keyword in the keyword word library before combining the keywords contained in the keyword word library. The following is an optional implementation method:

[0110] The first step: determining the priorities corresponding to the selected current keywords according to the evaluation indicators corresponding to the selected current keywords.

[0111] Specifically, if the evaluation indicators corresponding to the selected current keywords respectively include only one type of indicator, the evaluation indicators corresponding to the selected current keywords respectively can be directly used as the priorities corresponding to the selected current keywords respectively.

[0112] If the evaluation indicators corresponding to the selected current keywords include multiple types of indicators, each type of indicator corresponding to each selected current keyword can be determined, and the weight corresponding to each type of indicator can be determined. Based on the weight corresponding to each type of indicator, the weighted sum of each type of indicator corresponding to the current keyword is obtained to obtain the priority corresponding to the current keyword.

[0113] An optional way to determine the priority is as follows:

[0114] λ=∑ω i λ i

[0115] Among them, λ represents the priority of the current keyword, λ i Indicates a certain type of indicator included in the evaluation index, such as search index or search result ranking, or download volume. i Indicates the weight corresponding to the indicator of this type. The weight corresponding to each type of indicator can be flexibly adjusted according to the specific application scenario, and the weights corresponding to each type of indicator can be the same or different, which is not limited in this specification.

[0116] Of course, the above-mentioned method for determining priority is only an optional embodiment shown in this specification. The various types of indicators included in the evaluation indicators can also be normalized or scaled and then weighted summed to obtain the priority by any existing type of statistical method, and this specification does not limit this.

[0117] Step 2: According to the types of indicators included in the evaluation indicators corresponding to the screened current keywords, the evaluation indicators corresponding to the reference keywords are obtained.

[0118] Furthermore, since each reference keyword and each screened current keyword must be stored in the keyword thesaurus, it is also necessary to determine the priority corresponding to each reference keyword, so that when sorting the keywords contained in the keyword thesaurus, they can be sorted according to the priority, which is a unified reference indicator.

[0119] In order to make the priority of each reference keyword and the priority of each selected current keyword have a comparative premise, the evaluation index of each reference keyword can be obtained according to the type of index included in the evaluation index of each selected current keyword. For example, if the evaluation index corresponding to each selected current keyword includes the search index and the search result ranking, when obtaining the evaluation index corresponding to each reference keyword, the search index and the search result ranking corresponding to each reference keyword can also be obtained.

[0120] Step 3: Determine the priorities corresponding to the reference keywords according to the evaluation indicators corresponding to the reference keywords.

[0121] Then, for each reference keyword, the priority of the reference keyword is determined according to the evaluation index corresponding to the reference keyword. The priority of the reference keyword is determined in the same way as the priority of the current keyword selected, which can be specifically referred to in the first step above and will not be repeated here.

[0122] In an optional embodiment of this specification, Figure 1 In the keyword thesaurus constructed in step S106, in addition to the current keywords after screening of the target application and the reference keywords of the reference application related to the target application, long-tail keywords can also be introduced. Among them, the long-tail keywords in this specification refer to: a more specific search phrase or short sentence that generally has more words than the current keyword or reference keyword and contains multiple words. Long-tail keywords usually contain the specific search target of the user and the specific feature description of the application to be searched, which makes it have a lower search volume but a higher conversion potential. Therefore, introducing long-tail keywords into the keyword thesaurus and using them in the construction of the keyword sequence of the target application can improve the search conversion rate of the target application, thereby improving the optimization effect of the keyword sequence.

[0123] In this specification, one implementation method of determining long-tail keywords and putting them into a keyword word library can be as follows: Figure 3 As shown:

[0124] S300: Obtain user comments on the target application.

[0125] First, we can obtain user comments on the target application through different channels, such as search engines, application download platforms, social media, etc. The user comments usually contain direct feedback from users on the target application, including the experience or problems encountered after using the target application.

[0126] S302: extracting a plurality of candidate keywords from user comments on the target application, wherein the candidate keywords at least include a description of the target application by the user.

[0127] Afterwards, artificial intelligence methods (such as text extraction models), text analysis tools, or manual browsing and extraction methods are used to identify short sentences and phrases that appear repeatedly in user reviews to describe the target application. These may be the search terms that users may use when searching for the target application.

[0128] In particular, the questions, suggestions, expectations, and usage requirements of users when using the target application are extracted from their comments as candidate keywords. Such candidate keywords can often reveal the specific needs of users, thereby improving the accuracy of constructing long-tail keywords.

[0129] For example, if the target application is sports software and "home exercise" is often mentioned in user reviews, then "full body exercise application suitable for home" is a possible long-tail keyword.

[0130] S304: constructing a plurality of long-tail keywords according to the plurality of candidate keywords, wherein the number of characters of the long-tail keywords is greater than the number of characters of the current keyword.

[0131] Furthermore, the extracted multiple candidate keywords are spliced ​​together, or the extracted multiple candidate keywords are filled into a preset long-tail keyword template to obtain a plurality of long-tail keywords.

[0132] Optionally, the candidate keywords are directly spliced, or the candidate keywords are filled into the preset long-tail keyword template. The obtained long-tail keywords may not conform to the user's search habits, which will reduce the probability of the long-tail keywords hitting the search terms entered by the user. In order to deal with this problem, artificial intelligence methods, especially machine learning solutions, can be used to analyze the user's search habits and language style based on user comments on the target application, and the search habits and language style obtained by imitating the analysis are combined with multiple extracted candidate keywords to construct long-tail keywords to improve the reliability of long-tail keywords.

[0133] S306: construct a keyword thesaurus based on the screened current keywords, the reference keywords and the long-tail keywords.

[0134] based on Figure 3 The method shown can accurately extract valuable long-tail keywords from users' real feedback, analyze users' real evaluations, and understand the real positioning of the target application at the user level, so as to hit the user's specific description and search intent, so as to further optimize the visibility of the target application on search engines and application download platforms and attract higher quality traffic.

[0135] The above is a keyword optimization method provided by one or more embodiments of this specification. Based on the same idea, this specification also provides a corresponding keyword optimization device, such as Figure 4 shown.

[0136] Figure 4 A schematic diagram of a keyword optimization device provided in this specification specifically includes:

[0137] The current keyword acquisition module 400 is used to acquire each current keyword of the target application;

[0138] An evaluation index acquisition module 402 is used to acquire evaluation indexes corresponding to the current keywords, wherein the evaluation indexes include at least one of a search index, a search result ranking, and a download volume;

[0139] A reference keyword acquisition module 404 is used to acquire reference keywords corresponding to reference applications related to the target application;

[0140] A keyword word library construction module 406 is used to filter the current keywords according to the evaluation indicators corresponding to the current keywords, and to construct a keyword word library according to the filtered current keywords and the reference keywords;

[0141] The keyword sequence determination module 408 is used to combine the keywords contained in the keyword vocabulary to determine the keyword sequence of the target application.

[0142] Optionally, the keyword sequence determination module 408 is specifically used to iteratively execute: according to the current last several words in each word contained in the keyword sequence of the target application, from each keyword contained in the keyword vocabulary, search for keywords whose first several words are the same as the current last several words, splice the found keywords to the end of the keyword sequence of the target application, and delete several repeated words at the splicing, until the number of words corresponding to the keyword sequence of the target application reaches a preset word limit; wherein, the first keyword contained in the keyword sequence of the target application is the keyword with the highest priority in the keyword vocabulary.

[0143] Optionally, the device further comprises:

[0144] The priority determination module 410 is specifically used to determine the priorities of each of the screened current keywords according to the evaluation indicators corresponding to each of the screened current keywords; obtain the evaluation indicators corresponding to each of the reference keywords according to the types of indicators contained in the evaluation indicators corresponding to each of the screened current keywords; and determine the priorities corresponding to each of the reference keywords according to the evaluation indicators corresponding to each of the reference keywords.

[0145] Optionally, the keyword sequence determination module 408 is specifically configured to, when multiple keywords are found, add the keyword with the highest priority among the found keywords to the end of the keyword sequence of the target application according to the priorities corresponding to the found keywords.

[0146] Optionally, the device further comprises:

[0147] The detection module 412 is specifically used to detect each keyword in the keyword thesaurus and eliminate keywords that do not meet the preset conditions; wherein the keywords that do not meet the preset conditions include at least one of keywords with repeated words, keywords with repeated pronunciations, keywords that hit sensitive words, and keywords that fall into a preset blacklist.

[0148] Optionally, the keyword thesaurus building module 406 is specifically used to obtain user comments on the target application; extract multiple candidate keywords from the user comments on the target application, and the candidate keywords at least include the user's description of the target application; construct a number of long-tail keywords based on the multiple candidate keywords, and the number of words in the long-tail keywords is greater than the number of words in the current keywords; and construct a keyword thesaurus based on the screened current keywords, the reference keywords and the long-tail keywords.

[0149] Optionally, the device further comprises:

[0150] The update module 414 is specifically used to determine the keyword update cycle; when the duration of using the keyword sequence as the keyword of the target application exceeds the keyword update cycle, the evaluation indicators corresponding to each keyword contained in the keyword sequence are obtained, and the keyword thesaurus is updated according to the obtained evaluation indicators, and the keyword sequence of the target application is re-determined according to the updated keyword thesaurus.

[0151] This specification also provides a computer-readable storage medium, which stores a computer program, which can be used to execute the above Figure 1 The optimization method for the keywords shown.

[0152] This manual also provides Figure 5 The schematic structure diagram of the electronic device shown in FIG. Figure 5 As mentioned above, at the hardware level, the electronic device includes a processor, an internal bus, a network interface, a memory, and a non-volatile memory, and may also include other hardware required for the business. The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it to achieve the above Figure 1 Of course, in addition to the software implementation, this specification does not exclude other implementations, such as logic devices or a combination of software and hardware, etc., that is, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or logic devices.

[0153] In the 1990s, improvements to a technology could be clearly distinguished as hardware improvements (for example, improvements to the circuit structure of diodes, transistors, switches, etc.) or software improvements (improvements to the method flow). However, with the development of technology, many improvements to the method flow today can be regarded as direct improvements to the hardware circuit structure. Designers almost always obtain the corresponding hardware circuit structure by programming the improved method flow into the hardware circuit. Therefore, it cannot be said that an improvement in a method flow cannot be implemented using a hardware entity module. For example, a programmable logic device (PLD) (such as a field programmable gate array (FPGA)) is such an integrated circuit whose logical function is determined by the user's programming of the device. Designers can "integrate" a digital system on a PLD by programming it themselves, without having to ask a chip manufacturer to design and produce a dedicated integrated circuit chip. Moreover, nowadays, instead of manually making integrated circuit chips, this kind of programming is mostly implemented by "logic compiler" software, which is similar to the software compiler used when developing and writing programs, and the original code before compilation must also be written in a specific programming language, which is called hardware description language (HDL). There is not only one HDL, but many kinds, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc. The most commonly used ones are VHDL (Very-High-Speed ​​Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should also know that it is only necessary to program the method flow slightly in the above-mentioned hardware description languages ​​and program it into the integrated circuit, and then it is easy to obtain the hardware circuit that implements the logic method flow.

[0154] The controller can be implemented in any appropriate manner, for example, the controller can take the form of a microprocessor or processor and a computer-readable medium storing a computer-readable program code (such as software or firmware) that can be executed by the (micro)processor, a logic gate, a switch, an application-specific integrated circuit (ASIC), a programmable logic controller, and an embedded microcontroller. Examples of controllers include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320. The memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art also know that in addition to implementing the controller in a purely computer-readable program code manner, the controller can be implemented in the form of a logic gate, a switch, an application-specific integrated circuit, a programmable logic controller, and an embedded microcontroller by logically programming the method steps. Therefore, this controller can be considered as a hardware component, and the devices included therein for implementing various functions can also be regarded as structures within the hardware component. Or even, the devices for implementing various functions can be regarded as both software modules for implementing the method and structures within the hardware component.

[0155] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0156] For the convenience of description, the above device is described in various units according to their functions. Of course, when implementing this specification, the functions of each unit can be implemented in the same or multiple software and / or hardware.

[0157] Those skilled in the art will appreciate that the embodiments of this specification may be provided as methods, systems, or computer program products. Therefore, this specification may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, this specification may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0158] This specification is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of this specification. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0159] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0160] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0161] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0162] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0163] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0164] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0165] Those skilled in the art will appreciate that the embodiments of this specification may be provided as methods, systems or computer program products. Therefore, this specification may take the form of a complete hardware embodiment, a complete software embodiment or an embodiment combining software and hardware. Moreover, this specification may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0166] This specification may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. This specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.

[0167] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0168] The above description is only an embodiment of the present specification and is not intended to limit the present specification. For those skilled in the art, the present specification may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present specification shall be included in the scope of the claims of the present specification.

Claims

1. A keyword optimization method, characterized in that: include: Get the current keywords of the target application; Obtaining evaluation indicators corresponding to the current keywords, and filtering the current keywords according to the evaluation indicators corresponding to the current keywords, wherein the evaluation indicators include at least one of a search index, a search result ranking, and a download volume; Acquire reference keywords corresponding to reference applications related to the target application; Building a keyword thesaurus based on the screened current keywords and the reference keywords; Combining the keywords contained in the keyword library to determine a keyword sequence of the target application; The combining of the keywords contained in the keyword library to determine the keyword sequence of the target application specifically includes: Iterative execution: according to the current last several words in the keyword sequence of the target application, search for keywords whose first several words are the same as the current last several words from the keywords contained in the keyword thesaurus, splice the found keywords to the end of the keyword sequence of the target application, and delete the repeated several words at the splicing, until the number of words corresponding to the keyword sequence of the target application reaches a preset word limit.

2. The method according to claim 1, characterized in that The first keyword included in the keyword sequence of the target application is the keyword with the highest priority in the keyword database.

3. The method according to claim 2, characterized in that Before combining the keywords included in the keyword library to determine the keyword sequence of the target application, the method further includes: Determine the priorities of the selected current keywords according to the evaluation indicators respectively corresponding to the selected current keywords; Obtaining the evaluation indicators corresponding to the reference keywords according to the types of indicators included in the evaluation indicators corresponding to the selected current keywords; The priorities respectively corresponding to the reference keywords are determined according to the evaluation indicators respectively corresponding to the reference keywords.

4. The method according to claim 1, characterized in that The step of splicing the found keyword to the end of the keyword sequence of the target application specifically includes: When multiple keywords are found, according to the priorities corresponding to the found keywords, the keyword with the highest priority among the found keywords is spliced ​​to the end of the keyword sequence of the target application.

5. The method according to claim 1, characterized in that After constructing a keyword thesaurus according to the screened current keywords and the reference keywords, and before combining the keywords included in the keyword thesaurus to determine the keyword sequence of the target application, the method further includes: Detecting each keyword in the keyword database and removing keywords that do not meet preset conditions; Among them, the keywords that do not meet the preset conditions include at least one of keywords with repeated words, keywords with repeated pronunciations, keywords that hit sensitive words, and keywords that fall into a preset blacklist.

6. The method according to claim 1, characterized in that The step of constructing a keyword thesaurus based on the selected current keywords and the reference keywords specifically includes: Obtain user comments on the target application; Extracting a plurality of candidate keywords from user comments on the target application, wherein the candidate keywords at least include a description of the target application by the user; Constructing a plurality of long-tail keywords according to the plurality of candidate keywords, wherein the number of characters of the long-tail keywords is greater than the number of characters of the current keyword; A keyword thesaurus is constructed based on the screened current keywords, the reference keywords and the long-tail keywords.

7. The method according to claim 1, characterized in that The method further comprises: Determine the keyword update cycle; When the duration of using the keyword sequence as the keyword of the target application exceeds the keyword update period, the evaluation index corresponding to each keyword contained in the keyword sequence is obtained, and the keyword thesaurus is updated according to the obtained evaluation index, and the keyword sequence of the target application is re-determined according to the updated keyword thesaurus.

8. A keyword optimization device, characterized in that: include: A current keyword acquisition module is used to acquire the current keywords of the target application; An evaluation index acquisition module, used to acquire evaluation indexes corresponding to the current keywords, wherein the evaluation indexes include at least one of a search index, a search result ranking, and a download volume; A reference keyword acquisition module, used to acquire reference keywords corresponding to reference applications related to the target application; A keyword thesaurus building module, used to filter the current keywords according to the evaluation indicators respectively corresponding to the current keywords, and build a keyword thesaurus according to the filtered current keywords and the reference keywords; A keyword sequence determination module, used to combine the keywords contained in the keyword vocabulary to determine the keyword sequence of the target application; The keyword sequence determination module is specifically used to iteratively execute: according to the current last several words in the keyword sequence of the target application, from each keyword contained in the keyword vocabulary, search for keywords whose first several words are the same as the current last several words, splice the found keywords to the end of the keyword sequence of the target application, and delete the repeated several words at the splicing, until the number of words corresponding to the keyword sequence of the target application reaches a preset word limit.

9. A computer-readable storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the method described in any one of claims 1 to 7 is implemented.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the method described in any one of claims 1 to 7 is implemented.

Citation Information

Patent Citations

  • Keyword recommendation method, related device and storage medium

    CN111368171A

  • Automated safe secure techniques for eliminating undefined behavior in computer software

    US7818729B1