An Expression Tree Decoding Strategy for Mathematical Equation Generation
Generating mathematical equations from natural language requires an accurate understanding of the relations among math expressions. Existing approaches can be broadly categorized into token-level and expression-level generation. The former treats equations as a mathematical language, sequentially generating math tokens. Expression-level methods generate each expression one by one. However, each expression represents a solving step, and there naturally exist parallel or dependent relations between these steps, which are ignored by current sequential methods. Therefore, we integrate tree structure into the expression-level generation and advocate an expression tree decoding strategy. To generate a tree with expression as its node, we employ a layer-wise parallel decoding strategy: we decode multiple independent expressions (leaf nodes) in parallel at each layer and repeat parallel decoding layer by layer to sequentially generate these parent node expressions that depend on others. Besides, a bipartite matching algorithm is adopted to align multiple predictions with annotations for each layer. Experiments show our method outperforms other baselines, especially for these equations with complex structures.
PDF Abstract
MathQA
| Task | Dataset | Model | Metric Name | Metric Value | Global Rank | Benchmark |
|---|---|---|---|---|---|---|
| Math Word Problem Solving | Math23K | Exp-Tree | Accuracy (5-fold) | 84.1 | # 3 | |
| Accuracy (training-test) | 86.2 | # 3 | ||||
| Math Word Problem Solving | MathQA | Exp-Tree | Answer Accuracy | 81.5 | # 2 | |
| Math Word Problem Solving | MAWPS | Exp-Tree | Accuracy (%) | 92.3 | # 4 |
