CN113011165A

CN113011165A - Method, device, equipment and medium for identifying blocked keywords

Info

Publication number: CN113011165A
Application number: CN202110296033.5A
Authority: CN
Inventors: 邹胜群; 钟浩杰
Original assignee: Alipay Hangzhou Information Technology Co Ltd
Current assignee: AlipayCom Co ltd
Priority date: 2021-03-19
Filing date: 2021-03-19
Publication date: 2021-06-22

Abstract

The embodiment of the specification discloses a method, a device, equipment and a medium for identifying blocked keywords. The scheme comprises the following steps: acquiring the number of used times of the target keyword; obtaining the reflux times of the target keywords; determining the reflow rate of the target keyword based on the reflow times and the used times; judging whether the reflux rate is less than or equal to a preset reflux rate or not to obtain a judgment result; and when the judgment result shows that the reflux rate is less than or equal to a preset reflux rate, determining the target keyword as a blocked keyword.

Description

Method, device, equipment and medium for identifying blocked keywords

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method, an apparatus, a device, and a medium for identifying blocked keywords.

Background

In the prior art, when a user sends information to other users through a client, the information shared by the user cannot be shared to other users or cannot be used by other users due to the provision of a network platform or a client platform, that is, the information shared by the user is blocked, which brings inconvenience to the user.

Therefore, how to quickly and accurately find out the content which may be blocked in the shared information is an urgent technical problem to be solved.

Disclosure of Invention

The embodiment of the specification provides a method, a device, equipment and a medium for identifying blocked keywords, which are used for discovering the blocked keywords possibly existing in shared information and improving the usability of the shared information.

In order to solve the above technical problem, the embodiments of the present specification are implemented as follows:

the method for identifying blocked keywords provided by the embodiment of the specification comprises the following steps:

acquiring the number of used times of the target keyword; the used times are obtained by counting the number of the shared information containing the target keyword sent to the first terminal set;

obtaining the reflux times of the target keywords; the reflow times are obtained by counting the times of access requests initiated by the acquired second terminal set based on the sharing information containing the target keyword;

determining the reflow rate of the target keyword based on the reflow times and the used times;

judging whether the reflux rate is less than or equal to a preset reflux rate or not to obtain a judgment result;

and when the judgment result shows that the reflux rate is less than or equal to a preset reflux rate, determining the target keyword as a blocked keyword. An embodiment of this specification provides a device for identifying blocked keyword, includes:

the first data acquisition module is used for acquiring the number of times of use of the target keyword; the used times are obtained by counting the number of the shared information containing the target keyword sent to the first terminal set;

the second data acquisition module is used for acquiring the reflux times of the target keywords; the reflow times are obtained by counting the times of access requests initiated by the acquired second terminal set based on the sharing information containing the target keyword;

the reflow rate calculation module is used for determining the reflow rate of the target keyword based on the reflow times and the used times;

the judgment module is used for judging whether the reflux rate is less than or equal to a preset reflux rate or not to obtain a judgment result;

and the result determining module is used for determining the target keyword as the blocked keyword when the judgment result shows that the reflux rate is less than or equal to the preset reflux rate.

An apparatus for identifying blocked keywords provided by an embodiment of the present specification includes:

at least one processor; and the number of the first and second groups,

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores instructions executable by the at least one processor to enable the at least one processor to:

and when the judgment result shows that the reflux rate is less than or equal to a preset reflux rate, determining the target keyword as a blocked keyword. Embodiments of the present specification provide a computer readable medium having computer readable instructions stored thereon, the computer readable instructions being executable by a processor to implement a method of identifying blocked keywords.

One embodiment of the present description achieves the following advantageous effects: the blocked keywords can be determined by counting the reflux rate of the target keywords, so that the blocked keywords in the shared information can be effectively identified, the determined blocked keywords can be avoided being used when the shared information is generated, the shared information can be successfully shared, the availability of the shared information is improved, and the resource waste is reduced.

Drawings

In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without any creative effort.

Fig. 1 is a schematic diagram of an overall scheme architecture of a method for identifying blocked keywords in an actual application scenario according to an embodiment of the present disclosure;

FIG. 2 is a flowchart illustrating a method for identifying blocked keywords according to an embodiment of the present disclosure;

FIG. 3 is a swim lane diagram of a method for identifying blocked keywords according to an embodiment of the present disclosure;

FIG. 4 is a schematic structural diagram of an apparatus for identifying blocked keywords according to an embodiment of the present disclosure;

fig. 5 is a schematic structural diagram of an apparatus for identifying blocked keywords according to an embodiment of the present disclosure.

Detailed Description

To make the objects, technical solutions and advantages of one or more embodiments of the present disclosure more apparent, the technical solutions of one or more embodiments of the present disclosure will be described in detail and completely with reference to the specific embodiments of the present disclosure and the accompanying drawings. It is to be understood that the embodiments described are only a few embodiments of the present specification, and not all embodiments. All other embodiments that can be derived by a person skilled in the art from the embodiments given herein without making any creative effort fall within the scope of protection of one or more embodiments of the present specification.

The technical solutions provided by the embodiments of the present description are described in detail below with reference to the accompanying drawings.

In order to solve the defects in the prior art, the scheme provides the following embodiments:

fig. 1 is a schematic diagram of an overall scheme architecture of a method for identifying blocked keywords in an actual application scenario according to an embodiment of the present disclosure. As shown in fig. 1, the scheme mainly includes a server 1, a first terminal 2 and a second terminal 3, where the server 1 may count shared information sent to the first terminal 2 and keywords included in the shared information, and determine the number of times the keywords are used; the first terminal 1 can send the shared information to the second terminal 2, the second terminal 2 can initiate an access request based on the received shared information, the server 1 can count the number of times of the access request initiated by the second terminal 2, determine the number of times of backflow of the keyword, and then determine the backflow rate of the keyword in the shared information according to the number of times of backflow and the number of times of being used, when the backflow rate is low, it is indicated that the shared information including the keyword cannot be normally used by the second terminal 2, for example, the shared information cannot be displayed on the second terminal or cannot be copied in the second terminal, and the keyword is a blocked keyword. And then after confirming the keyword that is blocked, when regenerating the shared information subsequently, can no longer use this keyword that is blocked for the shared information can be shared to the second terminal normally, and the second terminal can normally use this shared information, also can improve the availability of shared information, reduces the wasting of resources because of generating the unusable shared information and causing.

Next, a method for identifying blocked keywords provided in an embodiment of the specification will be described in detail with reference to the accompanying drawings:

fig. 2 is a flowchart illustrating a method for identifying blocked keywords according to an embodiment of the present disclosure. From the viewpoint of a program, the execution subject of the flow may be a program installed in an application server or an application client.

As shown in fig. 2, the process may include the following steps:

step 202: acquiring the number of used times of the target keyword; the used times are obtained by counting the number of the shared information containing the target keyword sent to the first terminal set.

In this example, the first set of terminals may include at least one terminal, and the terminal may include a mobile terminal such as a mobile phone, a computer, and a smart watch. The server can count the shared information generated aiming at the first terminal and the number of the shared information, the shared information can contain at least one keyword, and the keyword can be an independent word or a phrase.

In practical applications, the keywords to be identified may be determined as target keywords, and the target keywords may be all or part of the keywords included in the shared information. The number of times of use of the target keyword may be understood as the number of times the target keyword is included in the generated shared information, that is, the number of times the target keyword is used in the generated shared information.

Step 204: obtaining the reflux times of the target keywords; the reflow times are obtained by counting the times of access requests initiated by the acquired second terminal set based on the sharing information containing the target keyword.

The second terminal set may include at least one second terminal, and the second terminal may be a terminal that initiates an access request based on the shared information. In practical application, the first terminal may send the generated shared information to the second terminal, and the second terminal initiates an access request based on the received shared information, as another implementation, the server that generates the shared information may also directly send the generated shared information to the second terminal, and the second terminal may also initiate an access request based on the received shared information, where a specific transmission manner of the shared information is not limited.

In the embodiment of the present specification, the server may count the number of times of an access request initiated by the second terminal based on the sharing information including the target keyword, and may further determine the number of times of reflowing of the target keyword. When the second terminal can initiate an access request based on the shared information, the keywords in the shared information are available and are not blocked. The reflow times of the target keywords are the times of the target keywords contained in the shared information capable of initiating the access request.

Step 206: and determining the reflow rate of the target keyword based on the reflow times and the used times.

Step 208: and judging whether the reflux rate is less than or equal to a preset reflux rate or not to obtain a judgment result.

Step 210: and when the judgment result shows that the reflux rate is less than or equal to a preset reflux rate, determining the target keyword as a blocked keyword.

In this embodiment of the specification, when the reflux rate of the target keyword is less than or equal to a preset reflux rate, it indicates that the number of times of access requests initiated by the second terminal based on the sharing information including the target keyword is small, at least some second terminals in the second terminal set that receive the sharing information cannot initiate access requests based on the sharing information including the target keyword, the target keyword affects use of the sharing information, and a user of the second terminal cannot obtain content to be shared based on the sharing information.

It should be understood that the order of some steps in the method described in one or more embodiments of the present disclosure may be interchanged according to actual needs, or some steps may be omitted or deleted.

In the embodiment of the description, the blocked keywords can be determined by counting the reflux rate of the target keywords, the blocked keywords in the shared information can be effectively identified, and further, the determined blocked keywords can be avoided being used when the shared information is generated, so that the shared information can be successfully shared, the availability of the shared information is improved, and the resource waste is reduced.

Based on the method of fig. 2, the present specification also provides some specific embodiments of the method, which are described below.

Optionally, before the obtaining of the number of times of use of the target keyword in step 202, the method may further include:

acquiring a sharing request sent by a first terminal in the first terminal set; the sharing request is a request for sharing the page to be shared;

generating the sharing information based on the link information of the page to be shared;

the obtaining of the number of times of use of the target keyword may specifically include:

and determining the number of times of using the target keyword based on the sharing information.

In practical application, the sharing information may be a request for sharing the page to be shared, which is generated based on the sharing request, and may be generated based on the link information of the page to be shared.

The server can also send the generated sharing information to the first terminal, so that the first terminal can send the sharing information to the second terminal. For example, when a user browses certain page information in an application program or a webpage, the user wants to share the page information with friends of the user, the user can click a sharing button in the page, the terminal can generate a sharing request according to the sharing operation of the user, the sharing request is sent to the server, the server can generate sharing information according to the sharing request, the user can share the sharing information with the friends in the form of short messages in instant messaging, and the sharing information can be published to a preset position so that the friends can see the sharing information.

In the embodiment of the present specification, the server may record the generated sharing information, determine keywords included in the sharing information according to the generated sharing information, and further count the number of times of use of each keyword. The target keyword is a keyword that needs to be identified whether to be blocked or not, and may be at least a part of keywords in the shared information, and in order to improve the identification range, the target keyword may also be all keywords included in the shared information.

In consideration of practical application, after receiving the sharing information, the user of the second terminal usually accesses the page to be shared within a preset time period, and in order to improve the recognition efficiency of the keyword, before the step 204 in this embodiment of the present specification obtains the reflow times of the target keyword, the method may further include:

acquiring the access request initiated by a second terminal in the second terminal set based on the sharing information within a preset time period; the preset time period is a time period with a preset duration taking the moment of generating the sharing information as an initial time;

the obtaining of the reflow times of the target keyword may specifically include:

determining the shared information corresponding to the access request based on the access request;

and determining the reflux times of the target keywords based on the sharing information corresponding to the access request.

In practical applications, the specific preset duration of the preset time period may be set according to actual requirements, and is not specifically limited herein. For example, the preset time period may be a time period within 10 minutes after the shared information is generated, and after the shared information is generated, if the server receives an access request generated based on the shared information within 10 minutes, it may be determined that the shared information is reflowable, a keyword in the shared information is reflowable, and the reflow times of the keyword included in the shared information are accumulated.

In practical application, the number of times of use and the number of times of reflow of the target keyword may be counted one by one according to the generated sharing information and the received access request, or may be counted based on the generated sharing information and the received access request within a specified time period.

When the number of times of use of the target keyword and the number of times of reflow are counted for the first time, the determining the number of times of use of the target keyword based on the sharing information in the above steps may specifically include:

determining the number of times that the shared information contains the target keyword based on the shared information;

determining the times of the sharing information containing the target keywords as the used times of the target keywords;

the determining, based on the shared information corresponding to the access request, the number of times of reflowing of the target keyword may specifically include:

determining the number of times that the shared information corresponding to the access request contains the target keyword based on the shared information corresponding to the access request;

determining the number of times of the sharing information corresponding to the access request, wherein the number of times of the sharing information comprises the target keyword, as the reflux number of the keyword.

The server is supposed to receive 3 sharing requests of the first terminal, 1 piece of sharing information is generated respectively aiming at each sharing request, and 3 pieces of sharing information are generated in total, wherein the sharing information 1 comprises a target keyword a, a target keyword b and a target keyword c; the shared information 2 comprises a target keyword a, a target keyword b and a target keyword d; the shared information 3 includes a target keyword a, a target keyword c, and a target keyword e. According to the generated sharing information, it is determined that the number of times of use of the target keyword a is 3, the number of times of use of the target keyword b is 2, the number of times of use of the target keyword c is 2, the number of times of use of the target keyword d is 1, and the number of times of use of the target keyword e is 1.

Assuming that the server receives each access request based on the shared information 1 and the shared information 2 and does not receive an access request based on the shared information 3 within 10 minutes after the shared information is generated, it may be determined that the target keywords included in the shared information 1 and the shared information 2 are reflowable, and at this time, it may be determined that the reflow times of the target keyword a are 2, the reflow times of the target keyword b are 2, the reflow times of the target keyword c are 1, the reflow times of the target keyword d are 1, and the reflow times of the target keyword e are 0 according to the shared information corresponding to the received access request.

In the embodiment of the description, the used times and the backflow times of the target keywords can be counted one by one according to the sharing information and the access request based on a stream computing platform, the generated sharing information and the received access request can be acquired in real time, and the blocked keywords can be discovered in time.

In an embodiment of this specification, a reflux rate of a target keyword may also be determined based on historical statistical information, specifically, the determining, based on the sharing information, a number of times of use of the target keyword may specifically include:

determining the number of times of using the target keyword in the shared information based on the shared information;

adding the use times and the historical use times of the target keyword to obtain the used times of the target keyword; the historical use times of the target keywords are the total times of the generated historical sharing information containing the target keywords before the sharing information is generated;

the determining the number of reflowing times of the target keyword based on the shared information corresponding to the access request specifically includes:

determining the current reflow times of the target keyword contained in the shared information corresponding to the access request based on the shared information corresponding to the access request;

adding the current reflux times and the historical reflux times of the target keywords to obtain the reflux times of the target keywords; the historical backflow times of the target keywords are the total times that the historical shared information corresponding to the obtained historical access request contains the target keywords before the access request is obtained.

Next, as an example, it is assumed that the number of times of historical use of the target keyword a, the number of times of historical use of the target keyword b, the number of times of historical use of the target keyword c, the number of times of historical use of the target keyword d, and the number of times of historical use of the target keyword e in the generated history shared information are 20, 15, 10, and 8, respectively, before the shared information is generated. When the shared information 1 including the target keyword a, the target keyword b, and the target keyword c is generated, the number of times of use of the target keyword a is updated to 21, the number of times of use of the target keyword b is updated to 16, and the number of times of use of the target keyword c is updated to 10. Similarly, when receiving an access request based on the shared information 1 and the shared information 2, the reflow number of the target keyword a is updated based on the reflow number counted before, assuming that the history reflow number of the target keyword a counted before is 15, and when receiving an access request based on the shared information 1, the reflow number of the target keyword a is updated to 16.

In this example, in step 206, determining a reflow rate of the target keyword based on the reflow times and the used times may specifically include:

calculating a ratio of the number of reflowing times and the number of used times based on the number of reflowing times and the number of used times;

and determining the reflux rate of the target keyword based on the ratio.

In practical applications, the reflow rate of the target keyword may be a ratio of the reflow times of the target keyword to the used times of the target keyword, or may be expressed in a percentage form, and a specific expression form in the embodiments of the present specification is not limited.

In an embodiment of the present specification, one piece of shared information may be shared to multiple users, multiple access requests for one piece of shared information may be provided, and then the number of times of reflowing of the target keyword may be greater than the number of times of being used of the target keyword, and the reflow rate of the target keyword may be greater than or equal to 1. For example, a user of a first terminal shares a piece of shared information to users of a plurality of second terminals, and the user of each second terminal can send an access request based on the shared information.

The sharing information in the embodiment of the present specification may include information for describing content of the page to be shared, and a user receiving the sharing information may know main service content of the page to be shared through the sharing information. The sharing information may include text information and code information, where the text information may be information describing content of the page to be shared, the code information may be used to be associated with a link of the page to be shared, and the page to be shared may be determined based on the code information.

The text information may include character information, wherein the characters may include Chinese characters, foreign characters, Mars characters, etc., and may also include simplified characters, traditional characters, etc. The code information may include at least one of numbers, letters, and characters.

The access request in the embodiment of the present specification may include code information in the shared information corresponding to the access request, the server may present a page to be shared to the second terminal according to the code information, and a user of the second terminal acquires information in the shared page.

After the sharing information is generated, the corresponding relation between the code information in the sharing information and the link information of the page to be shared can be established, when the page to be shared is presented for the user, the server does not need to identify all information in the sharing information corresponding to the access request, the information to be shared can be determined only by using the code information in the sharing information, and the processing efficiency of the access request can be improved.

The method for identifying blocked keywords provided in the embodiments of the present specification may further include:

establishing a first corresponding relation between the text information and the code information aiming at each piece of the sharing information;

the determining, based on the access request, the shared information corresponding to the access request may specifically include:

determining the code information contained in the access request based on the access request;

determining the text information corresponding to the code information according to the first corresponding relation;

determining the number of times that the text information contains the target keyword based on the text information corresponding to the code information;

and determining the reflow times of the target keywords according to the times of the text information containing the target keywords.

In the embodiment of the present specification, after the shared information is generated, a corresponding relationship between text information and code information in the shared information may be established, and when an access request including the code information is received, text information corresponding to the code information may be determined based on the code information, then, a keyword in the text information is determined, the number of times that the text information includes a target keyword is determined, and further, the number of times of reflow of the target keyword may be determined.

As another embodiment, in this embodiment, a corresponding relationship between the target keyword and the code information may also be pre-established, and the number of times of reflowing of the target keyword is determined according to the corresponding relationship, specifically, the shared information in this embodiment may include text information and code information; the text information can comprise the target keywords; the access request may include code information in the shared information corresponding to the access request;

the method may further comprise:

establishing a second corresponding relation between the target keyword and the code information aiming at each piece of shared information;

the determining, based on the access request, the shared information corresponding to the access request specifically includes:

determining the target keyword corresponding to the code information according to the second corresponding relation;

determining the times of the code information corresponding to the target keyword according to the obtained times of the access request;

and determining the reflow times of the target keyword based on the times of the code information corresponding to the target keyword.

In the embodiment of the present specification, after the shared information is generated, a corresponding relationship between a keyword included in the shared information and code information in the shared information may be established, and when an access request is received, a target keyword corresponding to the code information may be determined according to the code information included in the access request, and then the number of times of reflowing of the target keyword may also be counted.

In practical application, when one piece of shared information contains two or more identical target keywords, the target keywords can be marked according to the word order sequence of the target keywords in the shared information, the corresponding relationship between the marked target keywords and the code information is established, and then the reflux times of the target keywords can be determined according to the corresponding relationship.

In practical application, after the user a shares the shared information with the user B, the shared information may not be displayed in a terminal interface of the user B, or the user B cannot copy the shared information in the terminal interface, so that the user B cannot obtain the shared content corresponding to the shared information. The blocked keywords in the embodiment of the present specification may include keywords for which the execution of the copy operation is prohibited or keywords for which the execution of the display operation is prohibited.

In order to facilitate statistics and generation of shared information, the method for identifying blocked keywords provided in the embodiment of the present specification may further include:

determining a keyword lexicon; the keyword lexicon comprises the target keywords;

the generating of the shared information may specifically include:

acquiring at least one target keyword in the keyword lexicon;

and generating the sharing information based on the target keyword.

In practical applications, after determining the target keyword as the blocked keyword in step 210 based on the recognition result of the keyword, the method may further include:

and deleting or marking the keywords which are determined to be blocked in the keyword lexicon.

The embodiment of the specification can delete or mark the blocked keywords in the keyword lexicon, so that the blocked keywords are avoided being used when the shared information is generated later.

In an embodiment of the present specification, when generating shared information, shared information may be generated by using unmarked keywords, and the generating of the shared information may specifically include:

acquiring at least one keyword in the keyword lexicon;

judging whether the keywords are marked keywords or not;

if the keywords are unmarked keywords, determining the keywords as the target keywords;

and generating the sharing information based on the target keyword.

In the embodiment of the present specification, the keyword determined to be blocked may be replaced with a replacement word, and the shared information may be generated using the replacement word. The method for identifying blocked keywords provided in the embodiments of the present specification may include:

determining a replacement word lexicon;

after the determining the target keyword as the blocked keyword, the method further includes:

determining a replacement word corresponding to the target keyword in the replacement word lexicon;

and generating new sharing information based on the replacement words.

The replacement word bank contains replacement words corresponding to the target keywords, and the replacement words can be synonyms and homophones of the target keywords, can also be mars containing components or radicals of the target keywords, and can also be spliced words composed of letters, pinyin, English, Korean, Japanese and the like.

In practical application, when a replacement word in the replacement word lexicon is determined as a blocked keyword, the replacement word in the replacement word lexicon can be deleted; when the reflux rate of the replacement word is high, the keyword in the keyword lexicon can be replaced by the replacement word, so that the reflowable shared information can be generated by using the keyword in the keyword lexicon in the following process, and the usability of the shared information is improved.

In the embodiment of the description, whether the target keyword is a blocked keyword or not can be determined based on the generated sharing information, the generated sharing information and the access request based on the sharing information can be acquired based on the use of the server by the user, the keyword can be identified by using data generated in the process of using the server by the user, excessive hardware equipment does not need to be added, and the cost can be reduced.

In order to further determine that the target keyword is the blocked keyword, in step 210 in this embodiment of the present disclosure, after determining that the target keyword is the blocked keyword, the method may further include:

sending the sharing information containing the target keywords to a real machine test terminal;

and if the sharing information is not displayed in the real machine test terminal, determining the target keyword as a keyword which is determined to be blocked.

The real machine testing terminal may be a terminal loaded with a target application program, for example, a terminal running some instant messaging application program. In practical application, the real machine testing terminal can be operated manually, and can also be operated by simulating the operation of a human by a software program. When the shared information cannot be displayed in the real machine test terminal, the shared information can be determined to contain the blocked keywords.

If the real machine test terminal comprises a first test terminal and a second test terminal, a user of a target application program in the first test terminal issues sharing information to a sharing interface of the target application program, such as a friend circle and a microblog, but the sharing information cannot be displayed in the sharing interface of the target application program of the second test terminal, it can be determined that the sharing information is blocked, and it can be determined that a target keyword is a keyword which is determined to be blocked.

As another implementation manner, after determining the target keyword as the blocked keyword in step 210 in the embodiment of this specification, the method may further include:

acquiring display page information generated by the real machine test terminal based on the selected operation of the shared information;

if the display page information does not contain information capable of executing preset operation on the shared information, determining the target keyword as a keyword which is determined to be blocked; the preset operation comprises a copy operation.

Assuming that the first test terminal sends the shared information to the second test terminal, the second test terminal can receive and display the shared information, but cannot copy the shared information, for example, the shared information is pressed by a long time, and the appearing editing options do not include the copying options, so that a user cannot copy the shared information, and further cannot acquire a page to be shared based on the copied shared information, it can be determined that the shared information is blocked, and it can be determined that the target keyword is the keyword which is determined to be blocked.

In order to more fully identify the blocked keywords, in the embodiment of the present specification, based on the blocked keywords, the characteristics of the blocked keywords are analyzed by using a machine learning model, the probability that the keywords in the keyword library are the blocked keywords is predicted, and the keywords with the probability greater than or equal to the set probability are determined as the blocked keywords. The characteristics of the blocked keywords can be analyzed by utilizing a machine learning model based on the blocked keywords, the possibility that the keywords with the backflow rate larger than the preset backflow rate are the blocked keywords is further predicted, and the keywords with the possibility larger than or equal to the preset possibility are also determined as the blocked keywords.

To more clearly illustrate the method for identifying blocked keywords provided in the embodiments of the present specification, fig. 3 is a swim lane diagram of the method for identifying blocked keywords provided in the embodiments of the present specification, as shown in fig. 3, the method may include a data statistics phase and a determination phase, and specifically may include:

step 302: the first terminal receives sharing operation of a user and sends a sharing request to the server so as to request to obtain a request for sharing the page to be shared.

For example, when a user of the first terminal sees a certain commodity, a certain news, or a certain preferential activity, the user shares a service in a page with a friend of the user, and may send a sharing request for sharing the service of the page to the server by clicking a "share" button in the page, and the server may generate a sharing request for sharing the service of the page based on the request, where the sharing information may be in the form of a password, a word, or the like.

Step 304: and the server receives a sharing request of the first terminal and generates sharing information based on the link information of the page to be shared.

In practical application, the first terminal can send the shared information to the second terminal of the friend in an instant messaging chat mode, the second terminal can also share the shared information to a sharing space which can be accessed by the friend, and a second terminal user can obtain the shared information in the corresponding sharing space.

Step 306: and determining the number of target keywords contained in the shared information according to the generated shared information, and acquiring the number of used times of the target keywords.

In practical applications, the number of times of use of the target keyword may be counted according to a plurality of pieces of shared information generated in a specified time period, for example, the number of times of use of the target keyword may be counted according to shared information generated in the last 7 days.

Step 308: and the second terminal receives the sharing information and initiates an access request based on the sharing information.

Assuming that the first terminal sends the shared information to the second terminal through the instant messaging tool, the second terminal user can copy the shared information, input the copied shared information in the corresponding application program, and initiate an access request for a page to be shared based on the copied shared information.

Step 310: and the server acquires the reflux times of the target keyword according to the received access request.

The server can determine the previously generated shared information corresponding to the access request according to the access request, and further can determine the number of the target keywords contained in the shared information and determine the reflux times of the target keywords. When the server receives the access request, it can be determined that the shared information corresponding to the access request is reflowable, and the reflow times of the target keywords contained in the shared information are correspondingly increased.

In practical application, the reflux time can be set, and if an access request corresponding to the shared information is received within a preset time period after the shared information is generated, the shared information can be determined to be refluxed; if the access request corresponding to the shared information is not received within a preset time period after the shared information is generated, determining that the shared information is blocked and is non-reflowable shared information, and not increasing the reflow times of the target keywords contained in the shared information. In practical application, the reflow times of the target keywords can be counted in real time based on the stream computing platform.

Step 312: and determining the reflow rate of the target keyword based on the reflow times and the used times. Specifically, the reflow rate of the target keyword may be determined according to a ratio of the reflow times to the used times.

Step 314: and judging whether the reflux rate is less than or equal to a preset reflux rate or not to obtain a judgment result.

Step 316: and when the judgment result shows that the reflux rate is less than or equal to a preset reflux rate, determining the target keyword as a blocked keyword.

Based on the same idea, the embodiment of the present specification further provides a device corresponding to the above method. Fig. 4 is a schematic structural diagram of an apparatus for identifying blocked keywords according to an embodiment of the present disclosure. As shown in fig. 4, the apparatus may include:

a first data obtaining module 402, configured to obtain the number of times of use of the target keyword; the used times are obtained by counting the number of the shared information containing the target keyword sent to the first terminal set;

a second data obtaining module 404, configured to obtain reflow times of the target keyword; the reflow times are obtained by counting the times of access requests initiated by the acquired second terminal set based on the sharing information containing the target keyword;

a reflow rate calculation module 406, configured to determine a reflow rate of the target keyword based on the reflow times and the used times;

the judging module 408 is configured to judge whether the reflux rate is less than or equal to a preset reflux rate, so as to obtain a judgment result;

a result determining module 410, configured to determine the target keyword as a blocked keyword when the determination result indicates that the backflow rate is less than or equal to a preset backflow rate.

The examples of this specification also provide some specific embodiments of the apparatus based on the apparatus of fig. 4, which is described below.

Optionally, the apparatus for identifying blocked keywords provided in this embodiment of the present specification may further include:

the information generation module is used for acquiring a sharing request sent by a first terminal in the first terminal set; the sharing request is a request for sharing the page to be shared;

the first data acquisition module is specifically configured to:

Optionally, the apparatus may further include:

the request acquisition module is used for acquiring the access request initiated by the second terminal in the second terminal set based on the sharing information within a preset time period; the preset time period is a time period with a preset duration taking the moment of generating the sharing information as an initial time;

the second data obtaining module may be specifically configured to:

Optionally, the first data obtaining module may be further specifically configured to:

the second data obtaining module may be further configured to:

Based on the same idea, the embodiment of the present specification further provides a device corresponding to the above method. Fig. 5 is a schematic structural diagram of an apparatus for identifying blocked keywords according to an embodiment of the present disclosure. As shown in fig. 5, the apparatus 500 may include:

at least one processor 510; and the number of the first and second groups,

a memory 530 communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory 530 stores instructions 520 executable by the at least one processor 510 to enable the at least one processor 510 to:

and when the judgment result shows that the reflux rate is less than or equal to a preset reflux rate, determining the target keyword as a blocked keyword.

Based on the same idea, the embodiment of the present specification further provides a computer-readable medium corresponding to the above method. The computer readable medium has computer readable instructions stored thereon, which are executable by the processor to implement the above-mentioned method of identifying blocked keywords:

the embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the apparatus shown in fig. 5, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to part of the description of the method embodiment.

In the 90 s of the 20 th century, improvements in a technology could clearly distinguish between improvements in hardware (e.g., improvements in circuit structures such as diodes, transistors, switches, etc.) and improvements in software (improvements in process flow). However, as technology advances, many of today's process flow improvements have been seen as direct improvements in hardware circuit architecture. Designers almost always obtain the corresponding hardware circuit structure by programming an improved method flow into the hardware circuit. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), is an integrated circuit whose Logic functions are determined by programming the Device by a user. A digital character system is "integrated" on a PLD by the designer's own programming without requiring the chip manufacturer to design and fabricate a dedicated integrated circuit chip. Furthermore, nowadays, instead of manually making an Integrated Circuit chip, such Programming is often implemented by "logic compiler" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one but many, such as abel (advanced Boolean Expression Language), ahdl (alternate Hardware Description Language), traffic, pl (core universal Programming Language), HDCal (jhdware Description Language), lang, Lola, HDL, laspam, hardward Description Language (vhr Description Language), vhal (Hardware Description Language), and vhigh-Language, which are currently used in most common. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.

The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, and an embedded microcontroller, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may thus be considered a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.

The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, 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.

For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functionality of the units may be implemented in one or more software and/or hardware when implementing the present application.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

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

The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, 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 disc read only memory (CD-ROM), Digital Versatile Disks (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices, or any other non-transmission medium which can be used to store information which can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The application may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The application may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

Claims

1. A method of identifying blocked keywords, comprising:

2. The method of claim 1, before obtaining the number of times of use of the target keyword, further comprising:

the obtaining of the number of times of use of the target keyword specifically includes:

3. The method of claim 2, before obtaining the reflow times of the target keyword, further comprising:

the obtaining of the reflow times of the target keyword specifically includes:

4. The method according to claim 3, wherein the determining the number of times the target keyword is used based on the shared information specifically includes:

5. The method according to claim 3, wherein the determining the number of times the target keyword is used based on the shared information specifically includes:

6. The method according to claim 1, wherein the determining the reflow rate of the target keyword based on the reflow times and the used times specifically includes:

and determining the reflux rate of the target keyword based on the ratio.

7. The method of claim 3, wherein the shared information comprises text information and code information; the access request comprises code information in the sharing information corresponding to the access request;

the method further comprises the following steps:

8. The method of claim 3, wherein the shared information comprises text information and code information; the text information comprises the target key words; the access request comprises code information in the sharing information corresponding to the access request;

the method further comprises the following steps:

9. The method of claim 1, wherein the blocked keywords comprise keywords that are prohibited from performing a copy operation or prohibited from performing a display operation.

10. The method of claim 2, further comprising:

the generating the sharing information specifically includes:

acquiring at least one target keyword in the keyword lexicon;

and generating the sharing information based on the target keyword.

11. The method of claim 10, after determining the target keyword as a blocked keyword, further comprising:

12. The method according to claim 11, wherein the generating the shared information specifically includes:

acquiring at least one keyword in the keyword lexicon;

judging whether the keywords are marked keywords or not;

and generating the sharing information based on the target keyword.

13. The method of claim 1, further comprising:

determining a replacement word lexicon;

and generating new sharing information based on the replacement words.

14. The method of claim 1, after determining the target keyword as a blocked keyword, further comprising:

15. The method of claim 1, wherein determining the target keyword as a blocked keyword further comprises:

16. An apparatus for identifying blocked keywords, comprising:

17. The apparatus of claim 16, further comprising:

the first data acquisition module is specifically configured to:

18. The apparatus of claim 16, further comprising:

the second data acquisition module is specifically configured to:

19. The apparatus of claim 18, wherein the first data obtaining module is further configured to:

the second data obtaining module is specifically further configured to:

20. An apparatus for identifying blocked keywords, comprising:

at least one processor; and the number of the first and second groups,

21. A computer readable medium having stored thereon computer readable instructions executable by a processor to implement the method of identifying blocked keywords of any of claims 1 to 15.