Detailed Description
Embodiments of the present disclosure are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are exemplary and intended for the purpose of explaining the present disclosure and are not to be construed as limiting the present disclosure.
The following describes a method, an apparatus, an electronic device, and a storage medium for processing time information according to an embodiment of the present disclosure with reference to the accompanying drawings.
Fig. 1 is a flowchart of a time information processing method according to an embodiment of the present disclosure, and it should be noted that the time information processing method may be applied to a time information processing apparatus according to an embodiment of the present disclosure, and the apparatus may be configured in an electronic device. The electronic device may be a mobile terminal, such as a mobile phone, a tablet computer, a personal digital assistant, or other hardware devices with various operating systems.
As shown in fig. 1, the method for processing the time information may include the following steps:
Step 101, a plurality of messages in a conversation are acquired.
In the embodiment of the disclosure, multiple utterances of a speaker in a conversation may be acquired, and the multiple utterances of the speaker in the conversation may be corresponding to the multiple utterances as multiple messages in the conversation.
Step 102, identifying each message to determine whether each message contains a candidate time for executing the target operation and whether each message belongs to a target intention for negating the target operation.
Further, content recognition is performed on each of the plurality of messages in the conversation, and whether the candidate time for executing the target operation is included in each of the messages or not and whether each of the messages belongs to the target intention for negating the target operation are determined according to the recognition content. For example, the message is "give me call before 12 points", the target is call back ", the content recognition is performed on the message, it can be determined that the message does not include the candidate time for executing the target operation and the message belongs to the target intention for negating the target operation, for example, the message is" inconvenient, the message is given me call back bar after 12 points ", the target is call back, the content recognition is performed on the message, the message includes the candidate time for executing the target operation and the message belongs to the target intention for negating the target operation, for example," can, something else after 12 points "the target is call back, the content recognition is performed on the message, it can be determined that the message does not include the candidate time for executing the target operation and the message does not belong to the target intention for negating the target operation, for example, the message is" call back can be given me before 12 am days ", the content recognition is performed on the message, it can be determined that the message includes the candidate time for executing the target operation and the message does not belong to the target intention for negating the target operation.
And step 103, determining a target message from the messages, wherein the target message contains candidate time for executing the target operation, and the messages in the dialogue after the target message do not belong to the target intention.
In the embodiment of the disclosure, according to whether each message contains a candidate time for executing the target operation and whether each message belongs to the target intention of the negative target operation, the target message can be determined from each message, wherein the target message contains the candidate time for executing the target operation, and each message after the target message in the dialogue does not belong to the target intention of the negative target operation.
For example, using the target operation as a power back, the messages in the conversation are shown in table 1,
Table 1 opposite messages in dialogue
Identifying 6 messages in table 1 can determine that messages containing candidate time of return are message 2 to message 5, message belonging to target intention of negative return is message 3, messages not belonging to target intention of negative return are messages 2,1 and 5, message 5 is rewriting of message 4, and message 5 is target message.
Step 104, determining the target time for executing the target operation according to the time information for executing the target operation contained in the target message.
In the embodiment of the present disclosure, time information for executing a target operation, which is included in a target message, is taken as a target time for executing the target operation. For example, the target message in table 1 is "can be before 10 am", and the final power back time can be determined to be before 10 am on tomorrow. It should be noted that, in order to improve the feasibility of the embodiment of the present disclosure, for the target time for performing the target operation to be "before x point" or "after x point", correspondingly, the target time for performing the target operation may be set to be N minutes forward of the target time or N minutes backward of the target time, for example, the target time for performing the target operation may be "before 12 points", the target time for performing the target operation may be set to be "57 points", for example, the target time for performing the target operation may be "after 12 points", and the target time for performing the target operation may be set to be "03 points".
In summary, by determining whether each message includes a candidate time for executing the target operation and whether the message belongs to the target intention of the target operation, the target message is determined from each message, and further, the execution time for executing the target operation is determined according to the time information of the target operation included in the target message, thereby accurately determining the execution time for executing the target operation.
In order to accurately determine the target message from the messages, as shown in fig. 2, fig. 2 is a flow chart of a processing method of time information provided in the second embodiment of the disclosure. In an embodiment of the present disclosure, a message in a conversation including a candidate time for performing a target operation may be determined as a candidate message, and a candidate message having no invalid flag may be determined as a target message, and the embodiment shown in fig. 2 may include the steps of:
In step 201, a plurality of messages in a conversation are acquired.
Step 202, identifying each message to determine whether each message contains a candidate time for performing the target operation and whether each message belongs to a target intention for negating the target operation.
In step 203, the message containing the candidate time in the conversation is determined as a candidate message.
In the embodiment of the disclosure, the message content of each message is identified, whether each message contains the candidate time for executing the target operation or not and whether each message belongs to the target intention for negating the target operation or not can be determined, and the message containing the candidate time for executing the target operation is taken as the candidate message.
Step 204, for any one candidate message, in the case of determining that the target intention is included, marking the candidate time contained in each candidate message before the one candidate message as invalid.
In step 205, the candidate message without the invalid flag is taken as the target message.
Further, for any candidate message, it may be determined whether the candidate message belongs to the target intention of the negative target operation, if the message belongs to the target intention of the negative target operation, the candidate time stamp contained in each candidate message before the message may be invalid, if the candidate message without the invalid stamp is one, the candidate message without the invalid stamp may be regarded as the target message, and if the candidate message without the invalid stamp is a plurality of candidate messages with the invalid stamp, the candidate message with the invalid stamp ordered later in the conversation may be regarded as the target message. Wherein the target message contains a candidate time for performing the target operation and each message in the conversation that follows the target message does not belong to the target intent.
For example, in table 1, messages 2 to 5 are candidate messages, message 3 belongs to the target intention of the negative target operation, the candidate time contained in message 2 before message 3 may be marked as invalid, messages 4 and 5 have no invalid mark, and the candidate message 5 with the invalid mark after the sequence is the target message.
In step 206, the target time for executing the target operation is determined according to the time information for executing the target operation contained in the target message.
In the embodiment of the present disclosure, steps 201 to 202 and step 206 may be implemented in any manner in each embodiment of the present disclosure, which is not limited to this embodiment, and is not repeated herein.
In summary, a message including candidate time in a conversation is determined as a candidate message, when a target intention is determined to belong to any one of the candidate messages, the candidate time included in each candidate message preceding the one candidate message is marked as invalid, and the candidate message without the invalid mark is taken as the target message. Thus, the target message can be accurately determined from the messages.
In order to accurately determine whether each message contains a candidate time for performing the target operation and whether each message belongs to a target intention for negating the target operation, as shown in fig. 3, fig. 3 is a flowchart of a method for processing time information according to the third embodiment of the present disclosure. In the embodiment of the disclosure, a time sequence may be generated according to the time text in the message, and each time text in the time sequence may be identified to determine whether each message contains a candidate time for performing the target operation and whether each message belongs to a target intention for negating the target operation. The embodiment shown in fig. 3 may include the following steps:
step 301, a plurality of messages in a conversation are acquired.
Step 302, time text is identified for each message.
In the embodiment of the disclosure, time text recognition may be performed on each message, optionally, text content matched with one or more preset regular expressions is extracted from each message according to the preset regular expressions, and the matched text content is parsed to obtain a corresponding time text, where it is to be noted that each preset regular expression corresponds to a parsing mode field, and the parsing mode field may be used to parse the time text to a specific time point. For example, as shown in table 2, text content matched with a preset regular expression can be extracted from each message, and further, as shown in table 3, the matched text content is processed according to an analysis mode based on the current time, so as to obtain a corresponding time text. For example, the matched text content is processed with the date of 2021 being 5 months and 8 days, the acquired corresponding time text is 2021-05-08, for example, the matched text content is processed with the date of 2021-05-01:00:00 before 6 pm, for example, the matched text content is processed with the date of 2021-05-01:00:00, for example, the matched text content is processed within 24 hours, and the acquired corresponding time text is 2021-05-02:14:15.
Table 2 extracts text content matching a preset regular expression
TABLE 3 processing matched text content according to parsing scheme
In order to effectively identify the time text in each message, each message in the dialogue may be text cleaned before identifying the time text in each message, for example, english uppercase lowercase in each message, chinese digit to arabic digit, traditional chinese to simplified chinese, full-angle character to half-angle character, emoji removal, non-text message removal, blank message removal, pure symbol removal, URL (Uniform Resource Locator ) removal link, and the like may be performed.
Step 303, generating a time sequence according to the identified time text, wherein the time sequence comprises time texts contained in each message, and each time text is ordered according to the sequence in the dialogue.
It should be appreciated that for each message in a conversation, the sequence number of each message may be marked in the order of transmission, and the speaker of the message may be marked, along with the speaking time, where the speaker may be used to mark which speaker the message was sent by, and the speaking time may be used to mark the time of transmission of the message, so that the subsequent computation time is referenced to the speaking time.
In the embodiment of the disclosure, after the time texts are identified, the time texts may be sequentially arranged according to the marking order of the messages in the dialogue, and the arrangement result is used as a time sequence. The time sequence may include a time text, an parsing manner corresponding to the time text, a start position of the time text in the message, an end position of the time text in the message, and the like.
Step 304, identifying whether each time text in the time series belongs to a candidate time for performing the target operation, and identifying whether each message belongs to a target intention.
Further, each time text in the time series may be identified to determine whether the time text belongs to a candidate time for performing the target operation.
Optionally, any one time text in the time sequence, a message to which the one time text belongs and at least one message preceding the one time text are input into the first recognition model to recognize whether the one time text belongs to a candidate time for performing the target operation.
For example, as shown in table 4, for example, the time text in the time sequence is "before 2 pm today", the message corresponding to the time text is "bar before 2 pm today" and the previous message is "give you back before 12 pm in me open day," ask you when you are convenient to answer a call. For another example, the time text in the time sequence is "before 12 points", the message "call me before 12 points" corresponding to the time text and the previous message "ask me for an air ticket of 5 months 21 days to Beijing", "ask you when to get things convenient for goods, and" before two afternoon bar today "input a first recognition model, the model can recognize the time text, and it is determined that the message corresponding to the time text" before 12 points "is not a sentence expressing the callback time, and the time text does not belong to the candidate time for executing the target operation. It should be noted that the first recognition model may be a trained neural network model.
Table 4 identifies whether the time text belongs to the return time
In embodiments of the present disclosure, each message in a conversation may be identified while identifying each time text in a time series to determine whether the time text belongs to a candidate time for performing a target operation, to determine whether the message belongs to a target intent for a negative target operation.
Optionally, for any one of the messages in the conversation, one message and at least one message preceding the one message are input into the second recognition model to recognize whether the one message belongs to a target intention of a negative target operation.
For example, as shown in table 5, for example, the message "i am not available in the afternoon" and the previous message "i am give you a return to electricity before 18 pm" are input into the second recognition model, and the model can recognize the message, and determine that the message "i am not available in the afternoon" belongs to a negative return, which indicates that the message belongs to the target intention of the negative target operation. For another example, the message "good" and the previous message "give you a return to electricity before 12 am in my tomorrow" are input into a second recognition model, which can recognize the message, determine that the message "good" belongs to a non-negative return to electricity, and indicate that the message does not belong to the target intention of the negative target operation. It should be noted that the second recognition model may be a trained neural network model.
Table 5 identifies whether the message belongs to a negative return call
It should be noted that, when the message including the time text is identified by the first identification model and the second identification model, the message including the time text may be classified into a category in which the time text in the message belongs to a candidate time for executing the target operation, the message belongs to a target intention for negating the target operation, the time text in the message does not belong to a candidate time for executing the target operation, the message belongs to a target intention for negating the target operation, the time text in the message belongs to a candidate time for executing the target operation, the message does not belong to a target intention for negating the target operation, and the time text of the message does not belong to a candidate time for executing the target operation.
For example, as shown in table 6, taking the candidate time for executing the target operation as the return time, the target for the negative target operation is intended to be negative return, for example, "before 12 points" in the message "give me call before 12 points" belongs to the non-return time, and belongs to the negative return time, for the message "inconvenient," after 12 points "in the call bar of me call belongs to the return time, and the message belongs to the negative return time, for the message" can, "after 12 points" in the something "after 12 points" belongs to the non-return time, and the message belongs to the non-negative return time, for the message "before 12 points" in the call bar of me call before 12 points "belongs to the return time, and the message belongs to the non-negative return time.
Table 6 message categories including time text
| Telephone me before 12 points | Time of non-return of electricity | Negative return electricity |
| Inconvenient, telephone bar for me after 12 points | Time of return of electricity | Negative return electricity |
| Can be there is something after I12 points | Time of non-return of electricity | Non-negative return electricity |
| Telephone for me before 12 points | Time of return of electricity | Non-negative return electricity |
And step 305, determining a target message from the messages, wherein the target message contains candidate time for executing the target operation, and the messages in the dialogue after the target message do not belong to the target intention.
Step 306, determining the target time for executing the target operation according to the time information for executing the target operation contained in the target message.
In the embodiment of the present disclosure, steps 301 and steps 306 to 306 may be implemented in any manner in each embodiment of the present disclosure, which is not limited to this embodiment, and will not be described in detail.
In summary, a time sequence is generated by identifying a time text for each message, wherein the time sequence includes time texts contained in each message, each time text is ordered according to a sequence in a conversation, each time text in the time sequence identifies whether each time text belongs to a candidate time for performing a target operation, and each message identifies whether each message belongs to a target intention. Thus, it can be accurately determined whether or not the candidate time for performing the target operation is included in each message, and whether or not each message belongs to the target intention for negating the target operation.
In order to make the present disclosure more apparent to those skilled in the art, examples are now described.
The processing procedure of the time information in the customer dialogue is as shown in fig. 4, and is exemplified by (1) acquiring the customer dialogue, (2) text cleaning, namely sorting cleaned texts in the customer dialogue to acquire a message sequence, (4) time identification, namely determining whether the message contains candidate time for executing target operation or not, and (5) intention identification, namely after time identification, conducting intention identification on the message sequence, (6) time correction, namely marking the message containing the candidate time as invalid when the message contains the candidate time and belongs to target intention of negative target operation, namely acquiring the candidate message sequence without invalid mark in the dialogue, (7) sequence integration, namely, taking the candidate message without invalid mark after the conversation is sequenced in the dialogue as target message, (9) identification result, namely determining the time information for executing the target operation contained in the target message as the target time for executing the target operation.
It should be noted that, as shown in fig. 5, taking the candidate time for executing the target operation as the power-back time, the target intention of the negative target operation is the negative power-back, for example, the process of time correction in fig. 4 may be as follows:
(1) Checking whether the message identifies time in the time identification step, and if not, jumping to the step (3);
(2) If the classification result of the power-back time is 'non-power-back time', deleting all the results of the message from the time sequence;
(3) Checking whether a record with a valid field exists in the time sequence, and ending the flow if no record exists;
(4) As shown in tables 7 and 8, if the negative power-back classification result is "negative power-back", the "valid or not" field in all the results corresponding to the last time-available message preceding the present message in the time sequence is modified to be invalid. It should be noted that, this step does not affect the time identified by the current sentence, so as to better process a plurality of expression scenes contained in one message.
TABLE 7 scene 1
TABLE 8 scene 2
According to the time information processing method, whether each message contains the candidate time for executing the target operation or not and whether the message belongs to the target intention of the target operation or not is used for determining the target message from each message, and further, the execution time for executing the target operation is determined according to the time information of the target operation contained in the target message, so that the execution time for executing the target operation can be accurately determined.
In order to implement the above embodiment, the present disclosure also proposes a processing apparatus of time information.
Fig. 6 is a schematic structural diagram of a processing device for time information according to an embodiment of the present disclosure.
As shown in fig. 6, the processing apparatus of time information includes an acquisition module 610, an identification module 620, a first determination module 630, and a second determination module 640.
The system comprises an acquisition module 610, a recognition module 620 and a second determination module 640, wherein the acquisition module 610 is used for acquiring a plurality of messages in a conversation, the recognition module 620 is used for recognizing each message to determine whether each message contains candidate time for executing target operation and whether each message belongs to target intention for negating target operation, the first determination module 630 is used for determining target message from each message, wherein the target message contains the candidate time for executing target operation and each message in the conversation after the target message does not belong to target intention, and the second determination module 640 is used for determining target time for executing target operation according to the time information for executing target operation contained in the target message.
As one possible implementation manner of the embodiment of the present disclosure, the first determining module 630 is specifically configured to determine a message including a candidate time in a conversation as a candidate message, for any one candidate message, in a case where it is determined that the message belongs to a target intention, mark candidate time included in each candidate message before the one candidate message as invalid, and use a candidate message without an invalid mark as a target message.
As one possible implementation manner of the embodiment of the present disclosure, the first determining module 630 is further configured to, in a case where there are a plurality of candidate messages without an invalid flag, take, as the target message, the candidate messages without an invalid flag that are ordered later in the conversation.
As one possible implementation of the embodiment of the disclosure, the identifying module 620 is specifically configured to identify a time text for each message, generate a time sequence according to the identified time text, where the time sequence includes time texts included in each message, each time text is ordered according to a sequence in a conversation, identify whether each time text in the time sequence belongs to a candidate time for performing a target operation, and identify whether each message belongs to a target intention.
As one possible implementation manner of the embodiment of the present disclosure, the identifying module 620 is further configured to input, into the first identifying model, a message to which the time text belongs and at least one message preceding the message to which the time text belongs in any time text in the time sequence, so as to identify whether the time text belongs to a candidate time for performing the target operation.
As one possible implementation of an embodiment of the present disclosure, the identifying module 620 is further configured to input, for any one message in the conversation, one message and at least one message preceding the one message into the second identifying model, so as to identify whether the one message belongs to the target intention.
It should be noted that the foregoing explanation of the embodiment of the method for processing time information is also applicable to the apparatus for processing time information of this embodiment, and will not be repeated here.
According to the processing device of the time information, whether each message contains the candidate time for executing the target operation or not and whether the message belongs to the target intention of the target operation or not is used for determining the target message from each message, and further, the execution time for executing the target operation is determined according to the time information of the target operation contained in the target message, so that the execution time for executing the target operation can be accurately determined.
In order to implement the above-described embodiments, the present application also proposes an electronic device, as shown in fig. 7, fig. 7 being a block diagram of an electronic device showing a processing method for time information according to an exemplary embodiment.
As shown in fig. 7, the electronic device 700 includes:
A memory 710 and a processor 720, a bus 730 connecting the different components (including the memory 710 and the processor 720), the memory 710 storing a computer program which when executed by the processor 720 implements the method of processing time information according to the embodiments of the present disclosure.
Bus 730 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, micro channel architecture (MAC) bus, enhanced ISA bus, video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.
Electronic device 700 typically includes a variety of electronic device readable media. Such media can be any available media that is accessible by electronic device 700 and includes both volatile and nonvolatile media, removable and non-removable media.
Memory 710 may also include computer system readable media in the form of volatile memory, such as Random Access Memory (RAM) 740 and/or cache memory 750. Electronic device 700 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, storage system 760 may be used to read from or write to non-removable, non-volatile magnetic media (not shown in FIG. 7, commonly referred to as a "hard disk drive"). Although not shown in fig. 7, a magnetic disk drive for reading from and writing to a removable non-volatile magnetic disk (e.g., a "floppy disk"), and an optical disk drive for reading from or writing to a removable non-volatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In such cases, each drive may be coupled to bus 730 through one or more data medium interfaces. Memory 710 may include at least one program product having a set (e.g., at least one) of program modules configured to carry out the functions of the various embodiments of the disclosure.
A program/utility 780 having a set (at least one) of program modules 770 may be stored in, for example, memory 710, such program modules 770 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment. Program modules 770 typically carry out the functions and/or methods of the embodiments described in this disclosure.
The electronic device 700 may also communicate with one or more external devices 790 (e.g., keyboard, pointing device, display, etc.), one or more devices that enable a user to interact with the electronic device 700, and/or any devices (e.g., network card, modem, etc.) that enable the electronic device 700 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 792. Also, the electronic device 700 may communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN) and/or a public network, such as the Internet, through a network adapter 793. As shown in fig. 7, the network adapter 793 communicates with other modules of the electronic device 700 over the bus 730. It should be appreciated that although not shown in FIG. 7, other hardware and/or software modules may be used in connection with electronic device 700, including, but not limited to, microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.
The processor 720 executes various functional applications and data processing by running programs stored in the memory 710.
It should be noted that, the implementation process and the technical principle of the electronic device in this embodiment refer to the foregoing explanation of the processing of the time information in the embodiment of the disclosure, and are not repeated herein.
In order to achieve the above embodiments, the present application also proposes a non-transitory computer-readable storage medium storing computer instructions for causing a computer to execute the processing method of time information described in the above embodiments.
In order to implement the above embodiments, the present disclosure also provides a computer program product which, when executed by an instruction processor in the computer program product, performs the method for processing time information described in the above embodiments.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present disclosure. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In the description of the present disclosure, the meaning of "a plurality" is at least two, such as two, three, etc., unless explicitly specified otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and additional implementations are included within the scope of the preferred embodiment of the present disclosure in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the embodiments of the present disclosure.
Logic and/or steps represented in the flowcharts or otherwise described herein, e.g., a ordered listing of executable instructions for implementing logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include an electrical connection (an electronic device) having one or more wires, a portable computer diskette (a magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). In addition, the computer readable medium may even be paper or other suitable medium on which the program is printed, as the program may be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.
It should be understood that portions of the present disclosure may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, the various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. If implemented in hardware as in another embodiment, may be implemented using any one or combination of techniques known in the art, discrete logic circuits with logic gates for implementing logic functions on data signals, application specific integrated circuits with appropriate combinational logic gates, programmable Gate Arrays (PGAs), field Programmable Gate Arrays (FPGAs), etc.
Those of ordinary skill in the art will appreciate that all or a portion of the steps carried out in the method of the above-described embodiments may be implemented by a program to instruct related hardware, where the program may be stored in a computer readable storage medium, and where the program, when executed, includes one or a combination of the steps of the method embodiments.
Furthermore, each functional unit in the embodiments of the present disclosure may be integrated in one processing module, or each unit may exist alone physically, or two or more units may be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a computer readable storage medium if implemented in the form of software functional modules and sold or used as a stand-alone product.
The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, or the like. Although embodiments of the present disclosure have been shown and described above, it will be understood that the above embodiments are illustrative and not to be construed as limiting the present disclosure, and that variations, modifications, alternatives, and variations may be made to the above embodiments by one of ordinary skill in the art within the scope of the present disclosure.