Automatic equation transformation from text

A computer system for automatic equation transformation from text, comprising:

• one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage medium, and program instructions stored on at least one of the one or more tangible storage medium for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising:
• receiving a text document;
• identifying a mathematical formula expressed in the received text document;
• removing a plurality of superfluous language from the received text document based on the identified mathematical formula;
• transforming the identified mathematical formula into a symbolic representation based on a trained model;
• utilizing a natural language processing technique to generate a tree-like structure using an identified plurality of mathematical equation language,
• wherein the tree-like structure is generated using an equation dependency parser, an input stack, a processed stack,
• wherein a neural network with one or more hidden layers is implemented with the equation dependency parser, and
• wherein an output layer is represented using a softmax function;
• and
• outputting the symbolic representation.

A computer program product for automatic equation transformation from text, comprising:

• one or more computer-readable storage media and program instructions stored on at least one of the one or more tangible storage media, the program instructions executable by a processor to cause the processor to perform a method comprising:
• receiving a text document;
• identifying a mathematical formula expressed in the received text document;
• removing a plurality of superfluous language from the received text document based on the identified mathematical formula;
• transforming the identified mathematical formula into a symbolic representation based on a trained model;
• utilizing a natural language processing technique to generate a tree-like structure using an identified plurality of mathematical equation language,
• wherein the tree-like structure is generated using an equation dependency parser, an input stack, a processed stack,
• wherein a neural network with one or more hidden layers is implemented with the equation dependency parser, and
• wherein an output layer is represented using a softmax function;
• and
• outputting the symbolic representation.