CN111159329B - Sensitive word detection method, device, terminal equipment and computer readable storage medium - Google Patents
Sensitive word detection method, device, terminal equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN111159329B CN111159329B CN201911344871.4A CN201911344871A CN111159329B CN 111159329 B CN111159329 B CN 111159329B CN 201911344871 A CN201911344871 A CN 201911344871A CN 111159329 B CN111159329 B CN 111159329B
- Authority
- CN
- China
- Prior art keywords
- sensitive word
- character
- node
- sensitive
- storage
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000001514 detection method Methods 0.000 title claims abstract description 53
- 238000000034 method Methods 0.000 claims abstract description 43
- 238000004590 computer program Methods 0.000 claims description 20
- 238000011068 loading method Methods 0.000 claims description 11
- 238000010586 diagram Methods 0.000 description 13
- 230000008569 process Effects 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/31—Indexing; Data structures therefor; Storage structures
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Machine Translation (AREA)
Abstract
The embodiment of the application is suitable for the technical field of text detection, and discloses a sensitive word detection method, a device, terminal equipment and a computer readable storage medium, wherein the method comprises the following steps: acquiring a text to be detected; executing a character matching step for each character to be matched in the text to be detected to obtain a matching result; and obtaining a sensitive word detection result of the text to be detected according to the matching result. According to the embodiment of the application, each character of the sensitive word is stored in the sensitive word container in a nested and recursive manner, so that the complexity of detecting the sensitive word is equal to the character length of the sensitive word, the complexity of detecting the sensitive word is reduced, and the detection efficiency of the sensitive word is improved.
Description
Technical Field
The application belongs to the technical field of text detection, and particularly relates to a sensitive word detection method, a device, terminal equipment and a computer readable storage medium.
Background
At present, some sensitive information and words are not allowed to appear in the text, so that sensitive word detection is required to be performed on the text to filter or screen out the sensitive word information in the text.
In the prior art, the detection of sensitive words has a rule-based detection method, a finite state machine-based method or a machine learning-based detection method, and the detection efficiency of the methods is very limited.
Disclosure of Invention
The embodiment of the application provides a sensitive word detection method, a device, terminal equipment and a computer readable storage medium, which are used for solving the problem of low detection efficiency of the existing sensitive word.
In a first aspect, an embodiment of the present application provides a method for detecting a sensitive word, including:
acquiring a text to be detected;
executing a character matching step on each character to be matched in the text to be detected to obtain a matching result;
obtaining a sensitive word detection result of the text to be detected according to the matching result;
the character matching step is used for:
comparing the character to be matched with the character of the root node of the sensitive word container to determine whether the characters are consistent;
if the character to be matched is consistent with the character of the root node and the end flag bit of the sensitive word is a preset value, returning a successful matching result;
if the character to be matched is consistent with the character of the root node, and the end flag bit of the sensitive word is not a preset value, k=1, entering a circulation step: matching the kth character after the character to be matched with the character of the kth leaf node of the root node, and determining whether the characters are consistent;
If the kth character is consistent with the characters of the kth leaf node, returning to the circulation step after k=k+1 when the end flag bit of the sensitive word is not a preset value; when the end flag bit of the sensitive word is a preset value, returning a successful matching result;
and if the kth character is inconsistent with the character of the kth leaf node, returning a matching failure result.
In the embodiment of the application, the complexity of the detection of the sensitive word is equal to the length of the sensitive word by storing the sensitive word in the sensitive word container in a nested and recursive manner, and the length of the sensitive word in the daily condition is not too long, so that the complexity of the detection of the sensitive word is reduced, and the detection efficiency of the sensitive word is improved.
In a possible implementation manner of the first aspect, the sensitive word container includes at least one storage branch, and one storage branch is used for storing one sensitive word; the storage branch comprises at least one node, wherein a first node in the storage branch is a root node, and a non-first node is a leaf node; one node corresponds to one storage object;
the data structure of the storage object is a key value data structure, and the storage object comprises a key value and a value; in one storage branch, storing a value of a storage object of an mth node as a storage object of an mth+1th node, wherein each character of a sensitive word corresponding to the storage branch sequentially stores a key value of each storage object, and m is a positive integer greater than or equal to 1;
If the first j characters of the two sensitive words are the same and the j+1th characters are different, the first j nodes of the corresponding two storage branches are the same, the j+1th nodes and the following nodes are different, and j is greater than or equal to 0.
It can be seen that, in the embodiment of the application, the sensitive word container for storing the sensitive words is based on the key value data structure, and each storage object is nested and recursive, namely the sensitive words are stored in the sensitive word container in a nested and recursive manner, so that the complexity of sensitive word detection is equal to the length of the sensitive words, and the length of the sensitive words in the daily case is not too long, thereby reducing the complexity of sensitive word detection and improving the sensitive word detection efficiency.
In a possible implementation manner of the first aspect, the storage object is a Map object;
the sensitive words are stored in the following manner:
storing the mth character of the sensitive word in a key value of a Map object of the mth node of the corresponding storage branch; storing the value of the Map object of the mth node as the Map object of the (m+1) th node, wherein m is greater than or equal to 1 and less than or equal to the number of characters of the sensitive word;
if the j-th character of the newly added sensitive word is the same as the j-th character of the stored sensitive word in the sensitive word container, and the j+1th character is different, newly creating i nodes, and sequentially storing the j+1th and subsequent characters of the newly added sensitive word in the i nodes, wherein i is equal to the number of the characters of the newly added sensitive word minus j.
It can be understood that the Map object is a typical data structure of key value pairs, and storing the value of the Map object of the mth node as the Map object of the (m+1) th node realizes the nested recursion of the Map object.
In a possible implementation manner of the first aspect, the storage branch further includes a target Map object for storing end flag information, where the target Map object is stored in a value of a Map object corresponding to a last character of the sensitive word corresponding to the storage branch.
In a possible implementation manner of the first aspect, before acquiring the text to be detected, the method further includes:
initializing sensitive word data and loading the sensitive word data into a memory.
In a possible implementation manner of the first aspect, initializing sensitive word data, loading the sensitive word data into a memory, and including:
acquiring the sensitive word data;
constructing the sensitive word container;
performing a single sensitive word addition step for: reading a sensitive word from the sensitive word data as a sensitive word to be loaded; sequentially storing the mth character of the sensitive word to be loaded in the key value of the Map object of the mth node of the corresponding storage branch, and storing the value of the Map object of the mth node as the Map object of the (m+1) th node; when the character addition of the sensitive word to be loaded is finished, storing end zone bit information of the sensitive word to be loaded in a target Map object, wherein the target Map object is stored in a value of the Map object corresponding to the last character of the sensitive word to be loaded;
And repeatedly executing the single sensitive word adding step until all the sensitive word data are added to the sensitive word container.
It should be noted that, the data amount of the sensitive word stock is more, which results in more storage resources occupied by the sensitive word container, and thus, the initialization of the sensitive word container is time-consuming. The sensitive word data is initialized and loaded into the memory in advance, so that the sensitive word matching operation can be performed in the memory, and the detection efficiency is further improved. In addition, since the sensitive words are stored in the constant pool of the memory, even if the sensitive word data occupies a large memory, the sensitive word data cannot be recovered, so that the detection performance is further improved.
In a possible implementation manner of the first aspect, obtaining a detection result of the sensitive word of the text to be detected according to the matching result includes:
and acquiring the sensitive words corresponding to the successful matching result, wherein the sensitive words corresponding to the successful matching result are the sensitive words of the text to be detected.
In a possible implementation manner of the first aspect, after obtaining a detection result of the sensitive word of the text to be detected according to the matching result, the method further includes:
counting the number of sensitive words corresponding to the successful matching result;
And/or
Marking sensitive words corresponding to the successful matching result in the text to be detected.
In a second aspect, an embodiment of the present application provides a terminal device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor implementing the method according to any one of the first aspects when executing the computer program.
In a third aspect, embodiments of the present application provide a computer readable storage medium storing a computer program which, when executed by a processor, implements a method as in any of the first aspects above.
In a fourth aspect, an embodiment of the application provides a computer program product for, when run on a terminal device, causing the terminal device to perform the method of any of the first aspects above.
It will be appreciated that the advantages of the second to fifth aspects may be found in the relevant description of the first aspect, and are not described here again.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic block diagram of a method for detecting sensitive words according to an embodiment of the present application;
FIG. 2 is a schematic diagram of storage object nesting provided in an embodiment of the present application;
FIG. 3 is a schematic diagram of a sensitive word nesting structure provided by an embodiment of the present application;
FIG. 4 is a schematic block diagram of another flow chart of a method for detecting a sensitive word according to an embodiment of the present application;
FIG. 5 is a schematic block diagram of a process of initializing a loading method according to an embodiment of the present application;
FIG. 6 is a schematic block diagram of a sensitive word detection device according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a terminal device according to an embodiment of the present application.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth such as the particular system architecture, techniques, etc., in order to provide a thorough understanding of the embodiments of the present application.
The sensitive word detection scheme provided by the embodiment of the application can be applied to terminal equipment such as mobile phones, tablet computers, wearable equipment, vehicle-mounted equipment, notebook computers, ultra-mobile personal computer (UMPC), netbooks, personal digital assistants (personal digital assistant, PDA) and the like, and the embodiment of the application does not limit the specific types of the terminal equipment.
Referring to fig. 1, a schematic flow diagram of a method for detecting a sensitive word according to an embodiment of the present application may include the following steps:
step S101, acquiring a text to be detected.
It should be noted that, the text to be detected refers to a text that needs to be detected by a sensitive word, and includes at least one character. The text to be detected may be, but is not limited to, chinese text or english text.
The text to be detected can be a network text, that is, the sensitive word detection scheme of the embodiment of the application can apply the sensitive word detection of the network text, at this time, the server side can acquire the text content input by the user at the client side to acquire the text to be detected, then the sensitive word detection is performed on the input text content to acquire a sensitive word detection result, and then the text content input by the user is filtered, replaced or the business abnormality is returned to the client side based on the detected sensitive word. For example, when detecting that "xx" input by the user is a sensitive word, the word may be filtered out, or the word may be replaced with a corresponding synonym, or a prompt message such as "the word is a sensitive word, please input other alternative words" is returned to the user client, so as to prompt the user that the currently input word is a sensitive word.
Of course, the text to be detected may be other types of text, that is, the sensitive word detection scheme provided by the embodiment of the present application may also be applied to other scenes, and is not limited to the above-mentioned network document content detection scene.
And step S102, executing a character matching step for each character to be matched in the text to be detected, and obtaining a matching result.
In a specific application, the steps of matching characters in the text to be detected are sequentially performed, for example, the steps of matching characters are performed on a first character in the text to be detected, then the steps of matching characters are performed on a second character, then the results of matching characters are performed on a third character, and so on until all the characters in the text to be detected are detected.
In the character matching step, matching the character to be matched with the sensitive word stored in the sensitive word container to obtain a matching result.
The sensitive word container comprises at least one storage branch, wherein one storage branch is used for storing one sensitive word; the storage branch comprises at least one node, and one node corresponds to one storage object;
the data structure of the storage object is a key value data structure, and the storage object comprises a key value and a value; in one storage branch, storing a value of a storage object of an mth node as a storage object of an mth+1th node, sequentially storing key values of all the storage objects by all characters of a sensitive word corresponding to the storage branch, wherein m is a positive integer greater than or equal to 1;
If the first j characters of the two sensitive words are the same and the j+1th characters are different, the first j nodes of the corresponding two storage branches are the same, the j+1th nodes and the following nodes are different, and j is greater than or equal to 0.
It should be noted that the storage object is a data structure of key-value pairs, which includes key-value. The value of the storage object of the mth node stores the storage object index as the (m+1) th node: the value of the storage object of the 1 st node stores a storage object, and the storage object is used as the 2 nd node; the value of the second node stores a storage object, and the storage object is used as the 3 rd node; the value of the 3 rd node stores a storage object, the storage object is used as the 4 th node, and so on, and the value of the storage object of the m th node stores the storage object which is used as the m+1th node. That is, the relationships between storage objects are nested recursively.
Referring specifically to the storage object nesting schematic diagram shown in fig. 2, as shown in fig. 2, storage objects storing a key-value key value pair are nested in each value, and are nested in sequence.
One storage branch stores a sensitive word, each character of the sensitive word is generally stored in the key value of each node according to a sequential method, namely, the first character of the sensitive word is stored in the key value of the first node, the second character is stored in the key value of the second node, the third character is stored in the key value of the third node, and so on, and the mth character is stored in the key value of the mth node.
If the first j characters of the two sensitive words are the same and the j+1th character is different, the first j nodes of the two corresponding storage branches are the same, the j+1th node and the following nodes are different, and j is greater than or equal to 0, specifically: the nodes corresponding to consecutive identical characters are identical. Specifically, j=0, that is, the first 0 characters of the two sensitive words are the same, that is, the two sensitive words do not have the same characters, and then the 1 st node and the following nodes of the two sensitive words are different, that is, all the nodes are different. When j=1, that is, the first characters of the two sensitive words are the same, the first nodes of the two sensitive words are the same, and the 2 nd node and the following nodes are different. When j=3, the first 3 characters of the two sensitive words are the same, the first 3 nodes of the two sensitive words are the same, and the 4 th node and the following nodes are different; and so on, the first j characters are the same, the j+1th characters are different, and the j+1th nodes and the following nodes are different for the first j nodes.
Referring to the schematic diagram of the nesting structure of the sensitive words shown in fig. 3, as shown in fig. 3, the nesting structure comprises a sensitive word DEF, ABD, AFG and a DEF, wherein the first 2 characters of two sensitive words ABC and ABD are the same, the first 2 characters a and B of the two sensitive words are stored in the same node, and C and D are respectively stored in different nodes. The first 1 characters of the two sensitive words of ABD and AFG are the same, the first 1 characters A of the two sensitive words are all stored in the same node, and the last two different characters are respectively stored in different nodes. The first 0 characters of the two sensitive words AFG and DEF are the same, i.e. the two sensitive words are not the same, then all nodes of the two sensitive words are not the same.
As shown in fig. 3, the root is a root node, that is, a first node, and a and D are respectively stored as different key values in the first node.
In the embodiment of the present application, a storage branch is used to store a sensitive word, and as shown in fig. 3, ABC, ABD, AFG and DEF are both storage branches.
In some embodiments, the first node in the storage branch is a root node and the non-first node is a leaf node; the storage object is a Map object. Map objects are more typical data structures, and a Map object can be created by using Map tool classes. The value of the Map Object is an Object, and any type of data can be stored, so that a Map Object can be stored in the value of the Map Object to realize recursive operation.
At least one sensitive word is stored in the sensitive word container, and the storage mode of the sensitive word can be as follows:
storing the mth character of the sensitive word in a key value of a Map object of the mth node of the corresponding storage branch; the value of the Map object of the mth node stores the Map object as the mth+1th node, m is greater than or equal to 1 and is less than or equal to the number of characters of the sensitive word.
The method specifically comprises the following steps: and storing each character of the sensitive word to the key value of the corresponding node in sequence. For example, taking the sensitive word ABC as an example, the sensitive word includes A, B, C three characters, storing the character a in the key value of the Map object of the first node (i.e., the root node), storing the character B in the key value of the Map object of the second node (i.e., the first leaf node), and storing the character C in the key value of the Map object of the third node (i.e., the second leaf node) according to the sequence of the characters.
If the j-th character of the newly added sensitive word is the same as the j-th character of the stored sensitive word in the sensitive word container, and the j+1th character is different, newly creating i nodes, sequentially storing the j+1th character of the newly added sensitive word and the characters behind the j+th character in the i nodes, wherein i is equal to the number of the characters of the newly added sensitive word minus j.
Specifically, if the sensitive word to be added to the sensitive word container is the same as the first j characters of the stored sensitive word, storing the first j characters of the newly added sensitive word to the first j nodes of the stored sensitive word, then newly building i nodes, and storing the following characters to the i nodes.
For example, referring to fig. 3, the stored sensitive word is ABC, the newly added sensitive word is ABD, the first 2 characters of the two sensitive words are the same, the character a and the character B do not need to build a new node, only a value of a Map object corresponding to the character B needs to be built, then a Map object is stored in the value, and the character D is stored to a key value of the Map object.
For example, referring to fig. 3, the stored sensitive word is ABC, the newly added sensitive word is DEF, and since the first characters of the two words are different, another key value of the root node is newly built for storing a D character, then a Map object is stored in a value corresponding to the other key value, an E character is stored in the key value of the Map object, and an F character is stored in the key value of the third node.
In some embodiments, the storage branch further includes a target Map object for storing end flag information, where the target Map object is stored in a value of a Map object corresponding to a last character of the sensitive word corresponding to the storage branch. The value of the Map object corresponding to the last character of the sensitive word is stored with a Map object, the Map object is used for storing end mark information, and the end mark information is used for indicating that the storage branch is ended, namely, indicating that the sensitive word corresponding to the storage branch is ended.
In a specific application, the key value of the target Map object may store "isEnd", and the value of the target Map object may store a value "1".
In a specific application, a single character matching step can be performed on each character to be matched in the text to be detected, so as to obtain a matching result.
Wherein, the character matching step is used for:
the first step: and comparing the character to be matched with the character of the root node of the sensitive word container, and determining whether the characters are consistent.
And a second step of: and if the character to be matched is consistent with the character of the root node, and the end flag bit of the sensitive word is a preset value, returning a successful matching result.
And a third step of: if the character to be matched is consistent with the character of the root node, and the end flag bit of the sensitive word is not a preset value, k=1, entering a circulation step: and matching the kth character after the character to be matched with the character of the kth leaf node of the root node, and determining whether the characters are consistent.
Fourth step: if the kth character is consistent with the character of the kth leaf node, returning to the circulation step after k=k+1 when the end flag bit of the sensitive word is not a preset value; and when the end flag bit of the sensitive word is a preset value, returning a successful matching result.
Fifth step: and if the kth character is inconsistent with the character of the kth leaf node, returning a matching failure result.
It should be noted that, the matching failure result is a miss, that is, there is no sensitive word corresponding to the character to be matched. And the successful matching result is hit, namely the sensitive word corresponding to the character to be matched is searched.
Characters of each node in the sensitive word container are stored in key values of the nodes. If the character to be matched is inconsistent with the key value in the root node, the corresponding sensitive word is not found, and a matching failure result is returned. Otherwise, if the character to be matched is consistent with the key value of the root node, and the Map object of the value of the root node stores the end mark information, that is, the end mark bit of the sensitive word is a preset value (the preset value may be, for example, 1), the corresponding sensitive word is found, and the sensitive word is the sensitive word of a single character.
If the character to be matched is consistent with the character in the key value of the root node, and the Map object in the value of the root node does not store the end mark information, that is, the end mark bit of the sensitive word is not a preset value (the preset value may be, for example, 1), k=1, and the loop step is entered: and matching the kth character after the character to be matched with the character of the kth leaf node of the root node, and determining whether the characters are consistent. If the kth character is consistent with the character of the kth leaf node, returning to the circulation step after k=k+1 when the end flag bit of the sensitive word is not a preset value; when the end flag bit of the sensitive word is a preset value, returning a successful matching result; and if the kth character is inconsistent with the character of the kth leaf node, returning a matching failure result.
In other words, if the character to be matched is consistent with the character in the key value of the root node, and the sensitive word in the sensitive word container has not ended yet, the comparison can be continued between the next character to be matched and the character in the key value as the second node, whether the character to be matched is consistent is determined, if the character to be matched is consistent with the character in the key value as the second node, and if the Map object of the third node stores the ending mark information, the corresponding sensitive word is detected. If the comparison result is consistent and the Map object of the third node does not store the end mark information, continuing to compare the Map object with the end mark information until the sentence end of the sentence corresponding to the character to be matched is reached or a matching result is obtained. .
The sensitive word end flag bit may characterize whether the sensitive word is ended. Which may be stored in the target Map object. The key value of the target Map object may store "isEnd", and the value stores a preset value, which may be, but is not limited to, 1.
And step S103, obtaining a sensitive word detection result of the text to be detected according to the matching result.
In specific application, the sensitive words in the text to be detected can be obtained by obtaining the sensitive words corresponding to the successful matching result. The sensitive words corresponding to the successful matching result are the sensitive words of the text to be detected.
In the embodiment of the application, the sensitive word container for storing the sensitive words is based on a key value data structure, and each storage object is nested and recursive, namely the sensitive words are stored in the sensitive word container in a nested and recursive manner, so that the complexity of sensitive word detection is equal to the length of the sensitive words, and the length of the sensitive words in the daily condition is not too long, thereby reducing the complexity of sensitive word detection and improving the sensitive word detection efficiency.
Referring to fig. 4, another flow chart of a method for detecting a sensitive word according to an embodiment of the present application is shown, where the method may include the following steps:
step S401, initializing sensitive word data and loading the sensitive word data into a memory.
Referring to the flow schematic block diagram of the initialization loading method shown in fig. 5, the step of initializing the sensitive word data and loading the sensitive word data into the memory may include:
step S501, sensitive word data is acquired.
In a specific application, the sensitive word data may be read from a file stream or database.
Step S502, constructing a sensitive word container.
When the storage object is a Map object, a Map data type of the root node can be specifically established to establish a sensitive word container.
Step S503, executing a single sensitive word adding step, where the single sensitive word adding step is used for: reading a sensitive word from the sensitive word data as a sensitive word to be loaded; sequentially storing the mth character of the sensitive word to be loaded in the key value of the Map object of the mth node of the corresponding storage branch, and storing the value of the Map object of the mth node as the Map object of the (m+1) th node; when the character addition of the sensitive word to be loaded is finished, storing end zone bit information of the sensitive word to be loaded in a target Map object, wherein the target Map object is stored in a value of the Map object corresponding to the last character of the sensitive word to be loaded.
And step S504, repeatedly executing the single sensitive word adding step until the sensitive word data are all added into the sensitive word container.
Specifically, a single sensitive word adding step is performed for each sensitive word to add all the sensitive words to the constructed sensitive word container, so that sensitive word data is initialized and loaded into the memory.
The process of adding a sensitive word to a sensitive word container specifically comprises the following steps:
storing a first character of the sensitive word into a key value of a first node (namely a root node), and then storing a Map object serving as a second node in a value of the first node; and storing the second character into the key value of the second node, storing a Map object serving as a third node in the value of the second node, and so on until all the characters of the sensitive word are stored, and then storing a target Map object in the value corresponding to the last character.
It can be understood that when the newly added sensitive word is the same as the first j characters of the stored sensitive word and the last i characters are different, only i nodes are needed to be newly built, and the last i characters are sequentially stored into key values of the i nodes. See the corresponding details above, and will not be repeated here.
It should be noted that, the data amount of the sensitive word stock is more, which results in more storage resources occupied by the sensitive word container, and thus, the initialization of the sensitive word container is time-consuming. The sensitive word data is initialized and loaded into the memory in advance, so that the sensitive word matching operation can be performed in the memory, and the detection efficiency is further improved. In addition, since the sensitive words are stored in the constant pool of the memory, even if the sensitive word data occupies a large memory, the sensitive word data cannot be recovered, so that the detection performance is further improved.
Step S402, acquiring a text to be detected.
And step S403, executing a character matching step on each character to be matched in the text to be detected, and obtaining a matching result.
And step S404, obtaining a sensitive word detection result of the text to be detected according to the matching result.
Steps S402 to S404 are the same as steps S101 to S103, and the relevant content is referred to the corresponding content and will not be described here again.
Step S405, counting the number of sensitive words corresponding to the successful matching result; and/or marking sensitive words corresponding to the successful matching result in the text to be detected.
Specifically, after determining the sensitive words in the text to be detected, the number of the sensitive words in the text can be counted, or the sensitive words are marked in the text.
In the embodiment of the application, the starting position of character matching can be specified, and all words in a whole sentence can be specified to be detected.
According to the embodiment, the sensitive word data is initialized and loaded into the memory, and character matching operation is carried out in the memory, so that the detection efficiency is further improved.
It should be understood that the sequence number of each step in the foregoing embodiment does not mean that the execution sequence of each process should be determined by the function and the internal logic, and should not limit the implementation process of the embodiment of the present application.
Corresponding to the method for detecting a sensitive word described in the above embodiments, fig. 6 shows a block diagram of a device for detecting a sensitive word according to an embodiment of the present application, and for convenience of explanation, only a portion related to the embodiment of the present application is shown.
Referring to fig. 6, the apparatus includes:
an obtaining module 61, configured to obtain a text to be detected;
The matching module 62 is configured to perform a character matching step on each character to be matched in the text to be detected, so as to obtain a matching result;
the detection module 63 is configured to obtain a detection result of the sensitive word of the text to be detected according to the matching result;
the matching module is specifically used for:
comparing the character to be matched with the character of the root node of the sensitive word container to determine whether the characters are consistent;
if the character to be matched is consistent with the character of the root node, and the end flag bit of the sensitive word is a preset value, returning a successful matching result;
if the character to be matched is consistent with the character of the root node, and the end flag bit of the sensitive word is not a preset value, k=1, entering a circulation step: matching the kth character after the characters to be matched with the characters of the kth leaf node of the root node, and determining whether the characters are consistent;
if the kth character is consistent with the character of the kth leaf node, returning to the circulation step after k=k+1 when the end flag bit of the sensitive word is not a preset value; when the end flag bit of the sensitive word is a preset value, returning a successful matching result;
and if the kth character is inconsistent with the character of the kth leaf node, returning a matching failure result.
In one possible implementation, the sensitive word container includes at least one storage branch, one storage branch for storing one sensitive word; the storage branch comprises at least one node, and one node corresponds to one storage object;
The data structure of the storage object is a key value data structure, and the storage object comprises a key value and a value; in one storage branch, storing a value of a storage object of an mth node as a storage object of an mth+1th node, sequentially storing key values of all the storage objects by all characters of a sensitive word corresponding to the storage branch, wherein m is a positive integer greater than or equal to 1;
if the first j characters of the two sensitive words are the same and the j+1th characters are different, the first j nodes of the corresponding two storage branches are the same, the j+1th nodes and the following nodes are different, and j is greater than or equal to 0.
In one possible implementation, the first node in the storage branch is a root node, and the non-first node is a leaf node; the storage object is a Map object;
the sensitive words are stored in the following manner:
storing the mth character of the sensitive word in a key value of a Map object of the mth node of the corresponding storage branch; storing the value of the Map object of the mth node as the Map object of the (m+1) th node, wherein m is greater than or equal to 1 and less than or equal to the number of characters of the sensitive word;
if the j-th character of the newly added sensitive word is the same as the j-th character of the stored sensitive word in the sensitive word container, and the j+1th character is different, newly creating i nodes, sequentially storing the j+1th character of the newly added sensitive word and the characters behind the j+th character in the i nodes, wherein i is equal to the number of the characters of the newly added sensitive word minus j.
In one possible implementation manner, the storage branch further includes a target Map object for storing the end flag information, where the target Map object is stored in a value of the Map object corresponding to the last character of the sensitive word corresponding to the storage branch.
In one possible implementation manner, the apparatus further includes:
the initialization loading module is used for initializing the sensitive word data and loading the sensitive word data into the memory.
In one possible implementation manner, the initialization loading module is specifically configured to:
acquiring sensitive word data;
constructing a sensitive word container;
performing a single sensitive word addition step for: reading a sensitive word from the sensitive word data as a sensitive word to be loaded; sequentially storing the mth character of the sensitive word to be loaded in the key value of the Map object of the mth node of the corresponding storage branch, and storing the value of the Map object of the mth node as the Map object of the (m+1) th node; when the character addition of the sensitive word to be loaded is finished, storing end zone bit information of the sensitive word to be loaded in a target Map object, wherein the target Map object is stored in a value of the Map object corresponding to the last character of the sensitive word to be loaded;
And repeatedly executing the single sensitive word adding step until the sensitive word data are all added to the sensitive word container.
In one possible implementation manner, the detection module is specifically configured to:
and acquiring sensitive words corresponding to the successful matching result, wherein the sensitive words corresponding to the successful matching result are the sensitive words of the text to be detected.
In one possible implementation manner, the apparatus may further include:
the statistics module is used for counting the number of sensitive words corresponding to the successful matching result;
and/or
And the marking module is used for marking the sensitive words corresponding to the successful matching result in the text to be detected.
The sensitive word detection device has the function of realizing the sensitive word detection method, the function can be realized by hardware, the corresponding software can also be realized by hardware execution, the hardware or the software comprises one or more modules corresponding to the function, and the modules can be software and/or hardware.
It should be noted that, because the content of information interaction and execution process between the above devices/modules is based on the same concept as the method embodiment of the present application, specific functions and technical effects thereof may be referred to in the method embodiment section, and will not be described herein.
Fig. 7 is a schematic structural diagram of a terminal device according to an embodiment of the present application. As shown in fig. 7, the terminal device 7 of this embodiment includes: at least one processor 70, a memory 71 and a computer program 72 stored in the memory 71 and executable on the at least one processor 70, the processor 70 implementing the steps of any of the various method embodiments described above when executing the computer program 72.
The terminal device 7 may be a computing device such as a desktop computer, a notebook computer, a palm computer, a cloud server, etc. The terminal device may include, but is not limited to, a processor 70, a memory 71. It will be appreciated by those skilled in the art that fig. 7 is merely an example of the terminal device 7 and is not limiting of the terminal device 7, and may include more or fewer components than shown, or may combine certain components, or different components, such as may also include input-output devices, network access devices, etc.
The processor 70 may be a central processing unit (Central Processing Unit, CPU) and the processor 70 may be other general purpose processors, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), an off-the-shelf programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 71 may in some embodiments be an internal storage unit of the terminal device 7, such as a hard disk or a memory of the terminal device 7. The memory 71 may in other embodiments also be an external storage device of the terminal device 7, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card) or the like, which are provided on the terminal device 7. Further, the memory 71 may also include both an internal storage unit and an external storage device of the terminal device 7. The memory 71 is used for storing an operating system, application programs, boot loader (BootLoader), data, other programs, etc., such as program codes of the computer program. The memory 71 may also be used for temporarily storing data that has been output or is to be output.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of the functional units and modules is illustrated, and in practical application, the above-described functional distribution may be performed by different functional units and modules according to needs, i.e. the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-described functions. The functional units and modules in the embodiment may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit, where the integrated units may be implemented in a form of hardware or a form of a software functional unit. In addition, the specific names of the functional units and modules are only for distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working process of the units and modules in the above system may refer to the corresponding process in the foregoing method embodiment, which is not described herein again.
Embodiments of the present application also provide a computer readable storage medium storing a computer program which, when executed by a processor, implements steps for implementing the various method embodiments described above.
Embodiments of the present application provide a computer program product which, when run on a terminal device, causes the terminal device to perform steps that enable the implementation of the method embodiments described above.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the present application may implement all or part of the flow of the method of the above embodiments, and may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when the computer program is executed by a processor, the computer program may implement the steps of each of the method embodiments described above. Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include at least: any entity or device capable of carrying computer program code to a photographing device/terminal apparatus, recording medium, computer Memory, read-Only Memory (ROM), random access Memory (RAM, random Access Memory), electrical carrier signals, telecommunications signals, and software distribution media. Such as a U-disk, removable hard disk, magnetic or optical disk, etc. In some jurisdictions, computer readable media may not be electrical carrier signals and telecommunications signals in accordance with legislation and patent practice.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and in part, not described or illustrated in any particular embodiment, reference is made to the related descriptions of other embodiments.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the modules or units is merely a logical functional division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection via interfaces, devices or units, which may be in electrical, mechanical or other forms.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
The above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application.
Claims (10)
1. A method for detecting a sensitive word, comprising:
acquiring a text to be detected;
executing a character matching step on each character to be matched in the text to be detected to obtain a matching result;
Obtaining a sensitive word detection result of the text to be detected according to the matching result;
the character matching step is used for:
comparing the character to be matched with the character of the root node of the sensitive word container to determine whether the characters are consistent;
if the character to be matched is consistent with the character of the root node and the end flag bit of the sensitive word is a preset value, returning a successful matching result;
if the character to be matched is consistent with the character of the root node, and the end flag bit of the sensitive word is not a preset value, k=1, entering a circulation step: matching the kth character after the character to be matched with the character of the kth leaf node of the root node, and determining whether the characters are consistent;
if the kth character is consistent with the characters of the kth leaf node, returning to the circulation step after k=k+1 when the end flag bit of the sensitive word is not a preset value; when the end flag bit of the sensitive word is a preset value, returning a successful matching result;
if the kth character is inconsistent with the characters of the kth leaf node, returning a matching failure result;
the sensitive word container comprises at least one storage branch, and one storage branch is used for storing one sensitive word; the storage branch comprises at least one node, wherein a first node in the storage branch is a root node, and a non-first node is a leaf node; one node corresponds to one storage object;
The data structure of the storage object is a key value data structure, and the storage object comprises a key value and a value; in one storage branch, storing a value of a storage object of an mth node as a storage object of an mth+1th node, wherein each character of a sensitive word corresponding to the storage branch sequentially stores a key value of each storage object, and m is a positive integer greater than or equal to 1;
if the first j characters of the two sensitive words are the same and the j+1th characters are different, the first j nodes of the corresponding two storage branches are the same, the j+1th nodes and the following nodes are different, j is greater than or equal to 0, and each character of the sensitive word is stored in a nested recursion manner in a sensitive word container.
2. The method of claim 1, wherein the storage object is a Map object;
the sensitive words are stored in the following manner:
storing the mth character of the sensitive word in a key value of a Map object of the mth node of the corresponding storage branch; storing the value of the Map object of the mth node as the Map object of the (m+1) th node, wherein m is greater than or equal to 1 and less than or equal to the number of characters of the sensitive word;
if the j-th character of the newly added sensitive word is the same as the j-th character of the stored sensitive word in the sensitive word container, and the j+1th character is different, newly creating i nodes, and sequentially storing the j+1th and subsequent characters of the newly added sensitive word in the i nodes, wherein i is equal to the number of the characters of the newly added sensitive word minus j.
3. The method of claim 2, wherein the storage branch further includes a target Map object for storing end flag information, the target Map object being stored in a value of a Map object corresponding to a last character of the sensitive word corresponding to the storage branch.
4. A method according to claim 2 or 3, further comprising, prior to obtaining the text to be detected:
initializing sensitive word data and loading the sensitive word data into a memory.
5. The method of claim 4, wherein initializing the sensitive word data, loading the sensitive word data into memory, comprises:
acquiring the sensitive word data;
constructing the sensitive word container;
performing a single sensitive word addition step for: reading a sensitive word from the sensitive word data as a sensitive word to be loaded; sequentially storing the mth character of the sensitive word to be loaded in the key value of the Map object of the mth node of the corresponding storage branch, and storing the value of the Map object of the mth node as the Map object of the (m+1) th node; when the character addition of the sensitive word to be loaded is finished, storing end zone bit information of the sensitive word to be loaded in a target Map object, wherein the target Map object is stored in a value of the Map object corresponding to the last character of the sensitive word to be loaded;
And repeatedly executing the single sensitive word adding step until all the sensitive word data are added to the sensitive word container.
6. The method of claim 1, wherein obtaining the sensitive word detection result of the text to be detected according to the matching result comprises:
and acquiring the sensitive words corresponding to the successful matching result, wherein the sensitive words corresponding to the successful matching result are the sensitive words of the text to be detected.
7. The method of claim 1, further comprising, after obtaining the sensitive word detection result of the text to be detected according to the matching result:
counting the number of sensitive words corresponding to the successful matching result;
and/or
Marking sensitive words corresponding to the successful matching result in the text to be detected.
8. A sensitive word detection apparatus, comprising:
the acquisition module is used for acquiring the text to be detected;
the matching module is used for executing a character matching step on each character to be matched in the text to be detected to obtain a matching result;
the detection module is used for obtaining a detection result of the sensitive word of the text to be detected according to the matching result;
the matching module is specifically used for:
Comparing the character to be matched with the character of the root node of the sensitive word container to determine whether the characters are consistent;
if the character to be matched is consistent with the character of the root node and the end flag bit of the sensitive word is a preset value, returning a successful matching result;
if the character to be matched is consistent with the character of the root node, and the end flag bit of the sensitive word is not a preset value, k=1, entering a circulation step: matching the kth character after the character to be matched with the character of the kth leaf node of the root node, and determining whether the characters are consistent;
if the kth character is consistent with the characters of the kth leaf node, returning to the circulation step after k=k+1 when the end flag bit of the sensitive word is not a preset value; when the end flag bit of the sensitive word is a preset value, returning a successful matching result;
if the kth character is inconsistent with the characters of the kth leaf node, returning a matching failure result;
the sensitive word container comprises at least one storage branch, and one storage branch is used for storing one sensitive word; the storage branch comprises at least one node, wherein a first node in the storage branch is a root node, and a non-first node is a leaf node; one node corresponds to one storage object;
The data structure of the storage object is a key value data structure, and the storage object comprises a key value and a value; in one storage branch, storing a value of a storage object of an mth node as a storage object of an mth+1th node, wherein each character of a sensitive word corresponding to the storage branch sequentially stores a key value of each storage object, and m is a positive integer greater than or equal to 1;
if the first j characters of the two sensitive words are the same and the j+1th characters are different, the first j nodes of the corresponding two storage branches are the same, the j+1th nodes and the following nodes are different, j is greater than or equal to 0, and each character of the sensitive word is stored in a nested recursion manner in a sensitive word container.
9. A terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1 to 7 when executing the computer program.
10. A computer readable storage medium storing a computer program, characterized in that the computer program when executed by a processor implements the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911344871.4A CN111159329B (en) | 2019-12-24 | 2019-12-24 | Sensitive word detection method, device, terminal equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911344871.4A CN111159329B (en) | 2019-12-24 | 2019-12-24 | Sensitive word detection method, device, terminal equipment and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111159329A CN111159329A (en) | 2020-05-15 |
| CN111159329B true CN111159329B (en) | 2023-09-08 |
Family
ID=70557887
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911344871.4A Active CN111159329B (en) | 2019-12-24 | 2019-12-24 | Sensitive word detection method, device, terminal equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111159329B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111737398B (en) * | 2020-05-26 | 2023-06-23 | 北京百度网讯科技有限公司 | Method and device for retrieving sensitive words in text, electronic equipment and storage medium |
| CN112052364B (en) * | 2020-09-27 | 2024-07-23 | 深圳前海微众银行股份有限公司 | Sensitive information detection method, device, equipment and computer readable storage medium |
| CN112328732A (en) * | 2020-10-22 | 2021-02-05 | 上海艾融软件股份有限公司 | Sensitive word detection method and device and sensitive word tree construction method and device |
| CN112766236B (en) * | 2021-03-10 | 2023-04-07 | 拉扎斯网络科技（上海）有限公司 | Text generation method and device, computer equipment and computer readable storage medium |
| CN113128220B (en) * | 2021-04-30 | 2023-07-18 | 北京奇艺世纪科技有限公司 | Text discrimination method, text discrimination device, electronic equipment and storage medium |
| CN116776862A (en) * | 2023-08-25 | 2023-09-19 | 福昕鲲鹏(北京)信息科技有限公司 | Sensitive word shielding method, device, equipment and medium of OFD file |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102799596A (en) * | 2011-05-27 | 2012-11-28 | 广州明朝网络科技有限公司 | Key word filtering method and system based on network application |
| CN103617251A (en) * | 2013-11-28 | 2014-03-05 | 金蝶软件（中国）有限公司 | Sensitive word matching method and system |
| CN105117417A (en) * | 2015-07-30 | 2015-12-02 | 西安交通大学 | Read-optimized memory database Trie tree index method |
| CN107463666A (en) * | 2017-08-02 | 2017-12-12 | 成都德尔塔信息科技有限公司 | A kind of filtering sensitive words method based on content of text |
| CN107741833A (en) * | 2017-10-30 | 2018-02-27 | 广东乐心医疗电子股份有限公司 | Storage method and device of nestable key-value |
| CN108038190A (en) * | 2017-12-11 | 2018-05-15 | 杭州有赞科技有限公司 | Filtering sensitive words method and system based on multilayer dictionary tree |
| CN108228760A (en) * | 2017-12-25 | 2018-06-29 | 湛江正信科技服务有限公司 | Method, apparatus, mobile terminal and the storage medium of filtering sensitive words |
| CN109614309A (en) * | 2018-10-22 | 2019-04-12 | 中国平安财产保险股份有限公司 | Compare the method, apparatus, computer equipment and storage medium of test result |
| CN109656950A (en) * | 2018-12-12 | 2019-04-19 | 上海达梦数据库有限公司 | Recursive query method, apparatus, server and storage medium |
| CN109684469A (en) * | 2018-12-13 | 2019-04-26 | 平安科技（深圳）有限公司 | Filtering sensitive words method, apparatus, computer equipment and storage medium |
-
2019
- 2019-12-24 CN CN201911344871.4A patent/CN111159329B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102799596A (en) * | 2011-05-27 | 2012-11-28 | 广州明朝网络科技有限公司 | Key word filtering method and system based on network application |
| CN103617251A (en) * | 2013-11-28 | 2014-03-05 | 金蝶软件（中国）有限公司 | Sensitive word matching method and system |
| CN105117417A (en) * | 2015-07-30 | 2015-12-02 | 西安交通大学 | Read-optimized memory database Trie tree index method |
| CN107463666A (en) * | 2017-08-02 | 2017-12-12 | 成都德尔塔信息科技有限公司 | A kind of filtering sensitive words method based on content of text |
| CN107741833A (en) * | 2017-10-30 | 2018-02-27 | 广东乐心医疗电子股份有限公司 | Storage method and device of nestable key-value |
| CN108038190A (en) * | 2017-12-11 | 2018-05-15 | 杭州有赞科技有限公司 | Filtering sensitive words method and system based on multilayer dictionary tree |
| CN108228760A (en) * | 2017-12-25 | 2018-06-29 | 湛江正信科技服务有限公司 | Method, apparatus, mobile terminal and the storage medium of filtering sensitive words |
| CN109614309A (en) * | 2018-10-22 | 2019-04-12 | 中国平安财产保险股份有限公司 | Compare the method, apparatus, computer equipment and storage medium of test result |
| CN109656950A (en) * | 2018-12-12 | 2019-04-19 | 上海达梦数据库有限公司 | Recursive query method, apparatus, server and storage medium |
| CN109684469A (en) * | 2018-12-13 | 2019-04-26 | 平安科技（深圳）有限公司 | Filtering sensitive words method, apparatus, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111159329A (en) | 2020-05-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111159329B (en) | Sensitive word detection method, device, terminal equipment and computer readable storage medium | |
| CN109582772B (en) | Contract information extraction method, contract information extraction device, computer equipment and storage medium | |
| CN111241389B (en) | Sensitive word filtering method and device based on matrix, electronic equipment and storage medium | |
| CN110474900B (en) | Game protocol testing method and device | |
| US20230205755A1 (en) | Methods and systems for improved search for data loss prevention | |
| US10248646B1 (en) | Token matching in large document corpora | |
| CN113010116B (en) | Data processing method, device, terminal equipment and readable storage medium | |
| CN115840808B (en) | Technological project consultation method, device, server and computer readable storage medium | |
| CN112329954B (en) | Article recall method, device, terminal equipment and storage medium | |
| CN111797594A (en) | Character string processing method based on artificial intelligence and related equipment | |
| CN115982310B (en) | Chain table generation method with verification function and electronic equipment | |
| CN112181430A (en) | Code change statistical method and device, electronic equipment and storage medium | |
| CN110377276B (en) | Source code file management method and device | |
| US20130204839A1 (en) | Validating Files Using a Sliding Window to Access and Correlate Records in an Arbitrarily Large Dataset | |
| CN112199483A (en) | Information input assisting method and device, electronic equipment and storage medium | |
| CN114462381A (en) | Data processing method, device, equipment and storage medium | |
| CN115795466A (en) | Malicious software organization identification method and equipment | |
| CN113703753B (en) | Method and device for product development and product development system | |
| CN115294586A (en) | Invoice identification method and device, storage medium and electronic equipment | |
| CN109840080B (en) | Character attribute comparison method and device, storage medium and electronic equipment | |
| CN113760237A (en) | Compiling address updating method and device, terminal equipment and readable storage medium | |
| CN114611039A (en) | Asynchronous loading rule analysis method and device, storage medium and electronic equipment | |
| CN111198900B (en) | Data caching method and device for industrial control network, terminal equipment and medium | |
| CN114373173A (en) | Data processing method and device, terminal equipment and storage medium | |
| CN113779932A (en) | Digital formatting method, device, terminal equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |