CN111159329A - Sensitive word detection method and device, terminal equipment and computer-readable storage medium - Google Patents
Sensitive word detection method and device, terminal equipment and computer-readable storage medium Download PDFInfo
- Publication number
- CN111159329A CN111159329A CN201911344871.4A CN201911344871A CN111159329A CN 111159329 A CN111159329 A CN 111159329A CN 201911344871 A CN201911344871 A CN 201911344871A CN 111159329 A CN111159329 A CN 111159329A
- Authority
- CN
- China
- Prior art keywords
- sensitive word
- character
- sensitive
- node
- characters
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
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)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Machine Translation (AREA)
Abstract
The embodiment of the application is applicable to the technical field of text detection, and discloses a sensitive word detection method, a sensitive word detection 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 on 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 method and the device, the characters of the sensitive words are stored in the sensitive word container in a nested and recursive manner, so that the detection complexity of the sensitive words is equal to the character length of the sensitive words, the detection complexity of the sensitive words is reduced, and the detection efficiency of the sensitive words 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 sensitive word detection device, terminal equipment and a computer-readable storage medium.
Background
At present, some sensitive information and words are not allowed to appear in the file, so sensitive word detection needs to be carried out on the text to filter or screen out the sensitive word information in the text.
In the prior art, the sensitive word detection is based on a rule detection method, a finite-state machine detection method, or a machine learning 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 sensitive word detection device, terminal equipment and a computer readable storage medium, so as to solve the problem that the existing sensitive word detection efficiency is low.
In a first aspect, an embodiment of the present application provides a sensitive word detection method, 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 for:
comparing the characters to be matched with the characters of the root nodes 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 sensitive word ending flag bit is a preset numerical value, returning a matching success result;
if the character to be matched is consistent with the character of the root node, the end zone bit of the sensitive word is not a preset numerical value, and k is 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 to determine whether the characters are consistent;
if the kth character is consistent with the character of the kth leaf node, when the sensitive word ending flag bit is not a preset numerical value, returning to the circulating step after k is equal to k + 1; when the sensitive word ending flag bit is a preset value, returning a matching success 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 sensitive words are nested and recursively stored in the sensitive word container, 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 daily situations is not too long, thereby reducing the complexity of sensitive word detection and improving the efficiency of sensitive word detection.
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 in the storage branch is a leaf node; one node corresponds to one storage object;
the data structure of the storage object is a key value pair data structure, and the storage object comprises a key value and a value; in one storage branch, the value of the storage object of the mth node is stored as the storage object of the (m + 1) th node, each character of the sensitive word corresponding to the storage branch is sequentially stored with the 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 +1 th characters are different, the first j nodes of the corresponding two storage branches are the same, the j +1 th node and the nodes behind the j +1 th node are different, and j is larger than or equal to 0.
It can be seen that, in the embodiment of the present application, the sensitive word container for storing the sensitive words is based on a key-value pair data structure, and each storage object is nested and recursive, that is, the sensitive words are nested and recursively stored in the sensitive word container, 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 daily situations is not too long, thereby reducing the complexity of sensitive word detection and improving the efficiency of sensitive word detection.
In a possible implementation manner of the first aspect, the storage object is a Map object;
the sensitive words are stored as follows:
the mth character of the sensitive word is stored in the key value of the Map object of the mth node of the corresponding storage branch; the value of the Map object of the mth node is stored as the Map object of the (m + 1) th node, and m is greater than or equal to 1 and is less than or equal to the number of characters of the sensitive word;
if the first j characters of the newly added sensitive word are the same as the first j characters of the stored sensitive word in the sensitive word container, and the j +1 characters are different, i nodes are newly created, the j +1 characters of the newly added sensitive word and the characters behind the newly added sensitive word are sequentially stored in the i nodes, and i is equal to the number of the characters of the newly added sensitive word minus j.
It will be appreciated that Map objects are typical key-value pair data structures, and that depositing the value of a Map object for the mth node as a Map object for the m +1 th node enables nested recursion of Map objects.
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 the obtaining of the text to be detected, the method further includes:
initializing sensitive word data and loading the sensitive word data to a memory.
In a possible implementation manner of the first aspect, initializing sensitive word data, and loading the sensitive word data to a memory includes:
acquiring the sensitive word data;
constructing the sensitive word container;
performing a single sensitive word adding 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 addition of the characters of the sensitive words to be loaded is finished, storing ending flag bit information of the sensitive words to be loaded in a target Map object, wherein the target Map object is stored in a value of a Map object corresponding to the last character of the sensitive words 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 sensitive word container occupies more storage resources due to a large amount of data in the sensitive word library, so that the initialization of the sensitive word container is time-consuming. And sensitive word data are initialized and loaded into the memory in advance, so that sensitive word matching operation can be carried out in the memory, and the detection efficiency is further improved. In addition, because the sensitive words are stored in the constant pool of the memory, the sensitive word data cannot be recycled even if the memory is occupied by the sensitive word data greatly, and 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 sensitive word detection result of the text to be detected according to the matching result, the method further includes:
counting the number of the sensitive words corresponding to the matching success result;
and/or
And marking the sensitive words corresponding to the matching success result in the text to be detected.
In a second aspect, an embodiment of the present application provides a terminal device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor, when executing the computer program, implements the method according to any one of the above first aspects.
In a third aspect, an embodiment of the present application provides a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a processor, the computer program implements the method according to any one of the above first aspects.
In a fourth aspect, embodiments of the present application provide a computer program product, which, when run on a terminal device, causes the terminal device to perform the method of any one of the first aspect.
It is understood that the beneficial effects of the second aspect to the fifth aspect can be referred to the related description of the first aspect, and are not described herein again.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
Fig. 1 is a schematic block diagram of a flow of a sensitive word detection method 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 diagram illustrating a nested structure of sensitive words according to an embodiment of the present application;
FIG. 4 is another schematic block flow diagram of a sensitive word detection method provided in an embodiment of the present application;
fig. 5 is a schematic block diagram of a flow of an initialization loading method according to an embodiment of the present application;
fig. 6 is a block diagram schematically illustrating a structure of a sensitive word detection apparatus 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 particular system structures, 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 devices such as a mobile phone, a tablet computer, a wearable device, a vehicle-mounted device, a notebook computer, a super-mobile personal computer (UMPC), a netbook, and a Personal Digital Assistant (PDA), and the specific type of the terminal device is not limited at all in the embodiment of the application.
Referring to fig. 1, a schematic flow chart of a sensitive word detection method provided in an embodiment of the present application may include the following steps:
and 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 subjected to sensitive word detection, and includes at least one character. The text to be detected can be, but is not limited to, Chinese text or English text.
The text to be detected can be a network case, that is, the sensitive word detection scheme of the embodiment of the application can apply the sensitive word detection of the network case, at this time, the server can obtain the case content input by the user at the client to obtain the text to be detected, then perform the sensitive word detection on the input case content to obtain the sensitive word detection result, and then filter, replace or return the service exception to the client based on the detected sensitive word on the case content input by the user. For example, when it is detected that "xx" input by the user is a sensitive word, the word may be filtered out, or the word is replaced by a corresponding synonym, or a prompt message such as "the word is a sensitive word, please input other alternatives" 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 also be other types of texts, that is, the sensitive word detection scheme provided in the embodiment of the present application may also be applied to other scenarios, and is not limited to the above-mentioned network document content detection scenario.
And S102, executing a character matching step on each character to be matched in the text to be detected to obtain a matching result.
In a specific application, the step of character matching is sequentially performed on each character in the text to be detected, for example, the step of character matching is performed on a first character in the text to be detected, then the step of character matching is performed on a second character, then the step of character matching is performed on a third character, and so on until all characters in the text to be detected are detected.
In the character matching step, matching the characters to be matched with the sensitive words stored in the sensitive word container to obtain a matching 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, and one node corresponds to one storage object;
the data structure of the storage object is a key value pair data structure, and the storage object comprises a key value and a value; in a storage branch, the value of the storage object of the mth node is stored as the storage object of the (m + 1) th node, each character of the sensitive word corresponding to the storage branch is sequentially stored with the 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 +1 th characters are different, the first j nodes of the corresponding two storage branches are the same, the j +1 th node and the nodes behind the j +1 th node are different, and j is larger than or equal to 0.
It should be noted that the storage object is a data structure of a key-value pair, which includes a key-value. The storage object of the m +1 th node is stored with the value of the storage object of the m-th node as: the value of the storage object of the 1 st node is stored with a storage object which is used as the 2 nd node; the value of the second node is stored with a storage object which is used as the 3 rd node; the value of the 3 rd node stores a storage object which is used as the 4 th node, and so on, and the value of the storage object of the m-th node stores a storage object which is used as the m +1 th node. That is, the relationships between the storage objects are nested recursive.
Referring to the storage object nesting diagram shown in fig. 2 in particular, as shown in fig. 2, a storage object storing a key-value key value pair is nested in each value, and the storage objects are nested in sequence.
A storage branch stores a sensitive word, each character of the sensitive word generally stores 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 +1 th character is different, the first j nodes of the two corresponding storage branches are the same, the j +1 th node and the nodes therebehind are different, and j is greater than or equal to 0, specifically: the nodes corresponding to consecutive identical characters are identical. Specifically, j is 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, 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 is 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 is 3, the first 3 characters of the two sensitive words are the same, then the first 3 nodes of the two sensitive words are the same, and the 4 th node and the nodes therebehind are different; and analogizing in sequence, if the former j characters are the same, and the j +1 th characters are different, the former j nodes are the same, and the j +1 th nodes and the nodes therebehind are different.
Referring to the diagram of the sensitive word nesting structure shown in fig. 3, as shown in fig. 3, the sensitive word nesting structure includes sensitive words DEF, ABD, AFG, and DEF, where the first 2 characters of two sensitive words, ABC and ABD, are the same, and then the first 2 characters a and B of the two sensitive words are stored in the same node, and C and D are stored in different nodes, respectively. The first 1 character of the ABD and AFG sensitive words is the same, the first 1 character A of the two sensitive words is stored in the same node, and the second two different characters are stored in different nodes respectively. The first 0 characters of the two sensitive words AFG and DEF are the same, that is, the two sensitive words have no characters that are the same, all nodes of the two sensitive words are different.
As shown in fig. 3, root is the root node, i.e. the first node, and a and D are stored as different key values in the first node, respectively.
In the embodiment of the present application, one storage branch is used for storing one sensitive word, and ABC, ABD, AFG and DEF shown in fig. 3 are respectively a storage branch.
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. The Map object is a typical data structure, and a Map object can be established by using a Map tool class. The value of the Map Object is an Object and can store any type of data, so that a Map Object can be stored in the value of the Map Object to implement 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:
the mth character of the sensitive word is stored in the key value of the Map object of the mth node of the corresponding storage branch; the value of the Map object of the mth node is stored as the Map object of the (m + 1) th node, and 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 sequentially storing each character of the sensitive word to the key value of the corresponding node. For example, taking a sensitive word ABC as an example, the sensitive word includes A, B, C three characters, and according to the sequence of the characters, the a character is stored in the key value of the Map object of the first node (i.e., the root node), the B character is stored in the key value of the Map object of the second node (i.e., the first leaf node), and the C character is stored in the key value of the Map object of the third node (i.e., the second leaf node).
If the first j characters of the newly added sensitive word are the same as the first j characters of the stored sensitive word in the sensitive word container, and the j +1 characters are different, i nodes are newly created, the j +1 th and the following characters of the newly added sensitive word are sequentially stored in the i nodes, and 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 into the sensitive word container is the same as the first j characters of the stored sensitive word, the first j characters of the newly added sensitive word are stored in the first j nodes of the stored sensitive word, then i nodes are newly created, and the following characters are stored in the i nodes.
For example, as shown in 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 a character and the B character do not need to establish a new node, and only the value of the Map object corresponding to the B character needs to be established, and then a Map object is stored in the value, and the D character is stored in the key value of the Map object.
For another example, as shown in 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 created to store the D character, then a Map object is stored in the value corresponding to the another key value, the E character is stored in the key value of the Map object, and the 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, and 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. That is, the value of the Map object corresponding to the last character of the sensitive word is stored in a Map object, the Map object is used for storing ending mark information, and the ending mark information is used for representing that the storage branch is ended, that is, representing that the sensitive word corresponding to the storage branch is ended.
In specific application, the key value of the target Map object can store "isEnd", and the value of the target Map object can store a value of "1".
In a specific application, a single character matching step may be performed on each character to be matched in the text to be detected to obtain a matching result.
Wherein the character matching step is for:
the first step is as follows: and comparing the characters to be matched with the characters of the root nodes of the sensitive word container to determine whether the characters are consistent.
The second step is that: and if the character to be matched is consistent with the character of the root node and the sensitive word ending flag bit is a preset numerical value, returning a matching success result.
The third step: if the character to be matched is consistent with the character of the root node, the end zone bit of the sensitive word is not a preset numerical value, and k is 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 to determine whether the characters are consistent.
The fourth step: if the kth character is consistent with the character of the kth leaf node, when the sensitive word ending flag bit is not a preset numerical value, returning to the circulating step after k is equal to k + 1; and when the sensitive word ending flag bit is a preset value, returning a matching success result.
The 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 if the matching success result is hit, the sensitive word corresponding to the character to be matched is searched.
The characters of the respective nodes in the sensitive word container are stored in the key values of the nodes. And if the character to be matched is not consistent with the key value in the root node, the corresponding sensitive word is not found, and a matching failure result is returned. On the contrary, 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 end flag information, that is, the end flag bit of the sensitive word is a preset numerical value (the preset numerical value may be, for example, 1), the corresponding sensitive word is found, and the sensitive word is a 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 ending flag information, that is, the ending flag bit of the sensitive word is not a preset value (the preset value may be 1, for example), if k is 1, entering the loop step: and matching the kth character after the character to be matched with the character of the kth leaf node of the root node to determine whether the characters are consistent. If the kth character is consistent with the character of the kth leaf node, when the sensitive word ending flag bit is not a preset numerical value, returning to the circulating step after k is equal to k + 1; when the sensitive word ending flag bit is a preset value, returning a matching success 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 is not ended, the next character of the character to be matched can be continuously compared with the character in the key value as the second node to determine whether the character is consistent with the character in the key value as the second node, and if the character is consistent with the character in the key value as the second node and the Map object of the third node stores ending mark information, the corresponding sensitive word is detected. If the matching result is consistent with the preset matching result, and the Map object of the third node does not store the ending mark information, continuing to compare backwards until the sentence end of the sentence corresponding to the character to be matched, or obtaining the matching result.
The sensitive word ending flag bit can represent whether the sensitive word is ended or not. Which may be stored in the target Map object. The key value of the target Map object may store "isEnd", and the value may store a preset value, which may be, but is not limited to, 1.
And 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. And 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 pair data structure, and each storage object is nested and recursive, that is, the sensitive words are nested and recursively stored in the sensitive word container, 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 daily situations is not too long, thereby reducing the complexity of sensitive word detection and improving the efficiency of sensitive word detection.
Referring to fig. 4, another schematic flow chart of a sensitive word detection method provided in the embodiment of the present application may include the following steps:
step S401, sensitive word data are initialized, and the sensitive word data are loaded to a memory.
Referring to the schematic flow chart 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:
and step S501, sensitive word data are obtained.
In a specific application, the sensitive word data can be read from a file stream or a database.
And step S502, constructing a sensitive word container.
When the storage object is a Map object, the Map data type of the root node can be specifically established to establish a sensitive word container.
Step S503, a single sensitive word adding step is executed, wherein 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; and when the addition of the characters of the sensitive words to be loaded is finished, storing the ending flag bit information of the sensitive words to be loaded in the target Map object, wherein the target Map object is stored in the value of the Map object corresponding to the last character of the sensitive words to be loaded.
And step S504, the step of adding the single sensitive word is repeatedly executed until the sensitive word data are all added to the sensitive word container.
Specifically, a single sensitive word adding step is performed on each sensitive word to add all the sensitive words to the constructed sensitive word container, so that sensitive word data is initially loaded into the memory.
The process of adding a sensitive word to the sensitive word container specifically comprises the following steps:
storing a first character of a 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 into 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 repeating the steps 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 need to be newly created, and the last i characters are sequentially stored in the key values of the i nodes. For details, reference may be made to the above corresponding contents, which are not described herein again.
It should be noted that the sensitive word container occupies more storage resources due to a large amount of data in the sensitive word library, so that the initialization of the sensitive word container is time-consuming. And sensitive word data are initialized and loaded into the memory in advance, so that sensitive word matching operation can be carried out in the memory, and the detection efficiency is further improved. In addition, because the sensitive words are stored in the constant pool of the memory, the sensitive word data cannot be recycled even if the memory is occupied by the sensitive word data greatly, and the detection performance is further improved.
And S402, acquiring the text to be detected.
And S403, executing a character matching step on each character to be matched in the text to be detected to obtain a matching result.
And 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 contents refer to the corresponding contents above, which are not described herein again.
S405, counting the number of the sensitive words corresponding to the matching success result; and/or marking the sensitive words corresponding to the matching success results 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 may be counted, or the sensitive words may be marked in the text.
In the embodiment of the present application, a start position of character matching may be specified, and detection of all words in a whole sentence may also be specified.
In the embodiment, the sensitive word data is initially loaded into the memory, and the character matching operation is performed in the memory, so that the detection efficiency is further improved.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.
Fig. 6 shows a block diagram of a sensitive word detection apparatus provided in the embodiment of the present application, and only shows portions related to the embodiment of the present application for convenience of description.
Referring to fig. 6, the apparatus includes:
the acquisition module 61 is used for acquiring the 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 to obtain a matching result;
the detection module 63 is used for obtaining a detection result of the sensitive words of the text to be detected according to the matching result;
the matching module is specifically configured to:
comparing the characters to be matched with the characters of the root nodes 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 sensitive word ending flag bit is a preset numerical value, returning a matching success result;
if the character to be matched is consistent with the character of the root node, the end zone bit of the sensitive word is not a preset numerical value, and k is 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 character of the kth leaf node, when the sensitive word ending flag bit is not a preset numerical value, returning to the circulating step after k is equal to k + 1; when the sensitive word ending flag bit is a preset value, returning a matching success 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, and 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 pair data structure, and the storage object comprises a key value and a value; in a storage branch, the value of the storage object of the mth node is stored as the storage object of the (m + 1) th node, each character of the sensitive word corresponding to the storage branch is sequentially stored with the 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 +1 th characters are different, the first j nodes of the corresponding two storage branches are the same, the j +1 th node and the nodes behind the j +1 th node are different, and j is larger 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 as follows:
the mth character of the sensitive word is stored in the key value of the Map object of the mth node of the corresponding storage branch; the value of the Map object of the mth node is stored as the Map object of the (m + 1) th node, and m is greater than or equal to 1 and is less than or equal to the number of characters of the sensitive word;
if the first j characters of the newly added sensitive word are the same as the first j characters of the stored sensitive word in the sensitive word container, and the j +1 characters are different, i nodes are newly created, the j +1 th and the following characters of the newly added sensitive word are sequentially stored in the i nodes, and i is equal to the number of the characters of the newly added sensitive word minus j.
In a possible implementation manner, the storage branch further includes a target Map object for storing ending flag information, and 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, the apparatus further includes:
and the initialization loading module is used for initializing the sensitive word data and loading the sensitive word data to the memory.
In a 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 adding 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 addition of the characters of the sensitive words to be loaded is finished, storing ending flag bit information of the sensitive words to be loaded in a target Map object, wherein the target Map object is stored in a value of a Map object corresponding to the last character of the sensitive words to be loaded;
and repeatedly executing the single sensitive word adding step until the sensitive word data is completely added to the sensitive word container.
In a possible implementation manner, the detection module is specifically configured to:
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, the apparatus may further include:
the counting module is used for counting the number of the sensitive words corresponding to the matching success result;
and/or
And the marking module is used for marking the sensitive words corresponding to the matching success results 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, and can also be realized by executing corresponding software by hardware, 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, for the information interaction, execution process, and other contents between the above-mentioned devices/modules, the specific functions and technical effects thereof are based on the same concept as those of the embodiment of the method of the present application, and reference may be made to the part of the embodiment of the method specifically, and details are not described here.
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 in any of the various method embodiments described above when executing the computer program 72.
The terminal device 7 may be a desktop computer, a notebook, a palm computer, a cloud server, or other computing devices. The terminal device may include, but is not limited to, a processor 70, a memory 71. Those skilled in the art will appreciate that fig. 7 is only an example of the terminal device 7, and does not constitute a limitation to the terminal device 7, and may include more or less components than those shown, or combine some components, or different components, for example, and may further include input/output devices, network access devices, and the like.
The Processor 70 may be a Central Processing Unit (CPU), and the Processor 70 may be other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. 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. In other embodiments, the memory 71 may 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), and 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, an application program, a BootLoader (BootLoader), data, and other programs, such as program codes of the computer program. The memory 71 may also be used to temporarily store 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-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The embodiments of the present application further provide a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the computer program implements the steps that can be implemented in the above method embodiments.
The embodiments of the present application provide a computer program product, which, when running on a terminal device, enables the terminal device to implement the steps in the above method embodiments when executed.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, all or part of the processes in the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium and can implement the steps of the embodiments of the methods described above when the computer program is executed by a processor. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an 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 apparatus/terminal apparatus, a recording medium, computer Memory, Read-Only Memory (ROM), random-access Memory (RAM), an electrical carrier signal, a telecommunications signal, and a software distribution medium. Such as a usb-disk, a removable hard disk, a magnetic or optical disk, etc. In certain jurisdictions, computer-readable media may not be an electrical carrier signal or a telecommunications signal in accordance with legislative and patent practice.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.
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 implementation. 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 ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed 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 can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.
Claims (10)
1. A sensitive word detection method, 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 for:
comparing the characters to be matched with the characters of the root nodes 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 sensitive word ending flag bit is a preset numerical value, returning a matching success result;
if the character to be matched is consistent with the character of the root node, the end zone bit of the sensitive word is not a preset numerical value, and k is 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 to determine whether the characters are consistent;
if the kth character is consistent with the character of the kth leaf node, when the sensitive word ending flag bit is not a preset numerical value, returning to the circulating step after k is equal to k + 1; when the sensitive word ending flag bit is a preset value, returning a matching success result;
and if the kth character is inconsistent with the character of the kth leaf node, returning a matching failure result.
2. The method of claim 1, wherein the sensitive word container includes at least one storage branch, one of the storage branches for storing a 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 in the storage branch is a leaf node; one node corresponds to one storage object;
the data structure of the storage object is a key value pair data structure, and the storage object comprises a key value and a value; in one storage branch, the value of the storage object of the mth node is stored as the storage object of the (m + 1) th node, each character of the sensitive word corresponding to the storage branch is sequentially stored with the 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 +1 th characters are different, the first j nodes of the corresponding two storage branches are the same, the j +1 th node and the nodes behind the j +1 th node are different, and j is larger than or equal to 0.
3. The method of claim 2, wherein the storage object is a Map object;
the sensitive words are stored as follows:
the mth character of the sensitive word is stored in the key value of the Map object of the mth node of the corresponding storage branch; the value of the Map object of the mth node is stored as the Map object of the (m + 1) th node, and m is greater than or equal to 1 and is less than or equal to the number of characters of the sensitive word;
if the first j characters of the newly added sensitive word are the same as the first j characters of the stored sensitive word in the sensitive word container, and the j +1 characters are different, i nodes are newly created, the j +1 characters of the newly added sensitive word and the characters behind the newly added sensitive word are sequentially stored in the i nodes, and i is equal to the number of the characters of the newly added sensitive word minus j.
4. The method of claim 3, wherein the storage branch further comprises a target Map object for storing ending flag information, and 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.
5. The method of claim 3 or 4, further comprising, prior to obtaining the text to be detected:
initializing sensitive word data and loading the sensitive word data to a memory.
6. The method of claim 5, wherein initializing sensitive word data, loading the sensitive word data to memory, comprises:
acquiring the sensitive word data;
constructing the sensitive word container;
performing a single sensitive word adding 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 addition of the characters of the sensitive words to be loaded is finished, storing ending flag bit information of the sensitive words to be loaded in a target Map object, wherein the target Map object is stored in a value of a Map object corresponding to the last character of the sensitive words 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.
7. The method of claim 1, wherein obtaining a 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.
8. The method of claim 1, wherein after obtaining a sensitive word detection result of the text to be detected according to the matching result, further comprising:
counting the number of the sensitive words corresponding to the matching success result;
and/or
And marking the sensitive words corresponding to the matching success result in the text to be detected.
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 8 when executing the computer program.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1 to 8.
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 true CN111159329A (en) | 2020-05-15 |
| CN111159329B 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) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111737398A (en) * | 2020-05-26 | 2020-10-02 | 北京百度网讯科技有限公司 | Method and device for searching sensitive words in text, electronic equipment and storage medium |
| CN112052364A (en) * | 2020-09-27 | 2020-12-08 | 深圳前海微众银行股份有限公司 | 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 |
| CN112766236A (en) * | 2021-03-10 | 2021-05-07 | 拉扎斯网络科技（上海）有限公司 | Text generation method and device, computer equipment and computer readable storage medium |
| CN113128220A (en) * | 2021-04-30 | 2021-07-16 | 北京奇艺世纪科技有限公司 | Text distinguishing method and 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 |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111737398A (en) * | 2020-05-26 | 2020-10-02 | 北京百度网讯科技有限公司 | Method and device for searching sensitive words in text, electronic equipment and storage medium |
| CN111737398B (en) * | 2020-05-26 | 2023-06-23 | 北京百度网讯科技有限公司 | Method and device for retrieving sensitive words in text, electronic equipment and storage medium |
| CN112052364A (en) * | 2020-09-27 | 2020-12-08 | 深圳前海微众银行股份有限公司 | 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 |
| CN112766236A (en) * | 2021-03-10 | 2021-05-07 | 拉扎斯网络科技（上海）有限公司 | Text generation method and device, computer equipment and computer readable storage medium |
| CN113128220A (en) * | 2021-04-30 | 2021-07-16 | 北京奇艺世纪科技有限公司 | Text distinguishing method and device, electronic equipment and 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111159329B (en) | 2023-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111159329B (en) | Sensitive word detection method, device, terminal equipment and computer readable storage medium | |
| CN111249736B (en) | Code processing method and device | |
| JP7052145B2 (en) | Token matching in a large document corpus | |
| US20230205755A1 (en) | Methods and systems for improved search for data loss prevention | |
| CN111797594A (en) | Character string processing method based on artificial intelligence and related equipment | |
| CN115840808B (en) | Technological project consultation method, device, server and computer readable storage medium | |
| CN116561389A (en) | Text matching method, device, equipment and storage medium | |
| CN115392235A (en) | Character matching method and device, electronic equipment and readable storage medium | |
| CN114201756A (en) | Vulnerability detection method and related device for intelligent contract code segment | |
| CN109669678A (en) | Template engine integration method, device, electronic equipment and storage medium | |
| CN115982310B (en) | Chain table generation method with verification function and electronic equipment | |
| CN111143461A (en) | Mapping relation processing system and method and electronic equipment | |
| CN111124883A (en) | Test case library introduction method, system and equipment based on tree form | |
| CN113703753B (en) | Method and device for product development and product development system | |
| CN114462381A (en) | Data processing method, device, equipment and storage medium | |
| CN112417020B (en) | Service expansion realization method, device, computer equipment and storage medium | |
| 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 | |
| CN113722321A (en) | Data export method and device and electronic equipment | |
| CN112835901A (en) | File storage method and device, computer equipment and computer readable storage medium | |
| CN111753548A (en) | Information acquisition method and device, computer storage medium and electronic equipment | |
| CN112286579B (en) | Data processing method, device, computer readable storage medium and computer equipment | |
| CN111967240B (en) | Text parsing method, text parsing device, terminal equipment and computer readable storage medium | |
| CN113535710B (en) | Searching method, searching 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 |