Structural tree construction method and device, computer equipment and computer readable storage medium

Abstract

The invention relates to a structure tree construction method and device, computer equipment, a computer readable storage medium and a computer program product, which are applied to a short message service platform. The method comprises the following steps: receiving a short message text uploaded to a short message service platform; determining a short message template containing a plurality of template segments based on the short message text; determining a template structure tree based on the initial character of the short message template, wherein the template structure tree is used for integrating template fragments of each short message template; and sequentially matching the plurality of template segments with nodes of an existing path in the template structure tree, and constructing a new path of the template structure tree based on the template segments which are not matched with the corresponding nodes. According to the method and the device, the short message template is automatically generated according to the short message text uploaded to the short message service platform, the short message template is integrated into the template structure tree, and rapid matching of the short message template is realized through the integrated template structure tree, so that the sending efficiency of the short message is improved.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a structure tree construction method, apparatus, computer equipment, computer-readable storage medium, and computer program product. Background Art

[0002] With the development of cloud computing technology, cloud SMS service has emerged. Relying on cloud computing technology, cloud SMS service can provide global coverage of SMS sending, supporting general and marketing SMS. The service supports personalized SMS templates to meet the needs of different user groups, reduce the time and error rate of manual writing, and avoid security risks.

[0003] Currently, cloud SMS services are mostly sent by customizing templates and passing parameters. For corporate users, creating a large number of templates is time-consuming and labor-intensive, resulting in low SMS sending efficiency. Summary of the invention

[0004] Based on this, it is necessary to provide a structure tree construction method, device, computer equipment, computer readable storage medium and computer program product that can improve the efficiency of SMS sending in order to solve the above technical problems.

[0005] In a first aspect, the present application provides a structure tree construction method, which is applied to a short message service platform. The structure tree construction method comprises:

[0006] Receive SMS text uploaded to the SMS service platform;

[0007] Determining a text message template including a plurality of template segments based on the text message;

[0008] Determine a template structure tree based on the starting characters of the SMS template, wherein the template structure tree is used to integrate template fragments of each SMS template;

[0009] The multiple template segments are matched with the nodes of the existing path in the template structure tree in sequence, and a new path of the template structure tree is constructed based on the template segments that are not matched with the corresponding nodes.

[0010] In a second aspect, the present application provides a structure tree construction device, which is applied to a short message service platform, and the structure tree construction device includes:

[0011] The SMS receiving module is used to receive the SMS text uploaded to the SMS service platform;

[0012] A template determination module, used to determine a text message template including a plurality of template segments based on the text message;

[0013] A structure tree determination module, used to determine a template structure tree based on the starting characters of the SMS template, wherein the template structure tree is used to integrate template fragments of each SMS template;

[0014] The structure tree construction module is used to sequentially match the multiple template segments with the nodes of the existing path in the template structure tree, and construct a new path of the template structure tree based on the template segments that are not matched with the corresponding nodes.

[0015] In a third aspect, the present application provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following is achieved:

[0016] Receive SMS text uploaded to the SMS service platform;

[0017] Determining a text message template including a plurality of template segments based on the text message;

[0018] Determine a template structure tree based on the starting characters of the SMS template, wherein the template structure tree is used to integrate template fragments of each SMS template;

[0019] The multiple template segments are matched with the nodes of the existing path in the template structure tree in sequence, and a new path of the template structure tree is constructed based on the template segments that are not matched with the corresponding nodes.

[0020] In a fourth aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements:

[0021] Receive SMS text uploaded to the SMS service platform;

[0022] Determining a text message template including a plurality of template segments based on the text message;

[0023] Determine a template structure tree based on the starting characters of the SMS template, wherein the template structure tree is used to integrate template fragments of each SMS template;

[0024] The multiple template segments are matched with the nodes of the existing path in the template structure tree in sequence, and a new path of the template structure tree is constructed based on the template segments that are not matched with the corresponding nodes.

[0025] In a fifth aspect, the present application provides a computer program product, including a computer program, which, when executed by a processor, implements:

[0026] Receive SMS text uploaded to the SMS service platform;

[0027] Determining a text message template including a plurality of template segments based on the text message;

[0028] Determine a template structure tree based on the starting characters of the SMS template, wherein the template structure tree is used to integrate template fragments of each SMS template;

[0029] The multiple template segments are matched with the nodes of the existing path in the template structure tree in sequence, and a new path of the template structure tree is constructed based on the template segments that are not matched with the corresponding nodes.

[0030] The above-mentioned structure tree construction method, device, computer equipment, computer-readable storage medium and computer program product are applied to a short message service platform to receive a short message text uploaded to the short message service platform; determine a short message template containing multiple template segments based on the short message text; determine a template structure tree based on the starting characters of the short message template, and the template structure tree is used to integrate the template fragments of each short message template; sequentially match the multiple template segments with the nodes of the existing path in the template structure tree, and construct a new path of the template structure tree based on the template segments that do not match the corresponding nodes. This application automatically generates short message templates based on the short message text uploaded to the short message service platform, and integrates the short message templates into a template structure tree. The integrated template structure tree is used to achieve fast matching of the short message templates, thereby improving the efficiency of sending short messages. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0032] Figure 1 An application environment diagram of a structure tree construction method in an embodiment;

[0033] Figure 2 A schematic diagram of a flow chart of a structure tree construction method in one embodiment;

[0034] Figure 3 A schematic diagram of the storage structure of a template structure tree in one embodiment;

[0035] Figure 4 A schematic diagram of the creation process of a template structure tree in one embodiment;

[0036] Figure 5 A schematic diagram of a matching process of a template structure tree in one embodiment;

[0037] Figure 6 A schematic diagram of a flow chart of a structure tree construction method in another embodiment;

[0038] Figure 7A structural block diagram of a structure tree building device in one embodiment;

[0039] Figure 8 It is a structural block diagram of a structure tree building device in another embodiment;

[0040] Fig. 9 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0041] In order to make the purpose, technical scheme and advantages of the present application more clear, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used in the description of the present application. If there is a description of the first and the second, it is only for the purpose of distinguishing the technical features, and cannot be understood as indicating or implying the relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features.

[0042] In the description of this application, unless otherwise clearly defined, terms such as setting, installing, connecting, etc. should be understood in a broad sense, and technicians in the relevant technical field can reasonably determine the specific meanings of the above terms in this application based on the specific content of the technical solution.

[0043] See also Figure 1 , Figure 1 FIG. 1 is an application environment diagram of a structure tree construction method in an embodiment. The structure tree construction method provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown, the terminal 102 communicates with the server 104 through a network. The data storage system can store data that the server 104 needs to process. The data storage system can be integrated on the server 104, or placed on the cloud or other servers.

[0044] The terminal 102 may be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, an IoT device, and a portable wearable device. The IoT device may be a smart speaker, a smart TV, a smart air conditioner, and a smart vehicle-mounted device, etc. The portable wearable device may be a smart watch, a smart bracelet, a head-mounted device, etc.

[0045] The server 104 may be an independent physical server or a service node in a blockchain system, wherein each service node in the blockchain system forms a peer-to-peer (P2P) network, and the P2P protocol is an application layer protocol running on the Transmission Control Protocol (TCP) protocol. In addition, the server 104 may also be a server cluster composed of multiple physical servers, and may be a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (CDNs), and big data and artificial intelligence platforms.

[0046] The terminal 102 and the server 104 may be connected via Bluetooth, USB (Universal Serial Bus) or a network or other communication connection methods, which are not limited in this application.

[0047] A short message service platform can be deployed on the server 104 to provide cloud short message services. The server 104 can execute the structure tree construction method of the present application. For example, the server receives a short message text uploaded to the short message service platform. The server determines a short message template containing multiple template segments based on the short message text. The server determines a template structure tree based on the starting characters of the short message template, and the template structure tree is used to integrate the template fragments of each short message template. The server matches the multiple template segments with the nodes of the existing path in the template structure tree in sequence, and constructs a new path of the template structure tree based on the template segments that do not match the corresponding nodes.

[0048] Please refer to 2, Figure 2 FIG. 1 is a flow chart of a method for constructing a structure tree in one embodiment. Figure 2 As shown, a structure tree construction method is provided, and the structure tree construction method is applied to a short message service platform, and includes the following steps S202 to S208:

[0049] Step S202, receiving the SMS text uploaded to the SMS service platform.

[0050] The SMS service platform is a comprehensive system that integrates the functions of sending and receiving SMS. It connects to the SMS channel of telecom operators through Internet technology to provide users with convenient SMS communication services. The platform not only supports the sending of ordinary SMS, but also covers multiple types such as verification code SMS and marketing SMS to meet the needs of different users. Users can send, receive and manage SMS through API interface or Web interface.

[0051] Enterprise users can register and create an account on the SMS service platform. After completing the necessary authentication process, they can design and upload personalized SMS templates according to their business needs. These templates can cover a variety of types such as verification codes, notifications, marketing, etc. to meet the communication needs of enterprises in different scenarios. At the same time, enterprise users can also set their own SMS signatures on the platform.

[0052] When enterprise users need to send SMS, they can do so through the API interface or Web interface provided by the SMS service platform. For example, the SMS sending function can be integrated into the user's own business system through the API interface to realize the automated SMS sending process, while the Web interface provides a more intuitive operation method, where enterprise users can send SMS manually or in batches.

[0053] Based on the structure tree construction method provided by the present application, when a user wants to send a text message or create a new text message template, the user can upload the text message text to the text message service platform. For example, the user can write the text message content in the input box or editing interface provided by the platform, or select a previously created and saved text message template and fill in the corresponding parameters.

[0054] The SMS service platform receives the SMS text uploaded by the user and performs subsequent operations based on the SMS text uploaded by the user. For example, a corresponding SMS template is automatically generated and stored based on the SMS text, and when the user subsequently sends a SMS in the same format again, the corresponding SMS template can be matched. Furthermore, the SMS template can be constructed into a template structure tree based on the structure tree construction method provided in this application to achieve fast matching.

[0055] Step S204: determining a text message template including a plurality of template segments based on the text message.

[0056] Template segments are independent text fragments contained in SMS templates, which can be obtained by dividing SMS templates. For example, by combining semantic segmentation, entity recognition, keyword matching and other language processing technologies, the text of SMS templates containing variables is divided into multiple independent text fragments according to content or structure to obtain multiple template segments.

[0057] For example, variables are identified from a SMS template based on named entity recognition, parameterized placeholders are set for each variable, and the position of the corresponding variable in the SMS text is replaced with the parameterized placeholder to obtain the SMS template. Based on the position of each parameterized placeholder in the SMS template, multiple template segments can be obtained. For example, the text between the start character of the SMS template and the first parameterized placeholder is used as the first template segment, the text between the first parameterized placeholder and the second parameterized placeholder is used as the second template segment, and so on.

[0058] It is understandable that the SMS text, as the text corresponding to the SMS template, can be obtained by replacing the parameters of the SMS template. Therefore, in some cases, the template fragments can also be obtained by dividing the SMS text. For example, based on named entity recognition, variables are identified from the SMS text, and after the variables are removed from the SMS text, the remaining SMS text is divided into template segments.

[0059] In one embodiment, after determining a text message template including multiple template segments based on the text message, the determined text message template can be saved in the text message service platform. Subsequently, the user can send a large number of text messages uniformly by uploading a parameter set based on the text message template.

[0060] Optionally, after determining a text message template containing multiple template segments based on the text message, the text message template can be automatically reviewed. This will advance the review process, and if the user subsequently matches the text message template, there is no need to review the text message template. If the match is successful, the text message can be sent directly, thereby speeding up the text message sending efficiency.

[0061] Optionally, the subsequent steps S206 and S208 may be performed after the review is passed.

[0062] Step S206: determining a template structure tree based on the initial characters of the SMS template.

[0063] The template structure tree is used to integrate template fragments of various SMS templates.

[0064] The starting character of a SMS template refers to the character at the beginning of the text of the SMS template that marks the beginning of the SMS template. The starting character can be a single character or multiple characters. For example, the starting character can be the first character, that is, the first word or symbol at the beginning of the SMS template.

[0065] In different programming languages, the number of bytes corresponding to the same starting character may be different. Taking the starting character as the first character of a Chinese character as an example, in the golang programming language, the starting character refers to the first three bytes of the SMS template text, while in other programming languages, it can refer to the first two bytes.

[0066] The template structure tree is a hierarchical data structure used to integrate SMS templates, consisting of nodes and edges connecting nodes. Each node can have zero or more child nodes, which are used to represent the hierarchical or inclusion relationship between data, such as binary trees, B-trees, etc.

[0067] Taking a binary tree as an example, it may include leaf nodes, non-leaf nodes, sibling nodes, child nodes, and parent nodes. The description of each node is shown in Table 1:

[0068] Table 1

[0069]

[0070] Among them, non-leaf nodes can be used to store information about template segments, where a non-leaf node stores information about a template segment. For example, a non-leaf node may contain an index field to record the start and end positions of the template segment in the original SMS text or SMS template; for example, a non-leaf node may contain a hash field to record the hash value of the template segment to achieve fast matching of the segmented text; for example, a non-leaf node may contain a left pointer to point to the child node of the non-leaf node; for example, a non-leaf node may contain a right pointer to point to the parent node of the non-leaf node.

[0071] The leaf node may be used to store the template ID of the SMS template in the database, and the corresponding SMS template may be found according to the template ID.

[0072] Each template structure tree is established based on the starting character, and SMS templates with the same starting character can be integrated into the same template structure tree, and different starting characters correspond to different template structure trees. Therefore, the template structure tree can be determined based on the starting character.

[0073] It should be noted that determining the template structure tree based on the starting characters of the SMS template includes matching the corresponding template structure tree from the existing template structure tree based on the starting characters of the SMS template, and also includes creating a new template structure tree. For example, the starting characters of the SMS template are matched with each template structure tree. If the match is successful, the matched template structure tree is used as the template structure tree corresponding to the starting characters; if the match fails, a new template structure tree is created based on the starting characters.

[0074] Step S208, sequentially matching the multiple template segments with the nodes of the existing path in the template structure tree, and constructing a new path of the template structure tree based on the template segments that are not matched with the corresponding nodes.

[0075] The existing path refers to the path formed by the nodes that already exist in the template structure tree. The existing path starts from the root node and extends along the branch structure of the tree to a specific node. According to the depth of each node in the template structure tree, the nodes of the template structure tree can be divided into the root node Node0, the first-level child node Node1, the second-level child node Node2, ... Among them, the root node refers to the starting node of the template structure tree, the first-level child node is the child node of the root node, the second-level child node is the child node of the first-level child node... and so on.

[0076] The multiple template segments are matched with nodes of existing paths in the template structure tree in sequence, including matching each template segment with child nodes of different levels in sequence according to the position of each template segment in the SMS template.

[0077] Optionally, the hash values ​​of the template segment and the node can be obtained respectively. If the hash values ​​are the same, it is determined that the match is successful and the template segment matches the corresponding node; if the hash values ​​are different, it is determined that the match fails and the template segment does not match the corresponding node.

[0078] Since there may be multiple child nodes at each level, when each template segment is matched with child nodes at different levels in sequence, the next matching object can be determined according to the matching result of the previous template segment, such as the child node or sibling node entering the N-level child node. The child node or sibling node entering the N-level child node can be realized through the left pointer or right pointer built into the N-level child node.

[0079] For the template segment that matches the corresponding node, you can continue to match the next template segment; for the template segment that does not match the corresponding node, it means that there is no complete path in the template structure tree that matches the SMS template, and you need to start from the template segment that does not match the corresponding node and build a new path in the template structure tree.

[0080] Exemplarily, the Nth template segment is matched with a certain N-level child node of the template structure tree. If the match is successful, the N+1th template segment is matched with the child node of the N-level child node (i.e., the N+1-level child node); if the match fails, the Nth template segment is matched with the brother node of the N-level child node (i.e., another N-level child node); if the Nth template segment fails to match all the N-level child nodes of the template structure tree, a new empty N-level child node is added, and the template segment is filled into the newly added N-level child node. A new path of the template structure tree is constructed starting from the newly added N-level child node, and the template segments after the Nth template segment are sequentially filled into the N+1-level child node, the N+2-level child node, and so on under the N-level child node.

[0081] In the above structure tree construction method, a text message uploaded to a text message service platform is received; a text message template containing multiple template segments is determined based on the text message; a template structure tree is determined based on the starting characters of the text message template, and the template structure tree is used to integrate the template fragments of each text message template; multiple template segments are sequentially matched with the nodes of the existing path in the template structure tree, and a new path of the template structure tree is constructed based on the template segments that do not match the corresponding nodes. This application automatically generates text message templates based on the text message uploaded to the text message service platform, and integrates the text message templates into a template structure tree. The integrated template structure tree is used to achieve rapid matching of text message templates, thereby improving the efficiency of text message sending.

[0082] In one embodiment, determining a text message template including a plurality of template segments based on the text message includes:

[0083] Identify parameter entities from the SMS text; replace the parameter entities in the SMS text with corresponding template parameters to obtain an SMS template corresponding to the SMS text; and divide the SMS template into multiple template fragments based on the position of each template parameter in the SMS template.

[0084] Parameter entity is the part of the text of the SMS that can be changed or replaced, and is a variable. Take the text of the SMS "Dear Mr. Li, your account spent 500 yuan on June 28, 2024." as an example, "Mr. Li", "June 28, 2024", and "500 yuan" are all parameter instances. The parameter instance "Mr. Li" is an instance of the parameter entity "Customer Name", the parameter instance "June 28, 2024" is an instance of the parameter entity "Date", and the parameter instance "500 yuan" is an instance of the parameter entity "Amount".

[0085] Optionally, parameter entities may be identified from the SMS text using named entity recognition (NER) technology, including: pre-defining entity categories of parameter entities, identifying parameter entities from the SMS text based on the pre-defined entity categories using named entity recognition technology, and classifying the identified parameter entities into corresponding entity categories.

[0086] After identifying the parameter entity in the SMS text, replace the parameter entity in the SMS text with the corresponding template parameter to obtain the SMS template corresponding to the SMS text. The template parameter corresponding to the parameter entity can be a parameterized placeholder. Take the SMS text "Dear Mr. Li, your account spent 500 yuan on June 28, 2024." as an example. If {} is used to identify the parameter entity, the parameter entities {customer name}, {date}, and {amount} can be identified from the SMS text. The customer name, date, and amount in the SMS text are replaced with the corresponding template parameters to obtain the SMS template corresponding to the SMS text "Dear {customer name}, your account spent {amount} yuan on {date}.".

[0087] After obtaining the SMS template, the SMS template can be divided into multiple template segments based on the position of each template parameter in the SMS template. For example, the above SMS template can be divided into four template segments: "Dear", ", your account is", "Consumption", and "Yuan." The divided template segments can be subsequently used to match nodes of the existing path of the template tree, and to construct a new path of the template tree based on the template segments that do not match the corresponding nodes.

[0088] Optionally, before identifying parameter entities from the SMS text, the SMS text may be preprocessed, including word segmentation and tagging, and then the parameter entities may be more accurately identified from the preprocessed SMS text.

[0089] In one embodiment, the short message service platform stores a first mapping relationship and a second mapping relationship, wherein the first mapping relationship is a mapping relationship between the short message length and the second mapping relationship, see Table 2.

[0090] Table 2

[0091]

[0092] The second mapping relationship is the mapping relationship between the starting character of the SMS template and the template structure tree, please refer to Table 3.

[0093] Table 3

[0094]

[0095] See also Figure 3 The template structure tree may also be provided with a double-layer map for storing double-layer mapping relationships. The first-layer map is also called LenMap, which is used to store the first mapping relationship between the SMS length and the second mapping relationship, and the second-layer map is also called HeadMap, which is used to store the second mapping relationship between the starting character of the SMS template and the template structure tree. Each non-leaf node may contain an index field, a hash field, a left pointer, and a right pointer.

[0096] In one embodiment, determining the template structure tree based on the starting characters of the SMS template includes:

[0097] Obtain the SMS length of the SMS template; search for a second mapping relationship that matches the SMS length based on the first mapping relationship; if the second mapping relationship that matches the SMS length is found, obtain the starting character of the SMS template, and determine the template structure tree that matches the starting character based on the second mapping relationship.

[0098] If the second mapping relationship matching the SMS length is not found, a template structure tree is created, and a target second mapping relationship between the template structure tree and the starting character is established; a first mapping relationship between the target second mapping relationship and the SMS length is established.

[0099] In one embodiment, sequentially matching multiple template segments with nodes of existing paths in the template structure tree, and constructing a new path of the template structure tree based on template segments that do not match corresponding nodes includes:

[0100] Enter the child node of the root node of the template structure tree; determine the current template segment to be matched, and determine whether the entered child node is an empty node; if the child node is an empty node, fill the template segment to be matched into the child node; if the child node is a non-empty node, match the template segment to be matched with the child node, and enter the child node or sibling node of the child node based on the matching result; based on the entered child node or sibling node, return to execute the steps of determining the current template segment to be matched and determining whether the entered child node is an empty node and subsequent steps, until all template segments that have not matched the corresponding nodes are filled into the empty nodes of the template structure tree, forming a new path of the template structure tree.

[0101] When matching multiple template segments with nodes of existing paths in the template structure tree in sequence, start from the root node of the template structure tree and gradually go deeper into each level of child nodes until all template segments are properly placed.

[0102] If a child node is an empty node, it means that the child node has not been occupied by any template segment. For example, the child node may be an empty node established during initialization or a newly established empty node during the matching process. If a child node is a non-empty node, it means that it already contains some data or template segments. For empty nodes, the template segments to be matched can be filled in, and for non-empty nodes, the template segments to be matched need to be further matched with the child nodes, the path is adjusted according to the matching results, and the above steps are continued.

[0103] When adjusting the path according to the matching results, the template to be matched is segmented and matched with the child nodes. The child nodes or sibling nodes that enter the child node based on the matching results include:

[0104] Obtain the template hash value of the template segment to be matched, and obtain the node hash value of the child node; match the child node with the template segment to be matched based on the template hash value and the node hash value; if the template hash value and the node hash value are the same, determine that the matching result is a successful match, and enter the child node of the child node; if the template hash value and the node hash value are different, determine that the matching result is a failed match, and enter the sibling node of the child node.

[0105] A hash value is a numerical value generated based on information through a specific logical operation (i.e., a hash algorithm). For different input information, its hash value is usually unique. Even if the information only changes slightly, the hash value will change significantly. Therefore, the consistency of the template fragment and the child node can be verified by comparing the hash values ​​of the two to achieve accurate and fast matching. For the template fragment and child node to be matched, the template hash value and the node hash value are obtained respectively, and the child node is matched with the template segment to be matched based on the template hash value and the node hash value. If the template hash value is the same as the node hash value, the matching result is determined to be a successful match; if the template hash value is different from the node hash value, the matching result is determined to be a failed match.

[0106] When adjusting the path based on the matching results, the matching success and matching failure situations are handled differently. Figure 3 and Figure 4 , if the template fragment to be matched has the same hash value as the child node Node1, then the match is determined to be successful, and the left pointer in Node1 is used to enter the child node Node2 of Node1, and the current template fragment to be matched is updated, such as determining the next template fragment to be matched as the template fragment to be matched. If the hash value of the template fragment to be matched is different from that of the child node Node1, then the match is determined to be unsuccessful, and the right pointer in Node1 is used to enter another Node1, which is the brother node of Node1, without updating the current template fragment to be matched, and continue to match the template fragment to be matched with another Node1. If the template fragment to be matched successfully matches another Node1, then the current template fragment to be matched is updated and enters the child node Node2 of another Node1. If the template fragment to be matched fails to match another Node1, then the current template fragment to be matched is not updated, and the template fragment to be matched continues to be matched with the next Node1. And so on, until all nodes NodeN at a certain level fail to match, then a new empty NodeN is added, and the latest template segment to be matched is filled into the newly added NodeN. A new path of the template structure tree is constructed starting from the newly added NodeN, and the template segments following the template segment to be matched are sequentially filled into NodeN+1, NodeN+2, and so on under Node1N.

[0107] Until the template fragment to be matched is the last template fragment in the SMS template, a leaf node is created as the left child node (the child node pointed to by the left pointer) on the child node corresponding to the previous template fragment of the last template fragment, and the last template fragment is filled into the leaf node. The corresponding relationship between the template ID of the SMS template and the leaf node is established and saved, so that the corresponding SMS template can be directly called according to the matched leaf node later.

[0108] In one embodiment, the method further comprises:

[0109] Receive the SMS to be sent uploaded to the SMS service platform; based on the starting characters of the SMS to be sent, search for the target template structure tree corresponding to the starting characters; if the corresponding target template structure tree is found, and the complete path of the target template structure tree is matched based on the SMS to be sent, call the SMS service platform to send the SMS to be sent; otherwise, use the SMS to be sent as the SMS text, and execute the steps and subsequent steps of determining the SMS template containing multiple template segments based on the SMS text.

[0110] In the SMS service platform used by the structure tree construction method provided in the embodiment of the present application, in addition to using the SMS service platform to automatically generate SMS templates and construct a template structure tree, users can also automatically send SMS messages without review and directly send them based on the preliminary review of the SMS templates and the template structure tree.

[0111] This process is achieved by matching the template structure tree. The user uploads the SMS to be sent to the SMS service platform, and the SMS service platform matches the SMS to be sent with each template structure tree. If it matches the corresponding target structure tree and the complete path in the target template structure tree, it means that the SMS service platform has previously received the SMS text of the same template uploaded by the user and built a new path of the template structure tree based on the uploaded SMS text, and integrated the corresponding SMS template into the template structure tree. If the corresponding SMS template and template structure tree have been reviewed in advance, it can be directly determined that the SMS to be sent has passed the review, allowing the user to send the SMS to be sent through the SMS service platform, thereby speeding up the efficiency of SMS sending.

[0112] See also Figure 5 , Figure 5 A schematic diagram of the matching process of the template structure tree provided for the embodiment of the present application. Among them, based on the starting character of the SMS to be sent, searching for the target template structure tree corresponding to the starting character includes: obtaining the SMS length of the SMS to be sent; searching for the second mapping relationship that matches the SMS length of the SMS to be sent based on the first mapping relationship; if the second mapping relationship that matches the SMS length is found, then obtaining the starting character (such as the first three bytes) of the SMS to be sent, and determining the target template structure tree that matches the starting character based on the second mapping relationship; if the second mapping relationship that matches the SMS length of the SMS to be sent is not found, then determining that the match fails.

[0113] If the corresponding target template structure tree is found, a match is performed based on the existing path in the target template structure tree with the SMS to be sent to determine whether the complete path of the target template structure tree can be matched. This includes: extracting SMS fragments from the SMS text according to the nodes of the target template structure tree, and comparing whether the SMS fragments are the same as the template segmentation information in the nodes. Among them, extracting SMS fragments from the SMS text according to the nodes of the target template structure tree includes extracting SMS fragments from the SMS text according to the index field contained in the nodes of the target template structure tree, and comparing whether the SMS fragments are the same as the template segmentation information in the nodes includes comparing whether the hash value of the SMS fragment is the same as the hash value of the template segmentation in the node.

[0114] For example, the index1 field in the first Node1 of the target template structure tree is obtained, and the first SMS segment is intercepted from the SMS text according to the index1 field. The matching result between the first SMS segment and the first Node1 is determined by comparing the hash value of the first SMS segment and the first Node1. If the hash values ​​are the same, the matching result is determined to be a successful match, and the first Node1 child node Node2 is entered, and the second SMS segment is intercepted from the SMS text based on the index2 field in Node2, and the second SMS segment is matched with Node2 based on the second SMS segment and the hash value of Node2; if the hash values ​​are different, the matching result is determined to be a failed match, and the first Node1 sibling node is entered, such as the second Node1, and the first SMS segment is re-interpreted from the SMS text based on the index1 field in the second Node1, and the first SMS segment is matched with the second Node1 based on the first SMS segment and the hash value of the second Node1. By analogy, as long as the child node being matched is not a leaf node, the child node or brother node of the current child node is entered according to the comparison result, and re-matching is performed based on the newly entered node until the match succeeds or fails. Before entering the sibling node, determine whether there is an unmatched sibling node, and select the unmatched sibling node to enter. If there is no unmatched sibling node, it means that all sibling nodes at the same level have failed to match, and it can be determined that the short message to be sent does not match the complete path of the target template structure tree.

[0115] When the child node being matched is a leaf node, determine whether the SMS to be sent matches the SMS template corresponding to the leaf node based on the matching result with the leaf node, and then determine whether the SMS to be sent matches the complete path of the target template structure tree. If the SMS fragment matches the leaf node successfully, it means that the SMS to be sent matches the SMS template corresponding to the leaf node, and it can be determined that the SMS to be sent matches the complete path of the target template structure tree; if the SMS fragment fails to match the leaf node, it means that the SMS to be sent does not match the SMS template corresponding to the leaf node, and it can be determined that the SMS to be sent does not match the complete path of the target template structure tree.

[0116] For the SMS to be sent that matches the complete path, the SMS service platform is called to directly send the SMS to be sent; for the SMS to be sent that does not match the complete path, the SMS to be sent is treated as SMS text, and the steps and subsequent steps of determining the SMS template containing multiple template segments based on the SMS text are executed, that is, the SMS template of the SMS to be sent is generated based on the structure tree creation method provided in the embodiment of the present application and the SMS template is integrated into the template structure tree.

[0117] In the above embodiment, when matching SMS, the template is first preliminarily screened according to the length and the starting character, and then the template is matched according to the template structure tree, which greatly improves the efficiency of SMS sending and ensures the timeliness of SMS; at the same time, it provides a technical foundation for a more efficient and intelligent cloud SMS service platform.

[0118] This application also provides a specific embodiment, please refer to Figure 6 The specific embodiment of the structure tree construction method is as follows:

[0119] (1) Structure tree construction

[0120] S1. Receive the SMS text uploaded to the SMS service platform.

[0121] S2. Identify parameter entities from the SMS text.

[0122] S3. Replace the parameter entity in the SMS text with the corresponding template parameter to obtain the SMS template corresponding to the SMS text.

[0123] S4. Divide the SMS template into multiple template segments based on the position of each template parameter in the SMS template.

[0124] S5. Obtain the SMS length of the SMS template.

[0125] S6: Search for a second mapping relationship that matches the length of the short message based on the first mapping relationship. If not found, proceed to step S7; if found, proceed to step S9.

[0126] S7. Create a template structure tree, and establish a target second mapping relationship between the template structure tree and the starting character.

[0127] S8. Establish a first mapping relationship between the target second mapping relationship and the SMS length.

[0128] S9. Obtain the starting character of the SMS template, and determine a template structure tree matching the starting character based on the second mapping relationship.

[0129] S10. Enter the child node of the root node of the template structure tree.

[0130] S11, determine the current template segment to be matched, and determine whether the entered child node is an empty node. If so, proceed to step S12, if not, proceed to step S13.

[0131] S12: Fill the template segments to be matched into the child nodes.

[0132] S13. Obtain the template hash value of the template segment to be matched, and obtain the node hash value of the child node.

[0133] S14, matching the subnode with the template segment to be matched based on the template hash value and the node hash value. If the template hash value and the node hash value are the same, proceed to step S15, if the template hash value and the node hash value are different, proceed to step S6.

[0134] S15. Determine that the matching result is a successful match, and enter the child node of the child node.

[0135] S16: Determine that the matching result is a matching failure, and enter the sibling node of the child node.

[0136] S17. Based on the entered child node or sibling node, return to execute the steps of determining the current template segment to be matched and determining whether the entered child node is an empty node and subsequent steps, until all template segments that have not matched corresponding nodes are filled into the empty nodes of the template structure tree, forming a new path of the template structure tree.

[0137] (2) Structure tree matching

[0138] S18: receiving the SMS to be sent uploaded to the SMS service platform.

[0139] S19, based on the starting character of the short message to be sent, search for the target template structure tree corresponding to the starting character. If found, proceed to step S20, if not found, proceed to step S21.

[0140] S20, matching the complete path of the target template structure tree based on the short message to be sent. If the match is successful, proceed to step S21, if the match fails, proceed to step S22.

[0141] S21. Determine that a SMS template is matched, and call the SMS service platform to send the SMS to be sent.

[0142] S22: Determine that no SMS template is matched.

[0143] S23. Use the SMS to be sent as SMS text and execute the steps in (1) constructing the structure tree.

[0144] In the above embodiment, a fast channel for sending SMS is provided, which can intelligently generate SMS templates and establish a fast SMS indexing method at the same time. When sending SMS with the same template again in the future, there is no need to replace the template parameters, and the SMS can be sent directly and intelligently matched. For SMS that failed to be sent successfully, SMS templates can be added intelligently and automatically. Therefore, the intelligent automation level of the cloud SMS platform can be greatly improved, the SMS sending rate can be increased, and the timeliness of SMS can be guaranteed.

[0145] It should be understood that, although the steps in the flowcharts involved in the above embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above embodiments may include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0146] Based on the same inventive concept, the embodiment of the present application also provides a structure tree construction device for implementing the structure tree construction method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more structure tree construction device embodiments provided below can refer to the limitations of the structure tree construction method above, and will not be repeated here.

[0147] In one embodiment, Figure 7 As shown, a structure tree construction device is provided, which is applied to a short message service platform. The device includes: a short message receiving module 701, a template determining module 702, a structure tree determining module 703 and a structure tree construction module 704, wherein:

[0148] The SMS receiving module 701 is used to receive the SMS text uploaded to the SMS service platform;

[0149] A template determination module 702, configured to determine a short message template including a plurality of template segments based on the short message text;

[0150] A structure tree determination module 703 is used to determine a template structure tree based on the starting characters of the SMS template, and the template structure tree is used to integrate template fragments of each SMS template;

[0151] The structure tree construction module 704 is used to sequentially match multiple template segments with nodes of existing paths in the template structure tree, and construct a new path of the template structure tree based on the template segments that are not matched with corresponding nodes.

[0152] In one embodiment, when determining a text message template including multiple template segments based on the text message, the template determination module 702 is further configured to:

[0153] Identify parameter entities from SMS text;

[0154] Replace the parameter entity in the SMS text with the corresponding template parameter to obtain the SMS template corresponding to the SMS text;

[0155] The SMS template is divided into multiple template segments based on the position of each template parameter in the SMS template.

[0156] In one embodiment, the SMS service platform stores a first mapping relationship and a second mapping relationship, wherein the first mapping relationship is a mapping relationship between the SMS length and the second mapping relationship, and the second mapping relationship is a mapping relationship between the starting character of the SMS template and the template structure tree;

[0157] When determining the template structure tree based on the starting characters of the SMS template, the structure tree determination module 703 is further used to:

[0158] Get the SMS length of the SMS template;

[0159] Searching for a second mapping relationship that matches the length of the short message based on the first mapping relationship;

[0160] If a second mapping relationship matching the length of the SMS is found, the starting character of the SMS template is obtained, and a template structure tree matching the starting character is determined based on the second mapping relationship.

[0161] In one embodiment, when multiple template segments are matched with nodes of existing paths in the template structure tree in sequence and a new path of the template structure tree is constructed based on the template segments that are not matched with corresponding nodes, the structure tree construction module 704 is further used to:

[0162] Enter the child node of the root node of the template structure tree;

[0163] Determine the current template segment to be matched, and determine whether the entered child node is an empty node;

[0164] If the child node is an empty node, fill the child node with the template segments to be matched;

[0165] If the child node is not an empty node, the template segment to be matched is matched with the child node, and the child node or sibling node of the child node is entered based on the matching result;

[0166] Based on the entered child node or sibling node, return to execute the steps of determining the current template segment to be matched and determining whether the entered child node is an empty node and subsequent steps, until all template segments that have not matched corresponding nodes are filled into the empty nodes of the template structure tree, forming a new path of the template structure tree.

[0167] In one embodiment, when matching the template segment to be matched with the child node and entering the child node or the sibling node of the child node based on the matching result, the structure tree construction module 704 is further used to:

[0168] Get the template hash value of the template fragment to be matched, and get the node hash value of the child node;

[0169] Matching the subnode with the template segment to be matched based on the template hash value and the node hash value;

[0170] If the template hash value is the same as the node hash value, the match result is determined to be a successful match, and the child node of the child node is entered;

[0171] If the template hash value is different from the node hash value, the matching result is determined to be a match failure, and the child node's sibling node is entered.

[0172] Please continue reading Figure 8 In one embodiment, the structure tree construction device further includes a structure tree matching module 705, which is used to:

[0173] Receive SMS messages uploaded to the SMS service platform to be sent;

[0174] Based on the starting characters of the short message to be sent, searching for a target template structure tree corresponding to the starting characters;

[0175] If the corresponding target template structure tree is found, and the target template structure tree is matched to the complete path based on the SMS to be sent, the SMS service platform is called to send the SMS to be sent;

[0176] Otherwise, the short message to be sent is taken as the short message text, and the step of determining a short message template including a plurality of template segments based on the short message text and subsequent steps are performed.

[0177] The structure tree construction device is applied to a short message service platform, wherein the short message receiving module 701 receives the short message text uploaded to the short message service platform; the template determination module 702 determines the short message template containing multiple template segments based on the short message text; the structure tree determination module 703 determines the template structure tree based on the starting character of the short message template, and the template structure tree is used to integrate the template fragments of each short message template; the structure tree construction module 704 sequentially matches the multiple template segments with the nodes of the existing path in the template structure tree, and constructs a new path of the template structure tree based on the template segments that do not match the corresponding nodes. The present application automatically generates short message templates according to the short message text uploaded to the short message service platform, and integrates the short message templates into a template structure tree, and realizes the rapid matching of the short message templates through the integrated template structure tree, thereby improving the sending efficiency of the short message.

[0178] Each module in the structure tree construction device can be implemented in whole or in part by software, hardware or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to each module.

[0179] Terms such as "component", "module", and "system" are intended to refer to a computer-related entity, which can be hardware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to, a process running on a processor, a processor, an object, an executable code, a thread of execution, a program, and / or a computer. As an illustration, both a running program running on a server and a server can be a component. One or more components can reside in a process and / or a thread of execution, and a component can be located in one computer and / or distributed between two or more computers.

[0180] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Fig. 9As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile computer-readable storage medium and an internal memory. The non-volatile computer-readable storage medium stores an operating system, computer-readable instructions and a database. The internal memory provides an environment for the operation of the operating system and computer-readable instructions in the non-volatile computer-readable storage medium. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer-readable instructions are executed by the processor, a structure tree construction method is implemented.

[0181] Those skilled in the art will understand that Fig. 9 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0182] In one embodiment, a computer device is further provided, including a memory and a processor, wherein the memory stores computer-readable instructions, and the processor implements the steps in the above-mentioned method embodiments when executing the computer-readable instructions.

[0183] In one embodiment, a computer-readable storage medium is provided, which stores computer-readable instructions. When the computer-readable instructions are executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0184] In one embodiment, a computer program product is provided, the computer program product includes computer-readable instructions, the computer-readable instructions are stored in a computer-readable storage medium. A processor of a computer device reads the computer-readable instructions from the computer-readable storage medium, and the processor executes the computer-readable instructions, so that the computer device performs the steps in the above-mentioned method embodiments.

[0185] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through computer-readable instructions, and the computer-readable instructions can be stored in a non-volatile computer-readable storage medium. When the computer-readable instructions are executed, they can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in this application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0186] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0187] The above embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A structure tree construction method, characterized in that: Applied to the SMS service platform, the structure tree construction method includes: Receive SMS text uploaded to the SMS service platform; Determining a text message template including a plurality of template segments based on the text message; Determine a template structure tree based on the starting characters of the SMS template, wherein the template structure tree is used to integrate template fragments of each SMS template; The multiple template segments are matched with the nodes of the existing path in the template structure tree in sequence, and a new path of the template structure tree is constructed based on the template segments that are not matched with the corresponding nodes.

2. The method according to claim 1, characterized in that The determining of a short message template including a plurality of template segments based on the short message text comprises: Identify a parameter entity from the text of the SMS message; Replace the parameter entity in the SMS text with the corresponding template parameter to obtain the SMS template corresponding to the SMS text; Based on the position of each template parameter in the SMS template, the SMS template is divided into a plurality of template segments.

3. The method according to claim 1, characterized in that The SMS service platform stores a first mapping relationship and a second mapping relationship, wherein the first mapping relationship is a mapping relationship between the SMS length and the second mapping relationship, and the second mapping relationship is a mapping relationship between the starting character of the SMS template and the template structure tree; The step of determining a template structure tree based on the starting characters of the SMS template includes: Obtain the SMS length of the SMS template; Searching for a second mapping relationship that matches the length of the short message based on the first mapping relationship; If a second mapping relationship matching the length of the SMS is found, the starting character of the SMS template is obtained, and a template structure tree matching the starting character is determined based on the second mapping relationship.

4. The method according to claim 1, characterized in that The step of sequentially matching the plurality of template segments with nodes of the existing path in the template structure tree and constructing a new path of the template structure tree based on the template segments that do not match the corresponding nodes comprises: Enter the child node of the root node of the template structure tree; Determine the current template segment to be matched, and determine whether the entered child node is an empty node; If the child node is an empty node, the template segment to be matched is filled into the child node; If the child node is a non-empty node, the template segment to be matched is matched with the child node, and the child node or sibling node of the child node is entered based on the matching result; Based on the entered child node or sibling node, return to execute the step of determining the current template segment to be matched, and determining whether the entered child node is an empty node and subsequent steps, until all template segments that have not matched corresponding nodes are filled into the empty nodes of the template structure tree, forming a new path of the template structure tree.

5. The method according to claim 4, characterized in that The matching of the template segment to be matched with the child node and entering the child node or the sibling node of the child node based on the matching result includes: Obtaining a template hash value of the template fragment to be matched, and obtaining a node hash value of the child node; Matching the child node with the template segment to be matched based on the template hash value and the node hash value; If the template hash value is the same as the node hash value, the matching result is determined to be a successful match, and the child node of the child node is entered; If the template hash value is different from the node hash value, the matching result is determined to be a matching failure, and the process proceeds to the sibling node of the child node.

6. The method according to claim 1, characterized in that The method further comprises: Receive SMS messages uploaded to the SMS service platform to be sent; Based on the starting character of the short message to be sent, searching for a target template structure tree corresponding to the starting character; If the corresponding target template structure tree is found, and the target template structure tree is matched to the complete path of the target template structure tree based on the short message to be sent, the short message service platform is called to send the short message to be sent; Otherwise, the to-be-sent SMS is taken as the SMS text, and the step of determining the SMS template including a plurality of template segments based on the SMS text and subsequent steps are performed.

7. A structure tree construction device, characterized in that: Applied to the short message service platform, the structure tree building device includes: The SMS receiving module is used to receive the SMS text uploaded to the SMS service platform; A template determination module, used to determine a text message template including a plurality of template segments based on the text message; A structure tree determination module, used to determine a template structure tree based on the starting characters of the SMS template, wherein the template structure tree is used to integrate template fragments of each SMS template; The structure tree construction module is used to sequentially match the multiple template segments with the nodes of the existing path in the template structure tree, and construct a new path of the template structure tree based on the template segments that are not matched with the corresponding nodes.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images