CN111914065A - Short message content verification method, device, computer system and computer readable medium - Google Patents
Short message content verification method, device, computer system and computer readable medium Download PDFInfo
- Publication number
- CN111914065A CN111914065A CN202010764815.2A CN202010764815A CN111914065A CN 111914065 A CN111914065 A CN 111914065A CN 202010764815 A CN202010764815 A CN 202010764815A CN 111914065 A CN111914065 A CN 111914065A
- Authority
- CN
- China
- Prior art keywords
- short message
- template
- message content
- content
- tested
- 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
- G06F16/3331—Query processing
- G06F16/334—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The disclosure provides a short message content verification method, a short message content verification device, a computer system and a computer readable medium, which can be used in the financial field or other fields. The short message content verification method comprises the following steps: acquiring the content of the short message to be tested; matching the short message content to be tested with each short message template tree in the short message template tree set, wherein each short message template tree comprises one or more nodes, each node represents one template short message content, and the first characters in different nodes are the same; and determining that the short message content to be tested passes verification under the condition that a target short message template tree matched with the short message content to be tested exists in the short message template tree set.
Description
Technical Field
The present disclosure relates to the field of internet technologies, and in particular, to a method, an apparatus, a computer system, and a computer-readable medium for verifying short message content.
Background
With the rapid development of network information technology, internet finance is also more and more widely applied to many scenes such as work and life of people. The client sends a transaction request in the internet software, and the internet software server executes a short message sending program with a corresponding function according to the transaction request sent by the service of the client.
At present, each financial institution needs to verify a large amount of short message contents when providing services for customers, so that the number of related short message content templates is large. The existing character string character-by-character comparison mode is difficult to meet the current application requirements on the character matching efficiency. In addition, when the short message content is verified, the short message content often includes data information such as the amount of money and time of a transaction request sent by a client, and the correctness of the short message content cannot be verified by the currently adopted pure character comparison mode.
Disclosure of Invention
In view of this, the present disclosure provides a short message content verification method, including:
acquiring the content of the short message to be tested;
matching the short message content to be tested with each short message template tree in the short message template tree set, wherein each short message template tree comprises one or more nodes, each node represents one template short message content, and the first characters in different nodes are the same; and
and determining that the short message content to be tested passes verification under the condition that a target short message template tree matched with the short message content to be tested exists in the short message template tree set.
According to the embodiment of the present disclosure, in the case that a target short message template tree matching the short message content to be tested exists in the short message template tree set, determining that the short message content to be tested passes verification comprises:
and determining that the short message content to be tested passes verification under the condition that the target short message template tree comprises the template short message content identical to the short message content to be tested.
According to the embodiment of the present disclosure, in the case that a target short message template tree matching the short message content to be tested exists in the short message template tree set, determining that the short message content to be tested passes verification comprises:
under the condition that a target short message template tree matched with the content of the short message to be tested exists in the short message template tree set, acquiring a target record corresponding to the target short message template tree;
acquiring numerical value information in the target record to determine a first data set;
determining a second data set according to the numerical information in the short message content to be tested; and
and if the first data set is the same as the second data set, determining that the short message content to be tested passes the verification.
According to the embodiment of the present disclosure, the short message content verification method further includes constructing the short message template tree set, including:
acquiring a template short message content set;
selecting any initial template short message content in the template short message content set as a first-layer node of an initial short message template tree;
comparing the initial template short message content with other template short message contents in the template short message content set;
and taking the first character of the template short message content which is not matched with the first character of the initial template short message content as a first-layer node of a newly-built short message template tree in the short message template tree set.
According to the embodiment of the disclosure, the short message content verification method further comprises the following steps: taking a second template short message content with the first character of the template short message content matched with the first character of the initial template short message content as a second layer node of the initial short message template tree, wherein the second layer node is a child node of the first layer node; and
and recording the number of digits of characters, which are not matched with the initial template short message content, in the initial template short message content.
According to the embodiment of the disclosure, the short message content verification method further comprises the following steps: taking the n +1 th template short message content with the first character of the template short message content matched with the first character of the nth template short message content as the n +1 th layer node of the initial short message template tree, wherein the n +1 th layer node is a sub-node of the nth layer node, and n is more than or equal to 2; and
recording the number of digits of characters, which are not matched with the n +1 th template short message content, in the n template short message content.
According to an embodiment of the present disclosure, the acquiring of the template short message content set includes:
acquiring a short message sending record in a historical database, and adding the short message sending record into a short message content scene set after the content of the short messages with the same transaction request is deduplicated;
and obtaining numerical value information in the short message content scene set, replacing the numerical value information, and generating a template short message content set.
The present disclosure also provides a short message content verification apparatus, including:
the input module is configured to acquire the content of the short message to be tested;
the matching module is configured to match the short message content to be tested with each short message template tree in the short message template tree set; and
and the output module is configured to be used under the condition that a target short message template tree matched with the short message content to be tested exists in the short message template tree set.
The present disclosure also provides a computer system comprising:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the short message content verification method as described above.
The present disclosure also provides a computer readable medium having stored thereon executable instructions that, when executed by a processor, cause the processor to perform a short message content verification method according to the above.
According to the embodiment of the disclosure, the short message content to be tested is acquired; matching the short message content to be tested with each short message template tree in the short message template tree set, wherein each short message template tree comprises one or more nodes, each node represents one template short message content, and the first characters in different nodes are the same; and determining that the short message content to be tested passes the verification technical means under the condition that a target short message template tree matched with the short message content to be tested exists in the short message template tree set, so that the technical problem that the dynamic data information check cannot be completed only by character comparison is at least partially solved, and the technical effects of improving the character comparison efficiency and realizing the automatic verification of the short message content are achieved.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:
fig. 1 schematically shows an exemplary system architecture to which the short message content verification method and apparatus may be applied, according to an embodiment of the present disclosure;
fig. 2 schematically shows a flow chart of a short message content verification method according to an embodiment of the disclosure;
fig. 3 schematically shows a flow chart of a short message content verification method according to another embodiment of the disclosure;
FIG. 4A is a flow chart schematically illustrating the construction of the SMS template tree set according to an embodiment of the present disclosure;
fig. 4B schematically shows a flowchart of obtaining a template short message content set according to an embodiment of the present disclosure;
FIG. 5 is a diagram illustrating an embodiment of constructing the SMS template tree set according to the disclosure;
fig. 6A schematically shows a block diagram of a short message content verification apparatus according to an embodiment of the present disclosure;
fig. 6B schematically shows a block diagram of an output module in the short message content verification apparatus according to an embodiment of the disclosure; and
fig. 7 schematically shows a block diagram of a computer system suitable for implementing the short message content verification method according to an embodiment of the present disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
The embodiment of the disclosure provides a short message content verification method, a short message content verification device, a computer system and a computer readable medium. The method comprises the steps of obtaining short message content to be tested; matching the short message content to be tested with each short message template tree in the short message template tree set, wherein each short message template tree comprises one or more nodes, each node represents one template short message content, and the first characters in different nodes are the same; and determining that the short message content to be tested passes verification under the condition that a target short message template tree matched with the short message content to be tested exists in the short message template tree set.
Fig. 1 schematically shows an exemplary system architecture 100 to which the short message content verification method and apparatus may be applied, according to an embodiment of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, the system architecture 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104 and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired and/or wireless communication links, and so forth.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The terminal devices 101, 102, 103 may have installed thereon various communication client applications, such as a shopping-like application, a web browser application, a search-like application, an instant messaging tool, a mailbox client, and/or social platform software, etc. (by way of example only).
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using the terminal devices 101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.
It should be noted that the short message content verification method provided by the embodiment of the present disclosure may be generally executed by the server 105. Accordingly, the device for verifying the content of the short message provided by the embodiment of the present disclosure may be generally disposed in the server 105. The short message content verification device provided by the embodiment of the present disclosure may also be executed by a server or a server cluster that is different from the server 105 and is capable of communicating with the terminal devices 101, 102, and 103 and/or the server 105. Correspondingly, the device for short message content verification provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster different from the server 105 and capable of communicating with the terminal devices 101, 102, 103 and/or the server 105. Alternatively, the short message content verification method provided by the embodiment of the present disclosure may also be executed by the terminal device 101, 102, or 103, or may also be executed by another terminal device different from the terminal device 101, 102, or 103. Correspondingly, the device for short message content verification provided by the embodiment of the disclosure may also be disposed in the terminal device 101, 102, or 103, or in another terminal device different from the terminal device 101, 102, or 103.
For example, the content of the short message to be tested may be originally stored in any one of the terminal devices 101, 102, or 103 (for example, but not limited to, the terminal device 101), or may be stored on an external storage device and may be imported into the terminal device 101. Then, the terminal device 101 may locally execute the short message content verification method provided by the present disclosure, or send the short message content to be tested to other terminal devices, servers, or server clusters, and execute the short message content verification method provided by the present disclosure by the other terminal devices, servers, or server clusters receiving the short message content to be tested.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
It should be noted that the method and the device for verifying the short message content, the computer system and the computer readable medium can be used in the financial field in the aspects of user transaction short message verification, template information matching and the like, and can also be used in any fields except the financial field, such as fields of big data, information security, internet of things and the like.
Fig. 2 schematically shows a flowchart of a short message content verification method according to an embodiment of the disclosure.
As shown in fig. 2, the method includes operations S201 to S203.
In operation S201, a content of a short message to be tested is obtained.
According to the embodiment of the disclosure, the short message content to be tested comprises character information.
In operation S202, the short message content to be tested is matched with each short message template tree in the short message template tree set, where each short message template tree includes one or more nodes, each node represents a template short message content, and the first characters in different nodes are the same.
In operation S203, it is determined that the short message content to be tested passes verification when a target short message template tree matching the short message content to be tested exists in the short message template tree set.
According to the embodiment of the disclosure, the short message content to be tested is acquired; matching the short message content to be tested with each short message template tree in the short message template tree set, wherein each short message template tree comprises one or more nodes, each node represents one template short message content, and the first characters in different nodes are the same; and under the condition that a target short message template tree matched with the short message content to be tested exists in the short message template tree set, determining that the short message content to be tested passes through the verification technical means, so that the technical problem of low character comparison efficiency is at least partially solved, and the technical effects of executing the comparison result more quickly and improving the verification efficiency and accuracy are achieved.
According to the embodiment of the disclosure, under the condition that the target short message template tree comprises the template short message content identical to the short message content to be tested, the short message content to be tested is determined to pass verification.
Fig. 3 schematically shows a flowchart of a short message content verification method according to another embodiment of the disclosure.
As shown in fig. 3, the method includes operations S301 to S307.
In operation S301, the content of the short message to be tested is obtained.
According to the embodiment of the disclosure, the content of the short message to be tested can include character information and data information.
In operation S302, the short message content to be tested is matched with each short message template tree in the short message template tree set, where each short message template tree includes one or more nodes, each node represents a template short message content, and the first characters in different nodes are the same.
In operation S303, it is determined that the short message content to be tested passes verification when a target short message template tree matching the short message content to be tested exists in the short message template tree set.
For example, the content of the short message to be tested is: if the short message template tree set comprises the account of the target short message content XXXXXXX, the short message content to be tested passes verification.
Specifically, the determining that the content of the short message to be tested passes the verification when the short message template tree matched with the content of the short message to be tested exists in the short message template tree set comprises: and determining that the short message content to be tested passes verification under the condition that the target short message template tree comprises the template short message content identical to the short message content to be tested.
For example, the content of the short message to be tested is: the account of XXXXXXX is determined, the target short message template tree in the short message template tree set comprises the account of the target short message content XXXXXXX, and the short message content to be tested is confirmed to pass the verification.
According to the embodiment of the disclosure, under the condition that the target short message template tree comprises the template short message content identical to the short message content to be tested, the short message content to be tested is determined to pass verification.
In operation S304, in the case that a target short message template tree matching the content of the short message to be tested exists in the short message template tree set, a target record corresponding to the target short message template tree is obtained from the transaction path table.
According to the embodiment of the disclosure, the numerical information such as the money amount, the time and the like of the short message content to be tested sent by a client is determined through SQL.
Regarding a Data Query Language (DQL), also called a "Data retrieval statement", to obtain, from the transaction path table, field contents in the target record corresponding to the target short message template tree, specifically, numerical information in the field contents, and determine how the numerical information is given in the application program. The data definition function of SQL is: three levels of schema structures, namely, an outer schema, a global schema, and an inner schema structure, of the database can be defined. In SQL, an external mode is also called View (View), a global mode is called a mode (Schema) for short, and an internal mode is automatically realized by a system according to a database mode without the need of asking by a user. SQL data manipulation functions: including data insertion, deletion and modification of base tables and views, and particularly has a strong data query function. The data control function of SQL: the access right of the user is mainly controlled to ensure the safety of the system.
In operation S305, numerical information in the target record is acquired to determine a first data set.
According to the embodiment of the disclosure, the numerical information such as the amount of money, time and the like of a transaction request sent by a client in background transaction is obtained according to a preset transaction path, and a first data set is determined.
In operation S306, a second data set is determined according to the numerical information in the content of the short message to be tested.
According to the embodiment of the disclosure, the second data set is directly determined according to the numerical information such as money amount, time and the like in the short message content to be tested.
In operation S307, if the first data set and the second data set are the same, it is determined that the content of the short message to be tested passes the verification.
According to the embodiment of the disclosure, non-numerical information in the short message content to be tested is matched with each short message template tree in the short message template tree set, after the non-numerical information in the short message content to be tested is verified partially if the matching is successful, the numerical information in the short message content to be tested is matched with the numerical information in the short message content to be tested obtained according to the preset transaction path, and the short message content to be tested is verified if the matching is successful, so that the technical problem that the dynamic data information check cannot be completed only by character comparison is at least partially solved, and the technical effects of improving the character comparison efficiency and realizing the automatic verification of the short message content are achieved.
Fig. 4A schematically shows a flowchart for constructing a short message template tree set according to an embodiment of the present disclosure.
As shown in FIG. 4A, constructing the short message template tree set includes operations S401 to S406
In operation S401, a template short message content set is obtained. Optionally, each template short message content in the template short message content set is numbered.
Fig. 4B schematically shows a flowchart of acquiring a template short message content set according to an embodiment of the present disclosure.
As shown in fig. 4B, the acquiring of the template short message content set includes operations S4011 to S4012.
In operation S4011, a short message sending record in the history database is obtained, and the content of the short message with the same transaction request is deduplicated and then added to the short message content scene set.
In operation S4012, the numerical information in the short message content scene set is obtained, and the numerical information is replaced to generate a template short message content set.
In the embodiment of the disclosure, a preset regular expression format is obtained, including but not limited to regular expression formats such as money amount and time. And replacing the format content of the regular expression with standard preset characters, namely replacing information such as money amount, time and the like with characters including but not limited to XX.XX, YYYY-MM-DD and the like to generate a template short message content set.
Referring to fig. 5, fig. 5 schematically illustrates an embodiment of constructing a short message template tree set according to an embodiment of the present disclosure. According to the embodiment of the disclosure, a template short message content set is obtained, and each template short message content in the template short message content set is numbered as follows:
number 1, gesture login service under the pavilion has been closed.
Number 2, number: account of XXXXXX.
Number 3, XXXX modify login password the transaction is complete.
No. 4, XXXX: apply for on-line from the pavilion.
And 5, serial number 5, XX mobile banking exchange.
And 6, the XX mobile phone bank transfers accounts to other banks.
Number 7, code sent, please later.
Number 8, XX mobile phone remittance is finished.
In operation S402, any initial template short message content in the template short message content set is selected as a first-level node of the initial short message template tree.
According to the embodiment of the disclosure, the number 1, the gesture login service under the pavilion is closed, and the first-level node of the initial short message template tree is selected.
In operation S403, the initial template short message content is compared with other template short message contents in the template short message content set.
According to the embodiment of the disclosure, the template short message content corresponding to the serial numbers 2-8 is compared with the initial template short message content corresponding to the serial number 1.
In operation S404, the first character of the template short message content is used as a first-level node of a newly created short message template tree in the short message template tree set, where the first character of the template short message content does not match the first character of the initial template short message content.
According to the embodiment of the present disclosure, the first template short message content with unmatched first characters of the template short message content corresponding to the numbers 2-8 and the initial template short message content corresponding to the number 1 includes: the template short message contents corresponding to the number 2 and the number 3. And taking the template short message contents corresponding to the serial numbers 2 and 3 as a first-layer node of a newly-built short message template tree in the short message template tree set. At this time, the short message template tree includes three first-level nodes, which are template short message contents corresponding to the number 1, the number 2, and the number 3.
The template short message contents corresponding to the numbers 2-8 do not have the first template short message content matched with the first character of the initial template short message content, and the initial short message template tree only comprises the initial template short message content corresponding to the number 1 as the first-layer node of the initial short message template tree.
In operation S405, a second template short message content in which the first character of the template short message content matches the first character of the initial template short message content is used as a second layer node of the initial short message template tree, where the second layer node is a child node of the first layer node; and
and recording the digit of the character in the initial template short message content, wherein the character is not matched between the second template short message content and the initial template short message content.
According to the embodiment of the disclosure, the first character of the short message template content corresponding to the number 4 is matched with the first character of the template short message content corresponding to the numbers 1-3, the first character of the short message template content corresponding to the number 4 is matched with the first character of the template short message content corresponding to the number 3 to serve as the second template short message content, and the second template short message content serves as a second layer node of the short message template tree, wherein the second layer node is a child node of the first layer node. And recording the number of the character of the short message template content corresponding to the number 4 which is not matched with the template short message content corresponding to the number 3 in the template short message content corresponding to the number 3 as a fifth digit.
And matching the first character of the short message template content corresponding to the number 5 with the first character of the template short message content corresponding to the numbers 1-3, matching the first character of the short message template content corresponding to the number 5 with the first character of the template short message content corresponding to the number 3 to serve as second template short message content, and serving as a second-layer node of the short message template tree, wherein the second-layer node is a child node of the first-layer node. It should be noted that the number of the characters, which are located in the template short message content corresponding to the number 3 and are not matched with the short message template content corresponding to the number 5, is the third digit, and is different from the number of the characters, which are not matched with the number 4, recorded in the number 3, and a second layer node is additionally created.
The method for constructing the short message template content corresponding to the number 7 in the short message template tree set is the same as the above and is not described again.
In operation S406, the (n + 1) th template short message content in which the first character of the template short message content matches the first character of the nth template short message content is used as the (n + 1) th layer node of the initial short message template tree, wherein the (n + 1) th layer node is a child node of the nth layer node, and n is greater than or equal to 2; and
and recording the number of digits of the characters in the nth template short message content, wherein the characters are not matched with the nth template short message content, in the nth template short message content.
When n is 2, taking the third template short message content with the first character of the template short message content matched with the first character of the second template short message content as a third layer node of the initial short message template tree, wherein the third layer node is a child node of the second layer node; and
and recording the number of digits of the characters, which are not matched with the second template short message content, in the second template short message content.
According to the embodiment of the present disclosure, operation S406 is repeated to construct child nodes of the third-level node, which is not described again.
According to the embodiment of the disclosure, the first character of the short message template content corresponding to the number 6 is matched with the first character of the template short message content corresponding to the numbers 1 to 3, the first character of the short message template content corresponding to the number 6 is matched with the first character of the template short message content corresponding to the number 3, and the number of the character of the short message template content corresponding to the number 6, which is not matched with the template short message content corresponding to the number 3, in the template short message content corresponding to the number 3 is the third position, the short message template content corresponding to the number 6 is used as the third layer node of the initial short message template tree, wherein the third layer node is a child node of the second layer node. The number of the characters, in which the short message template content corresponding to the record number 6 does not match the template short message content corresponding to the record number 5, in the template short message content corresponding to the record number 5 is the seventh digit.
The method for constructing the short message template content corresponding to the number 8 in the short message template tree set is the same as the above and is not described again.
Fig. 6A schematically shows a block diagram of a short message content verification apparatus according to an embodiment of the disclosure.
As shown in fig. 6A, the short message content verification apparatus includes an input module 610, a matching module 620 and an output module 630.
The input module 610 is configured to obtain the content of the short message to be tested.
The matching module 620 is configured to match the content of the short message to be tested with each short message template tree in the short message template tree set.
The output module 630 is configured to determine that the short message content to be tested passes verification when a target short message template tree matching the short message content to be tested exists in the short message template tree set.
According to the embodiment of the disclosure, the short message content to be tested is acquired; matching the short message content to be tested with each short message template tree in the short message template tree set, wherein each short message template tree comprises one or more nodes, each node represents one template short message content, and the first characters in different nodes are the same; and under the condition that a target short message template tree matched with the short message content to be tested exists in the short message template tree set, determining that the short message content to be tested passes through the verification technical means, so that the technical problem that the dynamic data information check cannot be completed only by character comparison is at least partially solved, and the technical effects of improving the character comparison efficiency and realizing the automatic verification of the short message content are achieved.
Fig. 6B schematically illustrates a block diagram of an output module according to an embodiment of the present disclosure.
As shown in fig. 6B, the output module 630 includes: a first acquisition unit 631, a second acquisition unit 632, a third acquisition unit 633, and a matching unit 634.
The first obtaining unit 631 is configured to obtain a preset transaction path when a target short message template tree matching the content of the short message to be tested exists in the short message template tree set.
The second obtaining unit 632 is configured to obtain numerical information in the content of the short message to be tested according to a preset transaction path, and determine the first data set.
The third obtaining unit 633 is configured to determine a second data set according to the numerical information in the content of the short message to be tested.
The matching unit 634 is configured to determine that the content of the short message to be tested passes the verification if the first data set and the second data set are the same.
According to the embodiment of the present disclosure, the short message content verification apparatus further includes: and constructing a module.
And the construction module is configured to construct a short message template tree set. The construction module comprises: the device comprises a fourth acquisition unit, a first construction unit, a matching unit and a second construction unit.
And the fourth acquisition unit is configured to acquire the template short message content set.
And the first construction unit is configured to select any initial template short message content in the template short message content set as a first-layer node of the initial short message template tree.
And the matching unit is configured to compare the initial template short message content with other template short message contents in the template short message content set.
And the second construction unit is configured to use the first template short message content of which the first character is not matched with the first character of the initial template short message content as a first-layer node of a newly-built short message template tree in the short message template tree set.
According to an embodiment of the present disclosure, the building block further comprises: a third construction unit and a first recording unit.
And the third construction unit is configured to take the second template short message content with the first character of the template short message content matched with the first character of the initial template short message content as a second layer node of the initial short message template tree, wherein the second layer node is a child node of the first layer node.
And the first recording unit is configured to record the number of digits of characters, which are not matched with the initial template short message content, in the initial template short message content.
According to an embodiment of the present disclosure, the building block further comprises: a fourth construction unit and a second recording unit.
And the fourth construction unit is configured to take the third template short message content with the first character of the template short message content matched with the first character of the second template short message content as a third layer node of the initial short message template tree, wherein the third layer node is a child node of the second layer node.
And the second recording unit is configured to record the number of digits of the characters, which are not matched with the second template short message content, in the second template short message content.
Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
For example, any number of the input module 610, the matching module 620 and the output module 630 may be combined and implemented in one module/unit/sub-unit, or any one of the modules/units/sub-units may be split into a plurality of modules/units/sub-units. Alternatively, at least part of the functionality of one or more of these modules/units/sub-units may be combined with at least part of the functionality of other modules/units/sub-units and implemented in one module/unit/sub-unit. According to an embodiment of the present disclosure, at least one of the input module 610, the matching module 620, and the output module 630 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware by any other reasonable manner of integrating or packaging a circuit, or in any one of three implementations of software, hardware, and firmware, or in a suitable combination of any of them. Alternatively, at least one of the input module, the matching module 620 and the output module 630 may be at least partially implemented as a computer program module, which when executed may perform the respective functions.
It should be noted that the short message content verification device portion in the embodiment of the present disclosure corresponds to the short message content verification method portion in the embodiment of the present disclosure, and the description of the short message content verification device portion specifically refers to the short message content verification method portion, which is not described herein again.
Fig. 7 schematically shows a block diagram of a computer system suitable for implementing the short message content verification method according to an embodiment of the present disclosure. The computer system illustrated in FIG. 7 is only one example and should not impose any limitations on the scope of use or functionality of embodiments of the disclosure.
As shown in fig. 7, a computer system 700 according to an embodiment of the present disclosure includes a processor 701, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. The processor 701 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 701 may also include on-board memory for caching purposes. Processor 701 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.
In the RAM703, various programs and data necessary for the operation of the system 700 are stored. The processor 701, the ROM 702, and the RAM703 are connected to each other by a bus 704. The processor 701 performs various operations according to the method flows of the embodiments of the present disclosure by executing programs in the ROM 702 and/or the RAM 703. Note that the programs may also be stored in one or more memories other than the ROM 702 and RAM 703. The processor 701 may also perform various operations according to the method flows of the embodiments of the present disclosure by executing programs stored in the one or more memories.
According to an embodiment of the present disclosure, the system 700 may also include an input/output (I/O) interface 705, the input/output (I/O) interface 705 also being connected to the bus 704. The system 700 may also include one or more of the following components connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
According to an embodiment of the present disclosure, a method flow according to an embodiment of the present disclosure may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program, when executed by the processor 701, performs the above-described functions defined in the system of the embodiment of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. Examples may include, but are not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 702 and/or the RAM703 and/or one or more memories other than the ROM 702 and the RAM703 described above.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.
Claims (10)
1. A short message content verification method comprises the following steps:
acquiring the content of the short message to be tested;
matching the short message content to be tested with each short message template tree in the short message template tree set, wherein each short message template tree comprises one or more nodes, each node represents one template short message content, and the first characters in different nodes are the same; and
and determining that the short message content to be tested passes verification under the condition that a target short message template tree matched with the short message content to be tested exists in the short message template tree set.
2. The method of claim 1, wherein in the case that a target short message template tree matching the short message content to be tested exists in the short message template tree set, determining that the short message content to be tested passes verification comprises:
and determining that the short message content to be tested passes verification under the condition that the target short message template tree comprises the template short message content identical to the short message content to be tested.
3. The method of claim 1, wherein in the case that a target short message template tree matching the short message content to be tested exists in the short message template tree set, determining that the short message content to be tested passes verification comprises:
under the condition that a target short message template tree matched with the content of the short message to be tested exists in the short message template tree set, acquiring a target record corresponding to the target short message template tree;
acquiring numerical value information in the target record to determine a first data set;
determining a second data set according to the numerical information in the short message content to be tested; and
and if the first data set is the same as the second data set, determining that the short message content to be tested passes the verification.
4. The method of any one of claims 1 to 3, further comprising constructing the short message template tree set, including:
acquiring a template short message content set;
selecting any initial template short message content in the template short message content set as a first-layer node of an initial short message template tree;
comparing the initial template short message content with other template short message contents in the template short message content set;
and taking the first character of the template short message content which is not matched with the first character of the initial template short message content as a first-layer node of a newly-built short message template tree in the short message template tree set.
5. The method of claim 4, further comprising:
taking a second template short message content with the first character of the template short message content matched with the first character of the initial template short message content as a second layer node of the initial short message template tree, wherein the second layer node is a child node of the first layer node; and
and recording the number of digits of characters, which are not matched with the initial template short message content, in the initial template short message content.
6. The method of claim 5, further comprising:
taking the n +1 th template short message content with the first character of the template short message content matched with the first character of the nth template short message content as the n +1 th layer node of the initial short message template tree, wherein the n +1 th layer node is a sub-node of the nth layer node, and n is more than or equal to 2; and
recording the number of digits of characters, which are not matched with the n +1 th template short message content, in the n template short message content.
7. The method of claim 4, wherein the obtaining the set of template short message content comprises:
acquiring a short message sending record in a historical database, and adding the short message sending record into a short message content scene set after the content of the short messages with the same transaction request is deduplicated;
and obtaining numerical value information in the short message content scene set, replacing the numerical value information, and generating a template short message content set.
8. A short message content verification device comprises:
the input module is configured to acquire the content of the short message to be tested;
the matching module is configured to match the short message content to be tested with each short message template tree in the short message template tree set; and
and the output module is configured to determine that the short message content to be tested passes verification under the condition that a target short message template tree matched with the short message content to be tested exists in the short message template tree set.
9. A computer system, comprising:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the short message content verification method of any of claims 1-7.
10. A computer readable medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform a short message content verification method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010764815.2A CN111914065B (en) | 2020-07-31 | 2020-07-31 | Short message content verification method, device, computer system and computer readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010764815.2A CN111914065B (en) | 2020-07-31 | 2020-07-31 | Short message content verification method, device, computer system and computer readable medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111914065A true CN111914065A (en) | 2020-11-10 |
| CN111914065B CN111914065B (en) | 2023-08-15 |
Family
ID=73286514
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010764815.2A Active CN111914065B (en) | 2020-07-31 | 2020-07-31 | Short message content verification method, device, computer system and computer readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111914065B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107748739A (en) * | 2017-10-19 | 2018-03-02 | 上海大汉三通通信股份有限公司 | A kind of extracting method and relevant apparatus of short message text masterplate |
| CN109670163A (en) * | 2017-10-17 | 2019-04-23 | 阿里巴巴集团控股有限公司 | Information identifying method, information recommendation method, template construction method and calculating equipment |
-
2020
- 2020-07-31 CN CN202010764815.2A patent/CN111914065B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109670163A (en) * | 2017-10-17 | 2019-04-23 | 阿里巴巴集团控股有限公司 | Information identifying method, information recommendation method, template construction method and calculating equipment |
| CN107748739A (en) * | 2017-10-19 | 2018-03-02 | 上海大汉三通通信股份有限公司 | A kind of extracting method and relevant apparatus of short message text masterplate |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111914065B (en) | 2023-08-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11328093B1 (en) | Protecting sensitive data | |
| CN109034988B (en) | Accounting entry generation method and device | |
| US10642804B2 (en) | Dynamic network database integration system | |
| CN113946425A (en) | Service processing method and device, electronic equipment and computer readable storage medium | |
| CN111427971A (en) | Business modeling method, device, system and medium for computer system | |
| CN115587575A (en) | Data table creation method, target data query method, device and equipment | |
| CN111435376A (en) | Information processing method and system, computer system, and computer-readable storage medium | |
| CN111857674A (en) | Business product generation method and device, electronic equipment and readable storage medium | |
| CN114281803A (en) | Data migration method, device, equipment, medium and program product | |
| CN113132400B (en) | Business processing method, device, computer system and storage medium | |
| CN114780807A (en) | Service detection method, device, computer system and readable storage medium | |
| CN111914065B (en) | Short message content verification method, device, computer system and computer readable medium | |
| CN114780361A (en) | Log generation method, device, computer system and readable storage medium | |
| CN111865726B (en) | Service message testing method, device, computer system and storage medium | |
| CN114637672A (en) | Automatic data testing method and device, computer equipment and storage medium | |
| CN113448578A (en) | Page data processing method, processing system, electronic device and readable storage medium | |
| CN111949259A (en) | Risk decision configuration method, system, electronic equipment and storage medium | |
| US11379470B2 (en) | Techniques for concurrent data value commits | |
| US11928174B2 (en) | Centralized dynamic portal for creating and hosting static and dynamic applications | |
| US20210349902A1 (en) | Database query processing | |
| CN114943100A (en) | Data verification method, apparatus, device, medium, and program product | |
| CN115525365A (en) | Method, device and equipment for determining target data entity and storage medium | |
| CN114240437A (en) | Service processing method, service processing device, electronic equipment and readable storage medium | |
| CN114817314A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN114218254A (en) | Report generation method, device, 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 |