CN117131934A - Question solving method, question solving engine, electronic equipment and storage medium - Google Patents
Question solving method, question solving engine, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN117131934A CN117131934A CN202311371884.7A CN202311371884A CN117131934A CN 117131934 A CN117131934 A CN 117131934A CN 202311371884 A CN202311371884 A CN 202311371884A CN 117131934 A CN117131934 A CN 117131934A
- Authority
- CN
- China
- Prior art keywords
- content
- questions
- list
- solving
- original image
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 230000008569 process Effects 0.000 claims description 24
- 238000012545 processing Methods 0.000 claims description 20
- 238000004590 computer program Methods 0.000 claims description 10
- 238000006243 chemical reaction Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 23
- 239000004816 latex Substances 0.000 description 21
- 238000004364 calculation method Methods 0.000 description 13
- 230000006870 function Effects 0.000 description 8
- 241000282414 Homo sapiens Species 0.000 description 4
- 230000009471 action Effects 0.000 description 4
- 230000014509 gene expression Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000009467 reduction Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000010365 information processing Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 101000822695 Clostridium perfringens (strain 13 / Type A) Small, acid-soluble spore protein C1 Proteins 0.000 description 1
- 101000655262 Clostridium perfringens (strain 13 / Type A) Small, acid-soluble spore protein C2 Proteins 0.000 description 1
- 241000699670 Mus sp. Species 0.000 description 1
- 101000655256 Paraclostridium bifermentans Small, acid-soluble spore protein alpha Proteins 0.000 description 1
- 101000655264 Paraclostridium bifermentans Small, acid-soluble spore protein beta Proteins 0.000 description 1
- 241000590419 Polygonia interrogationis Species 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001502 supplementing effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/02—Knowledge representation; Symbolic representation
- G06N5/022—Knowledge engineering; Knowledge acquisition
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V30/00—Character recognition; Recognising digital ink; Document-oriented image-based pattern recognition
- G06V30/40—Document-oriented image-based pattern recognition
- G06V30/41—Analysis of document content
Abstract
The application discloses a problem solving method, a problem solving engine, electronic equipment and a storage medium, wherein the method and the engine are applied to the electronic equipment, and particularly, the method and the engine are used for receiving an original image which is input by a user and bears problem contents; analyzing the problem content to obtain a content list contained in the problem content; and solving the questions aiming at the content list to obtain and output answers to the questions. According to the scheme, the answer is obtained by analyzing the questions, and the answers of the questions are fed back to the user, so that the questions can be solved and fed back for any questions.
Description
Technical Field
The present application relates to the technical field of science and education, and more particularly, to a problem solving method, a problem solving engine, an electronic device, and a storage medium.
Background
With the popularization of intelligent devices and the improvement of learning requirements of people, learning requirements based on electronic devices are increasing, namely, solving steps and results are given based on topics input by users. However, the current calculation engine realizes feedback to the user based on preset answers, and can not realize problem solving feedback aiming at any problem.
Disclosure of Invention
In view of the above, the present application provides a problem solving method, a problem solving engine, an electronic device, and a storage medium for providing problem solving feedback based on an arbitrary problem inputted by a user.
In order to achieve the above object, the following solutions have been proposed:
the problem solving method is applied to the electronic equipment and comprises the following steps:
receiving an original image carrying problematic content input by a user;
analyzing the problem content to obtain a content list contained in the problem content;
and solving the questions aiming at the content list to obtain and output answers to the questions.
Optionally, the receiving the original image input by the user, where the original image carries the problem content, includes the steps of:
acquiring the original image;
and carrying out character recognition processing on the original image to obtain the problem content.
Optionally, the analyzing the problem content to obtain a content list contained in the problem content includes the steps of:
analyzing the problem content into a node list;
and analyzing the node list into the content list according to a preset grammar rule, a preset operation sequence and a preset input mode, wherein the content list is in a structure tree form.
Optionally, the solving the problem with respect to the content list to obtain and output a problem answer includes the steps of:
converting the content list into an operand, wherein the operand is a tree structure formed by a plurality of number nodes;
and processing the plurality of digital nodes to obtain the answers to the questions, and sending the answers to the questions to the user.
A solution engine for use in an electronic device, the solution engine comprising:
the information receiving module is configured to receive an original image carrying problematic content input by a user;
the mathematical analyzer is configured to analyze the problem content to obtain a content list contained in the problem content;
and the mathematic question-solving device is configured to solve the questions aiming at the content list to obtain and output answers to the questions.
Optionally, the information receiving module includes:
an image acquisition unit configured to acquire the original image;
and the content recognition unit is configured to perform character recognition processing on the original image to obtain the problem content.
Optionally, the mathematical parser includes:
a first parsing unit configured to parse the problem contents into a node list;
the second analyzing unit is configured to analyze the node list into the content list according to a preset grammar rule, a preset operation sequence and a preset input mode, and the content list is in a structure tree form.
Optionally, the mathematical problem solver includes:
a list conversion unit configured to convert the content list into an operand which is a tree structure composed of a plurality of number nodes;
and the node processing unit is configured to process the plurality of digital nodes to obtain the answers to the questions and send the answers to the questions to the user.
An electronic device comprising at least one processor and a memory coupled to the processor, wherein:
the memory is used for storing a computer program or instructions;
the processor is configured to execute the computer program or instructions to cause the electronic device to implement the problem solving method as described above.
A storage medium applied to an electronic device, the storage medium carrying one or more computer programs executable by the electronic device to cause the electronic device to implement a problem solving method as described above.
From the above technical solution, the present application discloses a problem solving method, a problem solving engine, an electronic device and a storage medium, wherein the method and the engine are applied to the electronic device, in particular to receiving an original image carrying problem contents input by a user; analyzing the problem content to obtain a content list contained in the problem content; and solving the questions aiming at the content list to obtain and output answers to the questions. According to the scheme, the answer is obtained by analyzing the questions, and the answers of the questions are fed back to the user, so that the questions can be solved and fed back for any questions.
Drawings
In order to more clearly illustrate the embodiments of the application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a method for solving a problem according to an embodiment of the present application;
FIG. 2a is a schematic diagram of parsing all keywords in LaTex in a flow chart of a child node searching a pre-keyword according to an embodiment of the present application;
FIG. 2b is a schematic diagram of a sub-node searching for a pre-keyword in a flowchart of a sub-node searching for a pre-keyword according to an embodiment of the present application;
FIG. 2c is a schematic diagram of text description keywords processed in a flow chart of a child node searching for a pre-keyword according to an embodiment of the present application;
FIG. 2d is a schematic diagram of processing upper and lower keywords in a flowchart of searching a child node with a central keyword according to an embodiment of the present application;
FIG. 2e is a schematic diagram of absolute value and bracket processing in a flowchart of a sub-node searching for a center keyword according to an embodiment of the present application;
FIG. 2f is a flowchart of a sub-node searching for a center keyword according to an embodiment of the present application;
FIG. 3a is a schematic diagram of sequential calculation from bottom to top in solving a problem of a content list according to an embodiment of the present application;
FIG. 3b is a schematic diagram of a calculation 2^3 in solving a problem on a content list according to an embodiment of the present application;
FIG. 3c is a schematic diagram of a calculation 1+5 in solving the problem of the content list according to an embodiment of the present application;
FIG. 3d is a schematic diagram of calculating 3_times6 in solving the problem of the content list in the embodiment of the application;
FIG. 3e is a diagram illustrating a calculation of frac {6} {2} by performing a solution process on a content list according to an embodiment of the present application;
FIG. 3f is a schematic diagram of 18+3 and removing unwanted brackets in solving the problem of the content list according to the embodiment of the present application;
FIG. 3g is a diagram of a calculation, log … {2}4, of solving a problem on a content list in an embodiment of the present application;
FIG. 3h is a schematic diagram illustrating an example of an operation according to an embodiment of the present application;
FIG. 4 is a block diagram of a solution engine according to an embodiment of the present application;
fig. 5 is a block diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
Example 1
Fig. 1 is a flowchart of a problem solving method according to an embodiment of the present application.
As shown in fig. 1, the present embodiment provides a problem solving method applied to an electronic device for outputting an answer based on a problem input by a user, where the electronic device may be understood as a computing device such as a computer, a server, an intelligent terminal, etc. having information processing capability and data computing capability, and the problem solving method specifically includes the following steps:
s1, receiving an original image carrying problematic content input by a user.
When the user collects the corresponding problem content by using the scanning equipment or the intelligent terminal, the original image carrying the problem content, which is obtained by the corresponding equipment, is received. The specific process is as follows:
first, an original image acquired by the above-described apparatus is acquired.
Then, the original image is subjected to recognition processing by a recognition tool, such as an OCR tool, etc., from which problem contents in a preset format, such as LaTex character strings, are obtained.
S2, analyzing and processing the problem content.
The main means is to analyze and process the problem content based on the preset grammar rule, the preset operation sequence and the preset input mode, so as to obtain a content list. The preset grammar rule may be a LaTex grammar rule, the preset operation sequence may be a pemas operation sequence, and the preset input mode may be a special question type input mode. Specifically, the parsing process is as follows.
First, the problem content is parsed into a node list. Specifically, the LaTex character is first parsed into a LaTex node list.
Then, the LaTex node list is analyzed to be a structural tree of golang, wherein the structural tree comprises keywords, various non-keywords and a child node list, so that the program/algorithm can recognize and operate conveniently.
When the analysis is implemented, all keywords in the LaTex node list are analyzed first, and the keywords commonly used in LaTex files in mathematical topics mainly comprise keywords such as plus signs, minus signs, slash signs and the like. Wherein, the slash key word is formed by starting with 'and then all adjacent letters, and any non-letter is used as a stop mark, such as numbers, spaces or'.
The keyword node comprises two parts, a keyword and a child node. The keywords are divided into a front keyword and a middle keyword according to the relative position relation between the keywords and the child nodes, wherein the keywords are positioned in front of the child nodes and are called front keywords, and the keywords are positioned in the middle of the child nodes and are called middle keywords. Such as \frac {3} {4}, the child nodes of the keyword \frac } ' are only present behind the keyword, for example, ' 2\times3 ', the keyword ' times ' is located in the middle of the child nodes ' 2 ' and ' 3 '.
After parsing the keywords, the next is to find all child nodes of the pre-keyword nodes, as shown in fig. 2 a-2 c. The number of different keyword children nodes is different, for example, the keyword 'frac', which needs two children nodes, one as a molecule and one as a denominator, and 'sin' has only one child node. The number of child nodes of a part of the keywords is also variable, for example, '\sqrt'. Can be two child nodes, the first is the index of the opening party, the second is the base of the opening party, but the index can be omitted, and the default is 2 when the index is omitted.
The front keyword node is provided with a keyword for text description, such as ' text { solve the equation } ', which is used for inserting some text description in a formula, and for mathematical formula questions, there is usually no practical meaning for solving the questions, so that we only need to replace the special cases of ' text { and } ', text { or } ', etc., with the keywords of non-text description types of ' cap ', ' cup ', etc., and the information of the node is discarded under the rest conditions. When a user takes a picture, he or she can take some interference information, such as question marks, unintentionally, and discard the interference information, so that the difficulty of taking a picture of the user can be reduced.
The processing of superscript (, subscript (_) is followed, and the mathematical commonly used superscript is in several cases, the superscript is used as the index of the previous node, the unknown index represents different unknowns, and the child node marks of the special node, such as \log\4 } {5 }'. In addition, the subject taken may be less than neat, such as the user taking a photograph that is actually '1 + 2', however, due to question typesetting, the plus sign position is too upper, in fact, the result of LaTex analysis is '1 { + } 2', it conforms to LaTex grammar rules, but does not have correct mathematical meaning, and when similar conditions are found, the sign of the index is reduced to '1+2'.
The absolute value is then processed with brackets, and the absolute value is exhausted because the absolute value cannot distinguish the left and right of the symbol, so that the analyzer finds the most possible combination mode, then the left and right matching of the brackets is carried out, and the brackets or the nodes inside the absolute value are used as the child nodes of the operator.
Finally, searching the child nodes with the key word nodes in the middle, specifically, as shown in fig. 2 d-2 f, comparing the key words (=, "geq"), multiplication and division keywords ('\times', 'div', 'or', 'plus or minus keywords'. The LaTex node list changes from the first long list to a tree structure of length 1.
S3, solving questions aiming at the content list to obtain answers to the questions.
In a specific process, a structure tree is generated on the basis of the tree structure, and the steps are calculated and recorded sequentially from bottom to top, as shown in fig. 3 a-3 g.
First, the above-described structure tree is converted into a computation tree, which is a tree structure composed of a large number of number nodes, the structure of the tree nodes including an operator, a child node list, and a base type of numerical operation. Wherein the operator corresponds to a keyword of the LaTex node.
The basic type of the numerical operation is used for representing the calculation result of the current tree, and comprises various types of numbers, a single expression formed by the numbers and unknown numbers, a polynomial formed by adding a plurality of single expressions, a partial expression formed by the molecular denominator of any basic type, and the like. After LaTex analysis is completed, most of numbers are directly converted into corresponding CalrulateOne. In the process of calculation, after the calculation of a certain tree is completed, the calculated result is updated to the point so as to be used later.
The tree nodes are divided into a single node and an operation node. The single node has a calcutateone basic type, has no child node, and is a node which is already calculated by the single node. The operation node is a node which is not yet completed in calculation, has no calcluateone basic type, is composed of operators and sub-nodes, the operators comprise conventional mathematical operators such as an addition number, a subtraction number, a multiplication number, a divisor number, an equal number, an inequality number, a logical AND or, a limit operator, an integral operator, a summation operator and the like, and the number of the sub-nodes is different according to the operators. The child node may be a single node or another operation node.
Then, a problem solving process is implemented based on the computation tree, and the process is actually a process of simplifying the complex operation nodes into single nodes, and finally, a problem answer is obtained through simplifying the nodes. For equality or inequality, the equations on the left and right sides are simplified to the simplest, the type of the equality or inequality is convenient to judge, the problem solving step is optimized, and the multiple solution is realized. For the equation set, each equation is simplified, the number of unknown numbers and the condition of indexes of the equation set are determined conveniently, and therefore the optimal problem solving method is selected. For other problems, the process of simplifying is actually the process of calculating the result, wherein fig. 3h provides a schematic diagram of an operation example.
The process for tree node reduction may be abstracted as a function, such as step (process for logging reduction), operation (operation to be performed), child list (child node list), etc., where the child nodes in the list must be single nodes, i.e., calculteone must have a value. The child list can be further replaced with calculeonelist. The advantage of this is that the solver can automatically generate the method that it encounters various different types of calculteone input combinations according to traversing the calculteone supported by the current operator, and no omission is generated.
For example, when performing addition of more than 2 calculteones, except for the case that some values are added first by a part of the operation rule, the two values may be added in order from left to right, so only addition of two calculteones needs to be considered. The following is the addition CalrulateOne that needs to be supported:
the number types include:
numberinterface mini: the minimum type of number "3".
Numberinterface efrac: the number of fractional form \frac {2} {3 }'.
NumberInterfaceradio: the number containing the root form \sqrt {3 }.
Numberinterface add: the number of the addition of the multiple number types calculteone } +2 'is \sqrt {3} +2'.
NumberInterfaceStecincialConstant: a special constant \pi'.
NumberInterfaceLog number containing log \log_ {2} 3'.
Numberinterface eFlot: high precision floating point form error reported decimal 3.141592653 …'.
Number InterfaceImageInaRyNumber: imaginary number '3+2i'.
Numberinterface axb: the method comprises the steps of constant term, base term, index term and the number '2\times 3 {5 }'.
Numberintersurface elementary ificnotion: the number of scientific counting method is' 3\times 10 {4 }.
Numberinterface einfty: plus or minus infinity.
Number interface Multi a number of the number type CalrulateOne multiplied by 'pi (1+e').
Non-numeric types include:
node is a single item formula '2x2', '3x3y2', and '4' composed of constant items and unknown number list.
Polynomials 'x+1' composed of Node lists.
Logarithm } 'contains log \log { x+1 }' of unknowns.
TrigonometricFunc: trigonometric functions containing unknowns, '\sin (x').
Calculone radial: the root formula structure containing unknowns \sqrt { x+2 }'.
calculeOneAdd: the multiple calculeones add up 'x + \sqrt { x+2 }'.
calculeOneMulti: the multiple calculeone multiplies by 'x\sqrt { x+2 }'.
calculeOneAbs: the absolute value of the unknowns is included 'x+1'.
calculeOneAXB: there are constant terms, base terms, exponent terms and base terms containing the unknowns '2 (x+1) {3 }'.
calculeOneAXC: there are constant terms, base terms, exponent terms and exponent terms containing the unknowns' 3 { x+1 }.
Calculolematrix: a matrix.
Calculeonefrac: the numerator of calculeOne and the denominator of calculeOne constitute the fraction \frac { x+1} { x-1 }'.
The following problems are encountered when implementing addition logic:
because of the need to provide solution ideas and detailed steps similar to those of human beings, even simple addition is required, the solution ideas and steps are customized according to the types of two calculteone, a large number of methods are required to be realized, and the human beings are difficult to ensure not to miss.
When Frac and Mini are added, the order of the Frac and Mini is exchanged, the problem solving logic must be completely consistent, and the generating step cannot be directly used. Otherwise, the steps of \frac {1} {2} +2 ' are normal, and the steps of \2 \frac {1} {2} ' are changed into meaningless steps of \frac {1} {2} +2 '.
Because of the wide range of users, it may be necessary to have some two types of inputs go through special logic for different topics, and other inputs remain consistent with the underlying addition. For example, when the reduction logic is realized by multiplying two polynomials, we can multiply the polynomials by two to obtain the final result. When the factorization logic is realized, the form of multiplication of two polynomials is reserved, namely (x+1) (x-1) + (x+1) (x+2), so that the term x+1 can be directly extracted, and the 'x-1+x+2' can be combined, thereby leading our solution thinking to be more similar to human beings.
The operations here automatically generate the code framework of the supported calculteone. The developer only needs to fill the implemented logic for each computing method according to predefined rules. This approach can avoid missing any implementation of the calculeone method, while also facilitating the addition of new calculeone, as it will automatically detect, supplementing the new calculeone implementation that is missing in the old method. The whole process is fully automatic, and the realization of codes is simplified.
For the characteristic that a plurality of operations can exchange parameter positions, sort configuration is added, after configuration, only one function Frac+Mini is needed to be realized, mini+Frac can automatically call the logic of Frac+Mini and correct steps to be in the correct sequence, and meaningless position exchange is avoided.
In addition, the result of the output code generation is a Context object (the Context object is used to store all the sub-methods of the generated code in this way, the generator code can be made more clear and modular), the logic of the custom part sub-method can be customized by adding additional configuration, and the functions of the original Context object are not affected. This flexible design allows the user to achieve the personalized needs by modifying the corresponding configuration without having to re-write the entire code.
Since the above-mentioned simplification concept requires that the child node must be a single node, the computing node must be changed from top to bottom to be a single node before he can participate in the parent node's computation. However, in some cases, the steps will appear dead, so that the rule of operation rules from top to bottom can be adopted to check whether a tree structure conforming to some operation rule features exists, and the structure is adjusted so that the operation steps are closer to human beings.
As can be seen from the above technical solution, the present embodiment provides a problem solving method, which is applied to an electronic device, and specifically receives an original image carrying problem contents input by a user; analyzing the problem content to obtain a content list contained in the problem content; and solving the questions aiming at the content list to obtain and output answers to the questions. According to the scheme, the answer is obtained by analyzing the questions, and the answers of the questions are fed back to the user, so that the questions can be solved and fed back for any questions.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Although operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. In certain circumstances, multitasking and parallel processing may be advantageous.
It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order and/or performed in parallel. Furthermore, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.
Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including, but not limited to, an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the C-language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of remote computers, the remote computer may be connected to the user computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer.
Example two
FIG. 4 is a block diagram of a solution engine according to an embodiment of the present application.
As shown in fig. 4, the present embodiment provides a solution engine applied to an electronic device for outputting an answer based on a question inputted by a user, which can be understood as a computing device such as a computer, a server, an intelligent terminal, etc. having information processing capability and data computing capability, and specifically includes an information receiving module 10, a mathematical parser 20, and a mathematical solution 30.
The information receiving module is used for receiving an original image carrying problematic content input by a user.
The method is used for receiving the original image carrying the problem content acquired by the corresponding equipment when the user acquires the corresponding problem content by using the scanning equipment or the intelligent terminal. The module specifically comprises an image acquisition unit and a content identification unit.
The image acquisition unit is used for acquiring the original image acquired by the equipment.
The content recognition unit is used for performing recognition processing on the original image by using a recognition tool, such as an OCR tool and the like, and acquiring problem content in a preset format, such as LaTex character strings.
The mathematical parser is used for parsing the problem content.
The main means is to analyze and process the problem content based on the preset grammar rule, the preset operation sequence and the preset input mode, so as to obtain a content list. The preset grammar rule may be a LaTex grammar rule, the preset operation sequence may be a pemas operation sequence, and the preset input mode may be a special question type input mode. The parser specifically includes a first parsing unit and a second parsing unit.
The first parsing unit is used for parsing the problem content into a node list. Specifically, the LaTex character is first parsed into a LaTex node list.
The second parsing unit is used for parsing the LaTex node list into a structural tree of golang, wherein the structural tree comprises various keywords, non-keywords and child node lists, so that the program can recognize and operate conveniently. When the analysis is implemented, all keywords in the LaTex node list are analyzed first, and the keywords commonly used in LaTex files in mathematical topics mainly comprise keywords such as plus signs, minus signs, slash signs and the like. Wherein, the slash key word is formed by starting with 'and then all adjacent letters, and any non-letter is used as a stop mark, such as numbers, spaces or'.
The mathematic solving device is used for solving the problems aiming at the content list to obtain the answers of the problems.
During specific processing, a structure tree is generated on the basis of the tree structure, the structure tree is calculated sequentially from bottom to top, and the steps are recorded, and the mathematical problem solving device comprises a list conversion unit and a node processing unit.
The list conversion unit is used for converting the structure tree into a calculation tree, wherein the calculation tree is a tree structure formed by a plurality of number nodes, and the structure of the tree nodes comprises an operator, a child node list and basic types of numerical operation. Wherein the operator corresponds to a keyword of the LaTex node.
The node processing unit is used for implementing a problem solving process based on the computation tree, and the process is actually a process of simplifying complex operation nodes into single nodes, and finally obtaining a problem answer through simplifying the nodes. For equality or inequality, the equations on the left and right sides are simplified to the simplest, the type of the equality or inequality is convenient to judge, the problem solving step is optimized, and the multiple solution is realized. For the equation set, each equation is simplified, the number of unknown numbers and the condition of indexes of the equation set are determined conveniently, and therefore the optimal problem solving method is selected.
As can be seen from the above technical solution, the present embodiment provides a solution engine, which is applied to an electronic device, and specifically receives an original image carrying problematic content input by a user; analyzing the problem content to obtain a content list contained in the problem content; and solving the questions aiming at the content list to obtain and output answers to the questions. According to the scheme, the answer is obtained by analyzing the questions, and the answers of the questions are fed back to the user, so that the questions can be solved and fed back for any questions.
The units involved in the embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The name of the unit does not in any way constitute a limitation of the unit itself, for example the first acquisition unit may also be described as "unit acquiring at least two internet protocol addresses".
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a field programmable gate array FPGA, an application specific integrated circuit ASIC, a special standard product ASSP, a system on a chip SOC, a complex programmable logic device CPLD, etc.
Example III
Fig. 5 is a block diagram of an electronic device according to an embodiment of the present application.
Referring to fig. 5, a schematic diagram of a configuration of an electronic device suitable for use in implementing embodiments of the present disclosure is shown. The terminal device in the embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a personal digital assistant PDA, a tablet PAD, a portable multimedia player PMP, an in-vehicle terminal, etc., and a fixed terminal such as a digital TV, a desktop computer, etc. The electronic device is merely an example and should not impose any limitations on the functionality and scope of use of embodiments of the present disclosure.
The electronic device may comprise a processing means 501, such as a central processor, a graphics processor, etc., which may perform various suitable actions and processes in accordance with programs stored in a read only memory ROM502 or loaded from an input means 506 into a random access memory RAM 503. In the RAM, various programs and data required for the operation of the electronic device are also stored. The processing device, ROM, and RAM are connected to each other by bus 504. I/O interface 505 is also connected to bus 504.
In general, the following devices may be connected to the I/O interface: input devices including, for example, touch screens, touch pads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; an output device 507 including, for example, a liquid crystal display, a speaker, a vibrator, and the like; storage 508 including, for example, magnetic tape, hard disk, etc.; and communication means 509. The communication means 509 may allow the electronic device to communicate with other devices wirelessly or by wire to exchange data. While an electronic device having various means is shown in the figures, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.
Example IV
The present embodiment provides a computer-readable storage medium carrying one or more computer programs which, when executed by the electronic device, cause the electronic device to receive an original image carrying problematic content input by a user; analyzing the problem content to obtain a content list contained in the problem content; and solving the questions aiming at the content list to obtain and output answers to the questions. According to the scheme, the answer is obtained by analyzing the questions, and the answers of the questions are fed back to the user, so that the questions can be solved and fed back for any questions.
It should be noted that the computer readable medium described in the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory RAM, a read-only memory ROM, an erasable programmable read-only memory EPROM or flash memory, an optical fiber, a portable compact disc read-only memory CD-ROM, an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In this specification, each embodiment is described in a progressive manner, and each embodiment is mainly described by differences from other embodiments, and identical and similar parts between the embodiments are all enough to be referred to each other.
While preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiment and all such alterations and modifications as fall within the scope of the embodiments of the application.
Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or terminal device comprising the element.
The foregoing has outlined rather broadly the more detailed description of the application in order that the detailed description of the application that follows may be better understood, and in order that the present principles and embodiments may be better understood; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present application, the present description should not be construed as limiting the present application in view of the above.
Claims (10)
1. The problem solving method is applied to the electronic equipment and is characterized by comprising the following steps:
receiving an original image carrying problematic content input by a user;
analyzing the problem content to obtain a content list contained in the problem content;
and solving the questions aiming at the content list to obtain and output answers to the questions.
2. The method for solving a problem according to claim 1, wherein the step of receiving an original image carrying the content of the problem inputted by the user, the original image carrying the content of the problem, comprises the steps of:
acquiring the original image;
and carrying out character recognition processing on the original image to obtain the problem content.
3. The method for solving a problem according to claim 1, wherein the parsing of the content of the problem to obtain a content list included in the content of the problem includes the steps of:
analyzing the problem content into a node list;
and analyzing the node list into the content list according to a preset grammar rule, a preset operation sequence and a preset input mode, wherein the content list is in a structure tree form.
4. The method for solving a problem according to claim 3, wherein the step of solving a problem with respect to the content list to obtain and output a problem answer comprises the steps of:
converting the content list into an operand, wherein the operand is a tree structure formed by a plurality of number nodes;
and processing the plurality of digital nodes to obtain the answers to the questions, and sending the answers to the questions to the user.
5. A solution engine for an electronic device, the solution engine comprising:
the information receiving module is configured to receive an original image carrying problematic content input by a user;
the mathematical analyzer is configured to analyze the problem content to obtain a content list contained in the problem content;
and the mathematic question-solving device is configured to solve the questions aiming at the content list to obtain and output answers to the questions.
6. The solution engine of claim 5, wherein the information receiving module comprises:
an image acquisition unit configured to acquire the original image;
and the content recognition unit is configured to perform character recognition processing on the original image to obtain the problem content.
7. The solution engine of claim 5, wherein the mathematical parser comprises:
a first parsing unit configured to parse the problem contents into a node list;
the second analyzing unit is configured to analyze the node list into the content list according to a preset grammar rule, a preset operation sequence and a preset input mode, and the content list is in a structure tree form.
8. The solution engine of claim 5, wherein the mathematical solution engine comprises:
a list conversion unit configured to convert the content list into an operand which is a tree structure composed of a plurality of number nodes;
and the node processing unit is configured to process the plurality of digital nodes to obtain the answers to the questions and send the answers to the questions to the user.
9. An electronic device comprising at least one processor and a memory coupled to the processor, wherein:
the memory is used for storing a computer program or instructions;
the processor is configured to execute the computer program or instructions to cause the electronic device to implement the problem solving method according to any one of claims 1 to 4.
10. A storage medium applied to an electronic device, wherein the storage medium carries one or more computer programs, and the one or more computer programs are executable by the electronic device, so that the electronic device implements the problem solving method as claimed in any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311371884.7A CN117131934A (en) | 2023-10-23 | 2023-10-23 | Question solving method, question solving engine, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311371884.7A CN117131934A (en) | 2023-10-23 | 2023-10-23 | Question solving method, question solving engine, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117131934A true CN117131934A (en) | 2023-11-28 |
Family
ID=88863061
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311371884.7A Pending CN117131934A (en) | 2023-10-23 | 2023-10-23 | Question solving method, question solving engine, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117131934A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101329731A (en) * | 2008-06-06 | 2008-12-24 | 南开大学 | Automatic recognition method pf mathematical formula in image |
| CN108416709A (en) * | 2018-02-09 | 2018-08-17 | 深圳市鹰硕技术有限公司 | Automatically generate the method and device of mathematics multiple-choice question answer choice |
| CN111460116A (en) * | 2020-03-19 | 2020-07-28 | 北京百度网讯科技有限公司 | Question answering method, question answering system, electronic equipment and storage medium |
| CN111767024A (en) * | 2020-07-09 | 2020-10-13 | 北京猿力未来科技有限公司 | Simple operation-oriented answering method and device |
| EP3761289A1 (en) * | 2019-07-03 | 2021-01-06 | Obrizum Group Ltd. | Educational and content recommendation management system |
| CN113569741A (en) * | 2021-07-29 | 2021-10-29 | 小船出海教育科技（北京）有限公司 | Answer generation method and device for image test questions, electronic equipment and readable medium |
| CN115708088A (en) * | 2021-08-03 | 2023-02-21 | 北京猿力未来科技有限公司 | Problem solving method and device |
| CN115809319A (en) * | 2021-09-14 | 2023-03-17 | 北京猿力未来科技有限公司 | Question answering method and device |
| CN116432606A (en) * | 2023-04-13 | 2023-07-14 | 深圳市星桐科技有限公司 | Method, device, equipment and storage medium for acquiring explanation steps of equation |
| CN116561262A (en) * | 2022-01-29 | 2023-08-08 | 华为技术有限公司 | Test question correcting method and related device |
-
2023
- 2023-10-23 CN CN202311371884.7A patent/CN117131934A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101329731A (en) * | 2008-06-06 | 2008-12-24 | 南开大学 | Automatic recognition method pf mathematical formula in image |
| CN108416709A (en) * | 2018-02-09 | 2018-08-17 | 深圳市鹰硕技术有限公司 | Automatically generate the method and device of mathematics multiple-choice question answer choice |
| EP3761289A1 (en) * | 2019-07-03 | 2021-01-06 | Obrizum Group Ltd. | Educational and content recommendation management system |
| CN111460116A (en) * | 2020-03-19 | 2020-07-28 | 北京百度网讯科技有限公司 | Question answering method, question answering system, electronic equipment and storage medium |
| CN111767024A (en) * | 2020-07-09 | 2020-10-13 | 北京猿力未来科技有限公司 | Simple operation-oriented answering method and device |
| CN113569741A (en) * | 2021-07-29 | 2021-10-29 | 小船出海教育科技（北京）有限公司 | Answer generation method and device for image test questions, electronic equipment and readable medium |
| CN115708088A (en) * | 2021-08-03 | 2023-02-21 | 北京猿力未来科技有限公司 | Problem solving method and device |
| CN115809319A (en) * | 2021-09-14 | 2023-03-17 | 北京猿力未来科技有限公司 | Question answering method and device |
| CN116561262A (en) * | 2022-01-29 | 2023-08-08 | 华为技术有限公司 | Test question correcting method and related device |
| CN116432606A (en) * | 2023-04-13 | 2023-07-14 | 深圳市星桐科技有限公司 | Method, device, equipment and storage medium for acquiring explanation steps of equation |
Non-Patent Citations (2)
| Title |
|---|
| 潘武模 等: "Guidelines for Creating a Rule-Based Knowledge Learning System and Their Application to a Chinese Business Card Layout Analysis", JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, no. 01, pages 47 - 56 * |
| 赵磊: "数学公式识别的关键技术研究及其在自动判卷中的应用", 《中国优秀硕士学位论文全文数据库社会科学Ⅱ辑》, no. 01, pages 127 - 43 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110969012B (en) | Text error correction method and device, storage medium and electronic equipment | |
| CN111382261B (en) | Abstract generation method and device, electronic equipment and storage medium | |
| US11651015B2 (en) | Method and apparatus for presenting information | |
| CN111159220A (en) | Method and apparatus for outputting structured query statement | |
| CN114385780A (en) | Program interface information recommendation method and device, electronic equipment and readable medium | |
| CN115221191A (en) | Virtual column construction method based on data lake and data query method | |
| CN111414453A (en) | Structured text generation method and device, electronic equipment and computer readable storage medium | |
| CN115270717A (en) | Method, device, equipment and medium for detecting vertical position | |
| CN112582073B (en) | Medical information acquisition method, device, electronic equipment and medium | |
| CN111124541A (en) | Configuration file generation method, device, equipment and medium | |
| CN117131934A (en) | Question solving method, question solving engine, electronic equipment and storage medium | |
| CN115982204A (en) | Query statement conversion method and device, electronic equipment and storage medium | |
| CN111737571B (en) | Searching method and device and electronic equipment | |
| CN111813846B (en) | Data analysis processing system and data processing method | |
| CN114490946A (en) | Xlnet model-based class case retrieval method, system and equipment | |
| CN113807056A (en) | Method, device and equipment for correcting error of document name sequence number | |
| CN112489652A (en) | Text acquisition method and device for voice information and storage medium | |
| CN111753548A (en) | Information acquisition method and device, computer storage medium and electronic equipment | |
| CN111221424A (en) | Method, apparatus, electronic device, and computer-readable medium for generating information | |
| CN113609309B (en) | Knowledge graph construction method and device, storage medium and electronic equipment | |
| CN117389544B (en) | Artificial intelligence data modeling method, device, medium and equipment | |
| CN112286900A (en) | Data processing method, device, equipment and storage medium | |
| US20240104297A1 (en) | Analysis of spreadsheet table in response to user input | |
| CN114385781B (en) | Interface file recommendation method, device, equipment and medium based on statement model | |
| CN107632718B (en) | Method, device and readable medium for recommending digital information in voice input |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |