CN111986033A

CN111986033A - Equivalent expression identification method and identification device and terminal equipment

Info

Publication number: CN111986033A
Application number: CN202010763233.2A
Authority: CN
Inventors: 傅正茂; 彭舰
Original assignee: Kingdom Financial Nanjing Technology Co ltd
Current assignee: Kingdom Financial Nanjing Technology Co ltd
Priority date: 2020-07-31
Filing date: 2020-07-31
Publication date: 2020-11-24

Abstract

The application is applicable to the technical field of data processing, and provides an equivalent expression identification method, an equivalent expression identification device and terminal equipment, wherein the method comprises the following steps: acquiring a target expression, wherein the target expression comprises a first factor; acquiring a relevant data set corresponding to each first factor; calculating the target expression according to each associated data set to obtain a first calculation result; acquiring a second operation result corresponding to a preset first expression; and if a second operation result identical to the first operation result exists, judging that a first expression equivalent to the target expression exists. The method and the system can solve the problem that the existing financial planning system cannot identify whether the two expressions are equivalent or not.

Description

Equivalent expression identification method and identification device and terminal equipment

Technical Field

The application belongs to the field of data processing, and particularly relates to an equivalent expression identification method, an equivalent expression identification device and terminal equipment.

Background

With the development of science and technology and economy, people pay more and more attention to the management of money. For example, more and more people enjoy financial investments. And the channels for realizing financial investment generally buy various financial products. Currently, users generally purchase various financial products by operating a financial planning system.

However, people are subject to some regulatory constraints when making financial investments. For example, the administrator of the financial planning system may make various rules based on policies and laws regarding financial investments.

Due to the existence of various constraint rules, the financial planning system is complicated. Therefore, to reduce the complexity of the financial planning system, the administrator of the financial planning system typically expresses various rules in terms of sets representing individual objects. For example, set A represents national bonds, set B represents financial bonds, set C represents securities with a term of 3-5 years, and set D represents bonds traded in the inter-bank market. Then the rule of "the securities traded in the interbank market are national bonds and financial bonds with a term of 3-5 years" is expressed as (A @ B) @ C @ D by an expression.

However, the style of the expression set by each administrator may be different on the same financial planning system, but in practice the rules represented by the expression are the same. For example, the rule represented by expression (a ═ B) — C —, D is the same as the rule represented by expression (a ═ C — (B —) C —, D), i.e., when the two expressions are equivalent. However, the current financing planning system cannot identify whether the two expressions are equivalent, so that more and more equivalent expressions are available on the financing planning system. And when equivalent expressions on one financial planning system are more and more, the complexity of the financial planning system is higher and higher.

Thus, current financial planning systems are unable to identify whether two expressions are equivalent.

Disclosure of Invention

The embodiment of the application provides an equivalent expression identification method, an equivalent expression identification device and terminal equipment, and can solve the problem that the existing financial planning system cannot identify whether two expressions are equivalent or not.

In a first aspect, an embodiment of the present application provides an equivalent expression identification method, including:

acquiring a target expression, wherein the target expression comprises a first factor;

acquiring a relevant data set corresponding to each first factor;

calculating the target expression according to each associated data set to obtain a first calculation result;

acquiring a second operation result corresponding to a preset first expression;

if there is a second operation result identical to the first operation result, it is determined that there is a first expression equivalent to the target expression.

In a second aspect, an embodiment of the present application provides an equivalent expression identifying apparatus, including:

the expression acquisition module is used for acquiring a target expression, and the target expression comprises a first factor;

a data set obtaining module, configured to obtain associated data sets corresponding to the first factors;

the first operation module is used for operating the target expression according to each associated data set to obtain a first operation result;

the second operation result acquisition module is used for acquiring a second operation result corresponding to the preset first expression;

and the judging module is used for judging that a first expression equivalent to the target expression exists if a second operation result identical to the first operation result exists.

In a third aspect, an embodiment of the present application provides a terminal device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of the method according to the first aspect when executing the computer program.

In a fourth aspect, the present application provides a computer-readable storage medium, which stores a computer program, and the computer program implements the steps of the method according to the first aspect when executed by a processor.

In a fifth aspect, an embodiment of the present application provides a computer program product, which, when run on a terminal device, causes the terminal device to execute the equivalent expression identifying method according to any one of the first aspect.

It is understood that the beneficial effects of the second aspect to the fifth aspect can be referred to the related description of the first aspect, and are not described herein again.

Compared with the prior art, the embodiment of the application has the advantages that:

in view of the above, the present application provides an equivalent expression identification method, which includes first obtaining a target expression, where the target expression includes a first factor. And then acquiring the associated data sets corresponding to the first factors. And then, operating the target expression according to each associated data set to obtain a first operation result. And then acquiring a second operation result corresponding to the preset first expression. If there is a second operation result identical to the first operation result, it is determined that there is a first expression equivalent to the target expression. In other words, in the application, the target expression is operated according to each associated data set to obtain a first operation result, and then whether a first expression equivalent to the target expression exists is judged according to whether the first operation result is the same as a second operation result corresponding to a preset first expression. Therefore, in the present application, it is possible to identify whether the two expressions are equivalent.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.

Fig. 1 is a schematic flowchart of an equivalent expression recognition method according to an embodiment of the present application;

fig. 2 is a schematic structural diagram of an equivalent expression identifying apparatus according to an embodiment of the present application;

fig. 3 is a schematic structural diagram of a terminal device according to an embodiment of the present application.

Detailed Description

In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.

It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

It should also be understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.

As used in this specification and the appended claims, the term "if" may be interpreted contextually as "when", "upon" or "in response to" determining "or" in response to detecting ". Similarly, the phrase "if it is determined" or "if a [ described condition or event ] is detected" may be interpreted contextually to mean "upon determining" or "in response to determining" or "upon detecting [ described condition or event ]" or "in response to detecting [ described condition or event ]".

Furthermore, in the description of the present application and the appended claims, the terms "first," "second," "third," and the like are used for distinguishing between descriptions and not necessarily for describing or implying relative importance.

Reference throughout this specification to "one embodiment" or "some embodiments," or the like, means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the present application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," or the like, in various places throughout this specification are not necessarily all referring to the same embodiment, but rather "one or more but not all embodiments" unless specifically stated otherwise. The terms "comprising," "including," "having," and variations thereof mean "including, but not limited to," unless expressly specified otherwise.

The equivalent expression identification method provided by the embodiment of the application can be applied to terminal devices such as a mobile phone, a tablet computer, a notebook computer, an ultra-mobile personal computer (UMPC), a netbook, a Personal Digital Assistant (PDA), and the like, and the embodiment of the application does not limit the specific types of the terminal devices.

In order to explain the technical solution described in the present application, the following description will be given by way of specific examples.

Example one

An equivalent expression recognition method provided in an embodiment of the present application is described below with reference to fig. 1, where the method includes:

step S101, a target expression is obtained, and the target expression comprises a first factor.

In step S101, the target expression refers to a new expression input by the user. The first factor refers to a parameter to be operated in the target expression. For example, if the target expression is (A @ B) @ C, the first factor is A, B and C.

And S102, acquiring the associated data sets corresponding to the first factors.

In step S102, the associated data set is a preset data set. The preset data sets are in a non-complete orthogonal relation. The "non-perfect orthogonality" relationship means that the data contained in each preset data set are not identical, and there is similarity in bit dimension.

For example, each preset data set is:

{0，11，12，101，102，103，1001，1002，1003,1004}、

{1，12，13，102，103，104，1002，1003,1004，1005}、

and {2, 13, 14, 103, 104, 101, 1003,1004, 1005, 1001 }.

The data included in the preset data sets may be selected or designed according to actual requirements, as long as the preset data sets are in a non-complete orthogonal relationship, and the present application is not specifically limited herein.

Step S103, operating the target expression according to each associated data set to obtain a first operation result.

In step S103, after the associated data sets corresponding to the first factors are obtained, the target expression is operated according to the associated data sets, so as to obtain a first operation result. For example, assuming that the target expression is (a ≧ B) # C, the associated data sets are:

a corresponds to the set {0, 11, 12, 101, 102, 103, 1001, 1002, 1003,1004 };

b corresponds to the set {1, 12, 13, 102, 103, 104, 1002, 1003,1004, 1005 };

and C corresponds to the set {2, 13, 14, 103, 104, 101, 1003,1004, 1005, 1001 }.

In this case, the first operation result is {13, 101, 103, 104, 1001, 1003,1004, 1005 }.

And step S104, acquiring a second operation result corresponding to the preset first expression.

In step S104, the preset first expression is a pre-stored expression. If each factor in the preset first expression is associated with the associated data set in advance, the preset first expression may be calculated according to the associated data combination, and then the obtained second operation result corresponding to the first expression is stored. After the target expression is obtained, a second operation result corresponding to the preset first expression can be directly obtained. If all factors in the preset first expression are not associated with the associated data set, after the target expression is obtained, the preset first expression needs to be calculated according to the associated data set, and then a second operation result corresponding to the first expression is obtained.

And step S105, if a second operation result identical to the first operation result exists, judging that a first expression equivalent to the target expression exists.

In step S105, if there is a second operation result identical to the first operation result, it is explained that the first expression corresponding to the second operation result identical to the first operation result is equivalent to the target expression. Therefore, at this time, it is determined that there is the first expression equivalent to the target expression.

In some embodiments, obtaining the associated data set corresponding to each first factor includes: and selecting a first set group from a preset set group according to a preset rule, wherein the first set group comprises associated data sets, and the associated data sets are in one-to-one correspondence with the first factors. Correspondingly, obtaining a second operation result corresponding to the preset first expression, including: and calculating a preset first expression according to the first set group to obtain a second operation result corresponding to the preset first expression.

In this embodiment, the data sets included in each preset set group may be the same, and at this time, the arrangement order of the data sets in each preset set group is different. And after the data sets are set, arranging and combining the data sets to obtain each preset set group. It should be understood that the data sets contained in the respective predetermined set groups may also be different.

And selecting a first set group from a preset set group according to a preset rule. The first set group comprises associated data sets, and the associated data sets are in one-to-one correspondence with the first factors. For example, the first set of values is (a, b, C), the first factor is A, B and C. The one-to-one relationship between the associated data sets and the first factors may be: the associated data set a is associated with a first factor a, the associated data set B is associated with a first factor B, and the associated data set C is associated with a first factor C. Alternatively, the related data set a may be associated with the first factor B, the related data set B may be associated with the first factor C, and the related data set C may be associated with the first factor a. The one-to-one correspondence relationship between the associated data set and the first factor may be selected according to actual needs, and the present application is not specifically limited herein.

And after the first set group is selected, calculating a preset first expression according to the first set group to obtain a second operation result corresponding to the preset first expression.

In other embodiments, determining that there is a first expression equivalent to the target expression if there is a second operation result that is the same as the first operation result includes: and if a second operation result identical to the first operation result exists and unselected set groups exist in the preset set groups, determining an expression corresponding to the second operation result identical to the first operation result as a new first expression, selecting the new first set group from the unselected set groups according to a preset rule, and returning to execute the operation of the target expression according to each associated data set. And if a second operation result identical to the first operation result exists and unselected set groups do not exist in the preset set groups, judging that a first expression equivalent to the target expression exists.

In this embodiment, the target expression and the preset first expression may be operated multiple times, and then whether the first expression equivalent to the target expression exists is determined according to the result of each operation, so as to more accurately determine whether the expression equivalent to the target expression exists.

And if the unselected set group exists, determining an expression corresponding to a second operation result which is the same as the first operation result as a new first expression. And determining the expression corresponding to the second operation result which is the same as the first operation result as a new first expression, namely screening the expression corresponding to the second operation result which is different from the first operation result, thereby reducing the calculation amount of the next operation on the first expression. And then selecting a new first set group from the unselected set groups according to a preset rule, and finally returning to execute the operation of the target expression according to each associated data set.

And if a second operation result identical to the first operation result exists and unselected set groups do not exist in the preset set groups, judging that a first expression equivalent to the target expression exists.

It should be noted that the data sets included in the unselected set group and the data sets included in the selected set group may be the same, and in this case, the data sets are arranged in different orders in the unselected set group and the selected set group. Alternatively, the data sets included in the unselected set group and the data sets included in the selected set group may be different.

When the data sets included in the unselected set group are the same as the data sets included in the selected set group, the one-to-one correspondence relationship between the associated data sets in the first set group and the first factor may be set as: the associated data sets at the same position in the first set group correspond to the same first factor. At this time, even if the associated data sets included in the respective first set groups are the same, the associated data sets corresponding to the same first factor are different each time due to different arrangement orders of the associated data sets in the respective first set groups, that is, different positions of the associated data sets in the respective first set groups.

For example, the first factor is A, B and C. Associated data sets a, b and c are set. The associated data set at a first position in the first set group is set to correspond to a first factor a, the associated data set at a second position in the first set group is set to correspond to a first factor B, and the associated data set at a third position in the first set group is set to correspond to a first factor C. When the first set group is (a, B, C), the associated data set a corresponds to a first factor a, the associated data set B corresponds to a first factor B, and the associated data set C corresponds to a third factor C. When the first set group is (B, a, C), the associated data set B corresponds to the first factor a, the associated data set a corresponds to the first factor B, and the associated data set C corresponds to the third factor C.

Therefore, in this embodiment, when multiple operations need to be performed on the target expression and the preset first expression, and the number of the associated data sets is limited, each preset set group may be obtained by performing permutation and combination on the associated data sets, then the first set group is selected from each preset set group, and then the associated data sets at the same position in the first set group are set to correspond to the same first factor, so that multiple operations on the target expression and the preset first expression are realized.

Therefore, in the present embodiment, it may be arranged that the target expression and the preset first expression are operated according to the plurality of first set groups. And when the first operation result and the second operation result obtained according to each first set group are the same and unselected set groups exist in the preset set groups, determining an expression corresponding to the second operation result which is the same as the first operation result as a new first expression, selecting the new first set group from the unselected set groups according to a preset rule, and returning to execute the operation on the target expression according to each associated data set.

And when the first operation result and the second operation result obtained according to each first set group are the same and the unselected set group does not exist in the preset set group, judging that the first expression equivalent to the target expression exists. I.e. it is equivalent to traverse the target expression and the preset first expression through a plurality of first set groups. And when the result of each traversal is the same and no un-traversed first set group exists, judging that a first expression equivalent to the target expression exists. Therefore, in the embodiment, the target expression and the preset first expression may be operated for multiple times, and whether the first expression equivalent to the target expression exists is determined according to the result of each operation, so as to determine whether the expression equivalent to the target expression exists more accurately.

In other embodiments, before obtaining the second operation result corresponding to the preset first expression, the method includes: screening an expression comprising a first factor from preset expressions to obtain a second expression; acquiring a first type quantity of a first factor in a target expression and acquiring a second type quantity of a second factor in a second expression, wherein the second factor is a factor included in the second expression; and determining a second expression corresponding to the second type number consistent with the first type number as a preset first expression.

In this embodiment, before a second operation result corresponding to a preset first expression is obtained, an expression including a first factor is screened from the preset expression, so as to obtain a second expression. It should be noted that, when the preset expression includes the first factor, the expression including the first factor may be directly screened from the preset expression to obtain the second expression. When the preset expression does not comprise the first factor, the object represented by the first factor is analyzed, and then the expression comprising the object represented by the first factor is screened out from the preset expression, so that a second expression is obtained.

After the second expression is obtained, the first type number of the first factor in the target expression is obtained. For example, if the target expression is (A @ B) @ C, the first type number of the first factor in the target expression is A, B and C. And acquiring a second type number of a second factor in the second expression, wherein the second factor is a factor included in the second expression. For example, the second expression is (A ≧ C ≧ D) U (A ≦ B ≦ D), and the second type number of the second factor in the second expression is A, B, C and D. And then determining a second expression corresponding to a second type number consistent with the first type number as a preset first expression. For example, the target expression is (a ≧ B) # C, the second expression is (a ≧ C) # D (a ≧ B # D) and (a ≧ C) # C (B ≧ C), the second expression (a ≧ C) is the second-type number A, B of the second expression (B ≧ C) and C is the same as the first-type data amount A, B and C of the target expression (a ≧ B) # C, the second expression (a ≧ C) # C (B ≧ C) is determined as the preset first expression.

Therefore, in the application, before a second operation result corresponding to a preset first expression is obtained, the preset expression is screened, so that the preset first expression comprises the same factors and the same type number of the factors as those of the target expression, and the operation amount of the preset first expression is reduced.

In other embodiments, obtaining the target expression includes: obtaining an initial expression; and mapping the initial factors in the initial expression into corresponding first factors according to a preset mapping rule to obtain a target expression.

In this embodiment, the same object may be represented by the same type of factor, thereby facilitating the operation. I.e. replacing the factors in the target expression by preset factors. Therefore, after the initial expression is acquired, the object represented by the factor in the initial expression is analyzed, and then the preset factor type of the object is checked. If the factor type in the initial expression is different from the preset factor type, mapping the initial factor in the initial expression to a corresponding first factor according to a preset mapping rule, wherein the first factor is the preset factor type, and thus obtaining the target expression. It should be noted that the preset factor type may also be modified to the factor type in the target expression. The user can select the method of making the factor types representing the same object the same according to actual requirements as long as the factor types representing the same object are the same, and the application is not limited in detail herein.

In other embodiments, after determining that there is a first expression equivalent to the target expression, comprising: and executing preset prompting operation. In this embodiment, after determining that there is the first expression equivalent to the target expression, the terminal device may perform a preset prompting operation to notify the user that there is the first expression equivalent to the target expression, and use the first expression equivalent to the target expression.

Therefore, in this embodiment, when the target expression is obtained, the terminal device may identify whether the target expression is equivalent to the preset first expression, and if the target expression is equivalent to the preset first expression, the terminal device executes a preset prompt operation to notify the user that the first expression equivalent to the target expression exists, and uses the first expression equivalent to the target expression.

In other embodiments, the present application further comprises: and if the second operation result identical to the first operation result does not exist, storing the target expression into the database. In the present embodiment, if there is no second operation result that is the same as the first operation result, it is determined that there is no first expression equivalent to the target expression, and the target expression is stored in the database.

That is, in the embodiment, the target expression is stored in the database only in the case that there is no first expression equivalent to the target expression, so that there is no inequivalence between any two expressions in the database, thereby reducing the data amount of the expressions in the database and further reducing the complexity of the system.

In summary, the present application provides an equivalent expression identification method, which includes first obtaining a target expression, where the target expression includes a first factor. And then acquiring the associated data sets corresponding to the first factors. And then, operating the target expression according to each associated data set to obtain a first operation result. And then acquiring a second operation result corresponding to the preset first expression. If there is a second operation result identical to the first operation result, it is determined that there is a first expression equivalent to the target expression. In other words, in the application, the target expression is operated according to each associated data set to obtain a first operation result, and then whether a first expression equivalent to the target expression exists is judged according to whether the first operation result is the same as a second operation result corresponding to a preset first expression. Therefore, in the present application, it is possible to identify whether the two expressions are equivalent.

It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.

Example two

Fig. 2 shows an example of an equivalent expression identifying apparatus, and for convenience of explanation, only the portions related to the embodiments of the present application are shown. The apparatus 200 comprises:

the expression obtaining module 201 is configured to obtain a target expression, where the target expression includes a first factor.

A data set obtaining module 202, configured to obtain associated data sets corresponding to the first factors.

The first operation module 203 is configured to perform an operation on the target expression according to each associated data set to obtain a first operation result.

The second operation result obtaining module 204 is configured to obtain a second operation result corresponding to the preset first expression.

And a decision module 205 for deciding that there is a first expression equivalent to the target expression if there is a second operation result identical to the first operation result.

Optionally, the data set obtaining module 202 is configured to perform:

and selecting a first set group from a preset set group according to a preset rule, wherein the first set group comprises associated data sets, and the associated data sets are in one-to-one correspondence with the first factors.

Accordingly, the second operation result obtaining module 204 is configured to perform:

and calculating a preset first expression according to the first set group to obtain a second operation result corresponding to the preset first expression.

Optionally, the decision module 205 is configured to perform:

and if a second operation result identical to the first operation result exists and unselected set groups exist in the preset set groups, determining an expression corresponding to the second operation result identical to the first operation result as a new first expression, selecting the new first set group from the unselected set groups according to a preset rule, and returning to execute the operation of the target expression according to each associated data set.

Optionally, the apparatus 200 further comprises:

and the screening module is used for screening the expression comprising the first factor from the preset expressions to obtain a second expression.

The type quantity obtaining module is used for obtaining a first type quantity of a first factor in the target expression and obtaining a second type quantity of a second factor in the second expression, and the second factor is a factor included in the second expression.

And the preset first expression determining module is used for determining the second expressions corresponding to the second type quantity consistent with the first type quantity as the preset first expressions.

Optionally, the expression obtaining module 201 includes:

and the acquisition unit is used for acquiring the initial expression.

And the mapping unit is used for mapping the initial factors in the initial expression into corresponding first factors according to a preset mapping rule to obtain the target expression.

Optionally, the apparatus 200 further comprises:

and the prompt module is used for executing preset prompt operation.

Optionally, the apparatus 200 further comprises:

and the storage module is used for storing the target expression into the database if a second operation result identical to the first operation result does not exist.

It should be noted that, for the information interaction, execution process, and other contents between the above-mentioned devices/units, the specific functions and technical effects thereof are based on the same concept as those of the method embodiment of the present application, and specific reference may be made to a part of the method embodiment, which is not described herein again.

EXAMPLE III

Fig. 3 is a schematic diagram of a terminal device provided in the third embodiment of the present application. As shown in fig. 3, the terminal device 300 of this embodiment includes: a processor 301, a memory 302, and a computer program 303 stored in the memory 302 and operable on the processor 301. The processor 301 implements the steps of the above-described method embodiments when executing the computer program 303. Alternatively, the processor 301 implements the functions of the modules/units in the device embodiments when executing the computer program 303.

Illustratively, the computer program 303 may be divided into one or more modules/units, which are stored in the memory 302 and executed by the processor 301 to complete the present application. The one or more modules/units may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution process of the computer program 303 in the terminal device 300. For example, the computer program 303 may be divided into an expression obtaining module, a data set obtaining module, a first operation module, a second operation result obtaining module, and a determination module, where the specific functions of the modules are as follows:

acquiring a relevant data set corresponding to each first factor;

acquiring a second operation result corresponding to a preset first expression;

and if a second operation result identical to the first operation result exists, judging that a first expression equivalent to the target expression exists.

The terminal device may include, but is not limited to, a processor 301 and a memory 302. Those skilled in the art will appreciate that fig. 3 is merely an example of the terminal device 300 and does not constitute a limitation of the terminal device 300 and may include more or less components than those shown, or combine certain components, or different components, for example, the terminal device may further include input and output devices, network access devices, buses, etc.

The Processor 301 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware card, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

The storage 302 may be an internal storage unit of the terminal device 300, such as a hard disk or a memory of the terminal device 300. The memory 302 may also be an external storage device of the terminal device 300, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are provided on the terminal device 300. Further, the memory 302 may include both an internal storage unit and an external storage device of the terminal device 300. The memory 302 is used for storing the computer programs and other programs and data required by the terminal device. The memory 302 may also be used to temporarily store data that has been output or is to be output.

It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned functions may be distributed as different functional units and modules according to needs, that is, the internal structure of the apparatus may be divided into different functional units or modules to implement all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus/terminal device and method may be implemented in other ways. For example, the above-described embodiments of the apparatus/terminal device are merely illustrative, and for example, the division of the above modules or units is only one logical function division, and there may be other division manners in actual implementation, for example, a plurality of units or plug-ins may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The integrated modules/units described above, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, all or part of the processes in the above method embodiments may be implemented by a computer program, which may be stored in a computer readable storage medium and executed by a processor, so as to implement the steps of the above method embodiments. The computer program includes computer program code, and the computer program code may be in a source code form, an object code form, an executable file or some intermediate form. The computer readable medium may include: any entity or device capable of carrying the above-mentioned computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signal, telecommunication signal, software distribution medium, etc. It should be noted that the computer readable medium described above may include content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media that does not include electrical carrier signals and telecommunications signals in accordance with legislation and patent practice.

The above embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.

Claims

1. An equivalent expression recognition method, comprising:

acquiring a relevant data set corresponding to each first factor;

acquiring a second operation result corresponding to a preset first expression;

2. The equivalent expression recognition method according to claim 1, wherein the obtaining of the associated data set corresponding to each of the first factors includes:

selecting a first set group from a preset set group according to a preset rule, wherein the first set group comprises associated data sets, and the associated data sets are in one-to-one correspondence with the first factors;

correspondingly, the obtaining of the second operation result corresponding to the preset first expression includes:

3. The equivalent expression identifying method according to claim 2, wherein the determining that there is a first expression equivalent to the target expression if there is a second operation result identical to the first operation result includes:

if a second operation result identical to the first operation result exists and an unselected set group exists in the preset set group, determining an expression corresponding to the second operation result identical to the first operation result as a new first expression, selecting a new first set group from the unselected set group according to a preset rule, and returning to execute the operation of the target expression according to each associated data set;

and if a second operation result identical to the first operation result exists and the unselected set group does not exist in the preset set group, judging that a first expression equivalent to the target expression exists.

4. The equivalent expression recognition method according to claim 1, wherein before the obtaining of the second operation result corresponding to the preset first expression, the method includes:

screening an expression comprising the first factor from preset expressions to obtain a second expression;

acquiring a first type quantity of a first factor in the target expression and a second type quantity of a second factor in the second expression, wherein the second factor is a factor included in the second expression;

and determining a second expression corresponding to the second type number consistent with the first type number as a preset first expression.

5. The equivalent expression recognition method of claim 1, wherein the obtaining a target expression comprises:

obtaining an initial expression;

and mapping the initial factors in the initial expression into corresponding first factors according to a preset mapping rule to obtain a target expression.

6. The equivalent expression recognition method according to claim 1, wherein after the determining that there is the first expression equivalent to the target expression, includes:

and executing preset prompting operation.

7. The equivalent expression recognition method according to claim 1, further comprising:

and if the second operation result which is the same as the first operation result does not exist, storing the target expression into a database.

8. An equivalent expression recognition apparatus, comprising:

a data set obtaining module, configured to obtain a relevant data set corresponding to each first factor;

9. A terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1-7 when executing the computer program.

10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-7.