CN111914065B - 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
- CN111914065B CN111914065B CN202010764815.2A CN202010764815A CN111914065B CN 111914065 B CN111914065 B CN 111914065B CN 202010764815 A CN202010764815 A CN 202010764815A CN 111914065 B CN111914065 B CN 111914065B
- Authority
- CN
- China
- Prior art keywords
- short message
- template
- message content
- content
- tree
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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 present disclosure provides a method, apparatus, computer system and computer readable medium for short message content verification, which can be used in financial field or other fields. The short message content verification method comprises the following steps: acquiring the content of a short message to be tested; matching the content of the short message 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 the content of one template short message, 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 verification.
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 content of a short message.
Background
With the rapid development of network information technology, internet finance is also increasingly applied to various scenes such as work and life of people. The client sends out a transaction request in the Internet software, and the Internet software server executes a short message sending program with corresponding functions according to the transaction request sent out by the service of the client.
At present, a large amount of short message content verification is needed by each financial institution when the financial institution provides service for clients, so that the number of related short message content templates is large. The existing character string word-by-word comparison mode is difficult to meet the current application requirements in terms of word matching efficiency. In addition, when the short message content is verified, the short message content often contains data information such as the amount and time of a transaction request sent by a client, and the verification of the correctness of the short message content cannot be realized by the adoption of the text-only comparison method at present.
Disclosure of Invention
In view of this, the present disclosure provides a method for verifying content of a short message, including:
acquiring the content of a 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 the short message content of one template, and the first characters in different nodes are the same; and
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 verification.
According to an embodiment of the present disclosure, when 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 the verification includes:
And 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, determining that the short message content to be tested passes verification.
According to an embodiment of the present disclosure, when 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 the verification includes:
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, acquiring a target record corresponding to the target short message template tree;
acquiring numerical 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 content of the short message to be tested passes verification.
According to an embodiment of the present disclosure, the method for verifying the content of a short message 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 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 short message content verification method further includes: the first character of the template short message content is matched with the first character of the initial template short message content, and the second template short message content is used 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 bits of the unmatched characters of the second template short message content and the initial template short message content in the initial template short message content.
According to an embodiment of the present disclosure, the short message content verification method further includes: the first character of the template short message content and the first character of the n+1th template short message content are matched, and the n+1th template short message content is used as an n+1th layer node of the initial short message template tree, wherein the n+1th layer node is a child node of the n layer node, and n is more than or equal to 2; and
Recording the number of bits of the unmatched characters of the n+1th template short message content and the n template short message content in the n template short message content.
According to an embodiment of the present disclosure, the obtaining a template sms content set includes:
acquiring a short message sending record in a historical database, and adding the short message content of the same transaction request to a short message content scene set after removing the duplication;
and acquiring numerical information in the short message content scene set, replacing the numerical information, and generating a template short message content set.
The disclosure also provides a short message content verification device, which 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 be used for 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;
storage means 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 a method of content verification according to the text messages 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 method of authenticating content of a short message 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 the short message content of one template, 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 technical means of verification, so that the technical problem that only character comparison can be performed and dynamic data information verification can not be completed is at least partially solved, further, the character comparison efficiency is improved, and the technical effect of automatic verification of the short message content is achieved.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments thereof with reference to the accompanying drawings in which:
FIG. 1 schematically illustrates an exemplary system architecture to which the SMS content verification methods and apparatus may be applied, according to embodiments of the present disclosure;
fig. 2 schematically illustrates a flowchart of a short message content verification method according to an embodiment of the present disclosure;
fig. 3 schematically illustrates a flowchart of a method for authenticating content of a sms according to another embodiment of the present disclosure;
FIG. 4A schematically illustrates a flowchart of constructing the SMS template tree collection according to an embodiment of the present disclosure;
fig. 4B schematically illustrates a flowchart of acquiring a template sms content collection according to an embodiment of the present disclosure;
FIG. 5 schematically illustrates one embodiment of constructing the SMS template tree collection in accordance with an embodiment of the present disclosure;
fig. 6A schematically illustrates a block diagram of a short message content authentication apparatus according to an embodiment of the present disclosure;
fig. 6B schematically illustrates a block diagram of an output module in a short message content verification apparatus according to an embodiment of the disclosure; and
fig. 7 schematically illustrates a block diagram of a computer system adapted to implement a short message content verification method according to an embodiment of the 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 only exemplary 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 present disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. In addition, in the following description, descriptions of well-known structures and techniques are omitted so as not to 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/or 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 should be noted that the terms used herein should be construed to have meanings consistent with the context of the present specification and should not be construed in an idealized or overly formal manner.
Where expressions like at least one of "A, B and C, etc. are used, the expressions should generally be interpreted in accordance with the meaning as commonly understood by those skilled in the art (e.g.," a system having at least one of A, B and C "shall include, but not be limited to, a system having 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 formulation similar to at least one of "A, B or C, etc." is used, in general such a formulation should be interpreted in accordance with the ordinary understanding of one skilled in the art (e.g. "a system with at least one of A, B or C" would include but not be limited to systems with 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.).
Embodiments of the present disclosure provide a method, an apparatus, a computer system, and a computer readable medium for verifying content of a short message. The method comprises the steps of obtaining short message content to be tested; matching the content of the short message 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 the content of one template short message, 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 verification.
Fig. 1 schematically illustrates an exemplary system architecture 100 to which the short message content verification methods and apparatuses may be applied according to embodiments of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which embodiments of the present disclosure may be applied to assist those skilled in the art in understanding the technical content of the present disclosure, but does not mean that embodiments of the present disclosure may not be used in other devices, systems, environments, or scenarios.
As shown in fig. 1, a system architecture 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium to provide communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired and/or wireless communication links, and the like.
The user may interact with the server 105 via the network 104 using the terminal devices 101, 102, 103 to receive or send messages or the like. Various communication client applications may be installed on the terminal devices 101, 102, 103, such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients and/or social platform software, to name a few.
The terminal devices 101, 102, 103 may be a variety of electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 105 may be a server providing various services, such as a background management server (by way of example only) providing support for websites browsed by users using the terminal devices 101, 102, 103. The background management server may analyze and process the received data such as the user request, and feed back the processing result (e.g., the web page, information, or data obtained or generated according to the user request) to the terminal device.
It should be noted that, the method for verifying the content of the short message provided in the embodiments of the present disclosure may be generally executed by the server 105. Accordingly, the device for verifying the content of the short message provided in the embodiment of the present disclosure may be generally disposed in the server 105. The apparatus for verifying content of a short message provided by the embodiments of the present disclosure may also be performed by a server or a server cluster, which is different from the server 105 and is capable of communicating with the terminal devices 101, 102, 103 and/or the server 105. Accordingly, the apparatus for verifying the content of the short message provided in the embodiments of the present disclosure may also be provided in a server or a server cluster that is different from the server 105 and is capable of communicating with the terminal devices 101, 102, 103 and/or the server 105. Alternatively, the method for verifying the content of the short message provided by the embodiment of the present disclosure may be performed by the terminal device 101, 102, or 103, or may be performed by another terminal device different from the terminal device 101, 102, or 103. Accordingly, the apparatus for verifying the content of the short message provided by the embodiments of the present disclosure may also be provided 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 stored on an external storage device and may be imported into the terminal device 101. Then, the terminal device 101 may locally perform the short message content verification method provided by the embodiment of the present disclosure, or send the short message content to be tested to other terminal devices, servers, or server clusters, and perform the short message content verification method provided by the embodiment of the present disclosure by other terminal devices, servers, or server clusters that receive 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 apparatus for verifying the content of the short message, the method and apparatus for determining the content of the short message, the computer system and the computer readable medium of the present disclosure may be used in the financial field in terms of user transaction short message verification, template information matching, etc., and may also be used in any field other than the financial field, such as the fields of big data, information security, internet of things, etc., and the application fields of the method and apparatus for verifying the content of the short message of the present disclosure are not limited.
Fig. 2 schematically illustrates a flowchart of a short message content verification method according to an embodiment of the present disclosure.
As shown in fig. 2, the method includes operations S201 to S203.
In operation S201, the content of the 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 content of the short message 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 characterizes a piece of template short message content, and the first characters in different nodes are the same.
In operation S203, in the case that there is a target short message template tree matching the short message content to be tested in the short message template tree set, it is determined that the short message content to be tested passes the verification.
According to the embodiment of the disclosure, the short message content to be tested is acquired; matching the content of the short message 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 the content of one template short message, 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 technical means of verification, so that the technical problem of low text comparison efficiency is at least partially solved, and the technical effects of completing comparison results faster and improving 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 illustrates a flowchart of a short message content verification method according to another embodiment of the present 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 short message content to be tested can comprise character information and data information.
In operation S302, the content of the short message 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 characterizes a piece of template short message content, and the first characters in different nodes are the same.
In operation S303, in the case that there is a target short message template tree matching the short message content to be tested in the short message template tree set, it is determined that the short message content to be tested passes the verification.
For example, the content of the short message to be tested is: and if the account of XXXX includes the target short message content of XXXX in the short message template tree set, the short message content to be tested passes verification.
Specifically, 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 the verification comprises: and 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, determining that the short message content to be tested passes verification.
For example, the content of the short message to be tested is: the method comprises the steps that an account of XXXXXX is included in a target short message template tree in a short message template tree set, and the short message content to be tested is confirmed to pass 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 there is a target short message template tree matching the content of the short message to be tested 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 amount, time and the like of the short message content to be tested sent by the client is determined through SQL.
With respect to the data query language (Data Query Language, DQL), also referred to as "data retrieval statement", it is used to obtain from the transaction path table the field content in the target record corresponding to the target message template tree, in this embodiment in particular the numerical information in the field content, determining how this numerical information is presented in the application. Data definition function of SQL: the three-level schema structure of the database, i.e., the external schema, the global schema, and the internal schema structure, can be defined. In SQL, the external mode is called View, the global mode is called Schema (Schema), and the internal mode is automatically realized by the system according to the database mode, and no user asking is needed. SQL data manipulation function: including insertion, deletion and modification of data for basic tables and views, in particular with a strong data query function. Data control function of SQL: the access authority of the user is mainly controlled to ensure the security 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 first data set is determined according to the value information such as the amount, time and the like of the transaction request sent by the client in the background transaction obtained through the preset transaction path.
In operation S306, the 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 numerical information such as the amount of money, 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, because the 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 partially verified after 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 after the matching is successful, the technical problem that only character comparison can be carried out and dynamic data information verification can not be completed is at least partially solved, so that the character comparison efficiency is improved, and the technical effect of automatic short message content verification is achieved.
Fig. 4A schematically illustrates a flowchart of constructing a set of short message template trees according to an embodiment of the disclosure.
As shown in FIG. 4A, constructing the SMS template tree set includes operations S401-S406
In operation S401, a template sms content set is acquired. Optionally, numbering each template message content in the template message content set.
Fig. 4B schematically illustrates a flowchart of acquiring a template sms content collection according to an embodiment of the disclosure.
As shown in fig. 4B, acquiring the template sms content set includes operations S4011 to S4012.
In operation S4011, a short message sending record in the history database is obtained, and after duplication removal is performed on the short message content of the same transaction request, the short message content is added to the short message content scene set.
In operation S4012, numerical information in the short message content scene set is acquired, the numerical information is replaced, and a template short message content set is generated.
In an embodiment of the present disclosure, a preset regular expression format is obtained, including but not limited to regular expression formats of amount, time, etc. 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, and generating a template short message content set.
Referring to fig. 5, fig. 5 schematically illustrates one embodiment of constructing a collection of sms template trees according to an embodiment of the present disclosure. According to the embodiment of the disclosure, a template message content set is obtained, and each piece of template message content in the template message content set is numbered as follows:
number 1, the under-pavilion gesture login service has been turned off.
Number 2, number: an account of XXXX.
Number 3 xxxx modifies the login password the transaction above is completed.
Number 4, XXXX: the pavilion is applied through the internet.
And 5, XX mobile banking work silver speed sink.
And 6, transferring accounts to other lines by the XX mobile phone bank.
Number 7, code sent, please later.
And 8, finishing the remittance of the XX mobile phone.
In operation S402, any initial template message content in the template message content set is selected as a first layer node of the initial message template tree.
According to an embodiment of the present disclosure, number 1, the "under-the-pavilion gesture login service is closed", is selected, and the first-level node of the short message template tree is initialized.
In operation S403, the initial template text message content is compared with other template text message contents in the template text message content set.
According to the embodiment of the disclosure, the template short message content corresponding to the numbers 2-8 is compared with the initial template short message content corresponding to the number 1.
In operation S404, the first template sms content, in which the first character of the template sms content is not matched with the first character of the initial template sms content, is used as a first node of a newly-built sms template tree in the sms template tree set.
According to the embodiment of the disclosure, the first template short message content of which the template short message content corresponding to the numbers 2 to 8 is not matched with the first character of the initial template short message content corresponding to the number 1 comprises: template short message content corresponding to the number 2 and the number 3. And taking the template short message content corresponding to the number 2 and the number 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 layer nodes, which are template short message contents corresponding to the number 1, the number 2 and the number 3 respectively.
The template message content corresponding to the numbers 2-8 does not have the first template message content matched with the first character of the initial template message content, and the initial message template tree only comprises the initial template message content corresponding to the number 1 as a first layer node of the initial message template tree.
In operation S405, the first character of the template short message content is matched with the first character of the initial template short message content, and the second template short message content is used 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 bits of the unmatched characters of the second template message content and the initial template message content in the initial template 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 to 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 second template short message content, and the second template short message content is used 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. Recording the number of the digits of the template short message content corresponding to the number 4, which is the fifth digit, of the mismatch character of the template short message content corresponding to the number 3.
The first character of the short message template content corresponding to the number 5 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 5 is matched with the first character of the template short message content corresponding to the number 3 to serve as second template short message content, and the second template short message content is used 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 digits of the mismatch character of the template short message content corresponding to the record number 5 and the template short message content corresponding to the record number 3 in the template short message content corresponding to the record number 3 is the third digit, and the number of the mismatch character digits recorded by the record number 4 is different, and a second layer node is newly created.
The construction method of the short message template content corresponding to the number 7 in the short message template tree set is the same as the above and will not be repeated.
In operation S406, the first character of the template short message content and the first character of the n+1th template short message content are matched, and the n+1th template short message content is used as the n+1th layer node of the initial short message template tree, wherein the n+1th layer node is a child node of the n layer node, and n is greater than or equal to 2; and
recording the bit number of the unmatched characters of the n+1th template short message content and the n template short message content in the n template short message content.
When n=2, the first character of the template short message content is matched with the first character of the second template short message content, and the third template short message content is used 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 bits of the unmatched characters of the third template short message content and the second template short message content in the second template short message content.
According to the embodiment of the present disclosure, the child node constructing the third layer node repeats operation S406, 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, the number of bits of the mismatch character of the short message template content corresponding to the number 6, which is positioned in the template short message content corresponding to the number 3, is the third bit, and 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. Recording that the number 6 corresponding to the short message template content and the number 5 corresponding to the template short message content mismatch character is located in the number 5 corresponding to the template short message content, and the number of bits is the seventh bit.
The construction method of the short message template content corresponding to the number 8 in the short message template tree set is the same as the above and will not be repeated.
Fig. 6A schematically illustrates a block diagram of a short message content authentication apparatus according to an embodiment of the present disclosure.
As shown in fig. 6A, the short message content authentication 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 content of the short message to be tested passes the verification when there is a target short message template tree matching the content of the short message to be tested 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 content of the short message 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 the content of one template short message, 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 technical means of verification, so that the technical problem that only character comparison can be performed and dynamic data information verification can not be completed is at least partially solved, further, the character comparison efficiency is improved, and the technical effect of automatic verification of the short message content is achieved.
Fig. 6B schematically illustrates a block diagram of an output module according to an embodiment of the present disclosure, 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 matched with the short message content to be tested exists in the short message template tree set.
The second obtaining unit 632 is configured to obtain the numerical information in the content of the short message to be tested according to the preset transaction path, and determine the first data set.
The third obtaining unit 633 is configured to determine the second data set according to the numerical information in the content of the short message to be tested.
And a matching unit 634 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 identical.
According to an 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.
The first construction unit is configured to select any initial template message content in the template message content set as a first layer node of the initial message template tree.
And the matching unit is configured to compare the initial template message content with other template message contents in the template message content set.
The second construction unit is configured to take 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 build module further comprises: a third construction unit and a first recording unit.
The third construction unit is configured to take the first character of the template short message content and the second 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.
The first recording unit is configured to record the number of bits of the unmatched characters of the second template short message content and the initial template short message content in the initial template short message content.
According to an embodiment of the present disclosure, the build module further comprises: a fourth construction unit and a second recording unit.
And the fourth construction unit is configured to take the first character of the template short message content and the first character of the second template short message content 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.
And the second recording unit is configured to record the number of bits of the unmatched characters of the third template short message content and 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 some of the functionality of any number of the sub-units according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented as split into multiple 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-chip, a system-on-substrate, a system-on-package, an Application Specific Integrated Circuit (ASIC), or in any other reasonable manner of hardware or firmware that integrates or encapsulates the circuit, or in any one of or a suitable combination of three of software, hardware, and firmware. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be at least partially implemented as computer program modules, which when executed, may perform the corresponding functions.
For example, any of the input module 610, the matching module 620, and the output module 630 may be combined in one module/unit/sub-unit or any of the modules/units/sub-units may be split into a plurality of modules/units/sub-units. Alternatively, at least some of the functionality of one or more of these modules/units/sub-units may be combined with at least some of the functionality of other modules/units/sub-units and implemented in one module/unit/sub-unit. At least one of the input module 610, the matching module 620, and the output module 630 may be implemented at least in part as hardware circuitry, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system-on-chip, a system-on-a-substrate, a system-on-package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware, such as any other reasonable way of integrating or packaging the circuitry, or in any one of or a suitable combination of any of the three. 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 corresponding functions.
It should be noted that, in the embodiment of the present disclosure, the short message content verification device portion 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 illustrates a block diagram of a computer system adapted to implement a short message content verification method according to an embodiment of the disclosure. The computer system illustrated in fig. 7 is merely an example, and should not be construed as limiting the functionality and scope of use of the embodiments of the present disclosure.
As shown in fig. 7, a computer system 700 according to an embodiment of the present disclosure includes a processor 701 that 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 an associated chipset and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), or the like. The processor 701 may also include on-board memory for caching purposes. The processor 701 may comprise a single processing unit or a plurality of processing units for performing different actions in accordance with the method flows of the embodiments of the disclosure.
In the RAM703, various programs and data required for the operation of the system 700 are stored. The processor 701, the ROM 702, and the RAM703 are connected to each other through a bus 704. The processor 701 performs various operations of the method flow according to the embodiments of the present disclosure by executing programs in the ROM 702 and/or the RAM 703. Note that the program may be stored in one or more memories other than the ROM 702 and the RAM 703. The processor 701 may also perform various operations of the method flow according to embodiments of the present disclosure by executing programs stored in one or more memories.
According to an embodiment of the present disclosure, the system 700 may further 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 section 706 including a keyboard, a mouse, and the like; an output portion 707 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; a storage section 708 including a hard disk or 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. The 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 therefrom is mounted into the storage section 708 as necessary.
According to embodiments of the present disclosure, the method flow may be implemented as a computer software program according to embodiments of the present disclosure. 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 shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 709, and/or installed from the removable medium 711. The above-described functions defined in the system of the embodiments of the present disclosure are performed when the computer program is executed by the processor 701. The systems, devices, apparatus, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the disclosure.
The present disclosure also provides a computer-readable storage medium that may be embodied in the apparatus/device/system described in the above embodiments; or may exist alone without being assembled into the apparatus/device/system. The computer-readable storage medium carries one or more programs which, when executed, implement methods in accordance with embodiments of the present disclosure.
According to embodiments 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 context of this 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, the computer-readable storage medium may include ROM 702 and/or RAM 703 and/or one or more memories other than ROM 702 and RAM 703 described above.
The flowcharts 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 the features recited in the various embodiments of the disclosure and/or in the claims may be combined in various combinations and/or combinations, even if such combinations or combinations are not explicitly recited in the disclosure. In particular, the features recited in the various embodiments of the present disclosure and/or the claims may be variously combined and/or combined without departing from the spirit and teachings of the present disclosure. All such combinations and/or combinations fall within the scope of the present disclosure.
The embodiments of the present disclosure are 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 above separately, this does not mean that the measures in the embodiments cannot be used advantageously in combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be made by those skilled in the art without departing from the scope of the disclosure, and such alternatives and modifications are intended to fall within the scope of the disclosure.
Claims (8)
1. A short message content verification method comprises the following steps:
acquiring the content of a short message to be tested;
matching the short message content to be tested with each short message template tree in a short message template tree set, wherein each short message template tree comprises one or more nodes, each node represents the short message content of one template, 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 verification;
the construction of the short message template tree set comprises the following steps:
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;
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 is used as a first layer node of a newly-built short message template tree in the short message template tree set;
the first character of the template short message content is matched with the first character of the initial template short message content, and the second template short message content is used 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 taking the n+1th template short message content of which the first character is matched with the first character of the n template short message content as an n+1th layer node of the initial short message template tree, wherein the n+1th layer node is a child node of the n layer node, and n is more than or equal to 2.
2. The method of claim 1, further comprising:
recording the number of bits of the unmatched characters of the second template short message content and the initial template short message content in the initial template short message content;
Recording the number of bits of the unmatched characters of the n+1th template short message content and the n template short message content in the n template short message content.
3. The method of claim 1, wherein determining that the content of the short message to be tested passes verification if there is a target short message template tree in the set of short message template trees that matches the content of the short message to be tested, comprises:
and 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, determining that the short message content to be tested passes verification.
4. The method of claim 1, wherein determining that the content of the short message to be tested passes verification if there is a target short message template tree in the set of short message template trees that matches the content of the short message to be tested, comprises:
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, acquiring a target record corresponding to the target short message template tree;
acquiring numerical 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 if the first data set and the second data set are the same, determining that the short message content to be tested passes verification.
5. The method of claim 1, wherein the obtaining the template sms content collection comprises:
acquiring a short message sending record in a historical database, and adding the short message content of the same transaction request to a short message content scene set after removing the duplication;
and acquiring numerical information in the short message content scene set, replacing the numerical information, and generating a template short message content set.
6. A short message content verification apparatus, comprising:
the input module is configured to acquire the content of the short message to be tested;
the matching module 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; 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;
the construction of the short message template tree set comprises the following steps:
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;
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 is used as a first layer node of a newly-built short message template tree in the short message template tree set;
the first character of the template short message content is matched with the first character of the initial template short message content, and the second template short message content is used 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
recording the number of bits of the unmatched characters of the second template short message content and the initial template short message content in the initial template short message content;
the first character of the template short message content and the first character of the n+1th template short message content are matched, and the n+1th template short message content is used as an n+1th layer node of the initial short message template tree, wherein the n+1th layer node is a child node of the n layer node, and n is more than or equal to 2; and
recording the number of bits of the unmatched characters of the n+1th template short message content and the n template short message content in the n template short message content.
7. A computer system, comprising:
one or more processors;
Storage means 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 method of text message content verification according to any one of claims 1-4.
8. A computer readable medium having stored thereon executable instructions which when executed by a processor cause the processor to perform the method of authenticating content of a short message according to any one of claims 1 to 4.
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 CN111914065A (en) | 2020-11-10 |
| CN111914065B true 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 |
|---|---|
| CN111914065A (en) | 2020-11-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11328093B1 (en) | Protecting sensitive data | |
| CN109034988B (en) | Accounting entry generation method and device | |
| CN111046237B (en) | User behavior data processing method and device, electronic equipment and readable medium | |
| CN111427971B (en) | Business modeling method, device, system and medium for computer system | |
| US10776346B2 (en) | Systems and methods for providing flexible data access | |
| CN110704833A (en) | Data permission configuration method, device, electronic device and storage medium | |
| CN115587575A (en) | Data table creation method, target data query method, device and equipment | |
| CN114640503A (en) | Application system verification method and device, computer equipment and storage medium | |
| CN114281803A (en) | Data migration method, device, equipment, medium and program product | |
| CN107657155B (en) | Method and device for authenticating user operation authority | |
| US11153281B2 (en) | Deploying and utilizing a dynamic data stenciling system with a smart linking engine | |
| CN111914065B (en) | Short message content verification method, device, computer system and computer readable medium | |
| US10831845B2 (en) | Generation of enhanced search results | |
| CN113132400B (en) | Business processing method, device, computer system and storage medium | |
| CN114780807A (en) | Service detection method, device, computer system and readable storage medium | |
| US20220050825A1 (en) | Block chain based management of auto regressive database relationships | |
| CN111367898B (en) | Data processing method, device, system, electronic equipment and storage medium | |
| CN114780361A (en) | Log generation method, device, computer system and readable storage medium | |
| US20230153457A1 (en) | Privacy data management in distributed computing systems | |
| CN113095806B (en) | Work order processing method and device, electronic equipment and computer readable storage medium | |
| US20220012232A1 (en) | Techniques for concurrent data value commits | |
| CN115525365A (en) | Method, device and equipment for determining target data entity and storage medium | |
| CN116128518A (en) | Electronic archive management method, device, equipment and storage medium | |
| CN114528592A (en) | Service processing method, device, equipment, medium and program product | |
| CN117874729A (en) | Authorized login method and system for multiple applications |
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 |