arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.12432cs.CL
收藏

MathWord问题的结构统一M树编码求解器

Structure-Unified M-Tree Coding Solver for MathWord Problem

Nanjing University(南京大学)

Bin Wang, Jiangzhou Ju, Yang Fan, Xinyu Dai, Shujian Huang, Jiajun Chen

摘要:

数学应用题求解器的设计作为自然语言处理中的一项挑战性任务,近年来引起了越来越多的研究关注。在以前的工作中,模型设计考虑到在输出端的数学表达式的树结构的属性,取得了更好的性能。然而,对应于MWP的表达通常是多样的(例如,$n_1+n_2 \times n_3-n_4$、$n_3\times n_2-n_4+n_1$等),相应的二叉树也是如此,由于输出空间的不确定性,这给模型学习带来了困难。在本文中,我们提出了结构统一的M-Tree编码求解器(SUMC-求解器),它适用于一个树与任何M分支(M-tree),以统一的输出结构。为了学习M-tree,我们使用映射将M-tree转换为M-tree代码,其中代码存储从树根到叶子节点的路径信息和叶子节点本身的信息,然后设计一个序列到代码(seq 2code)模型来生成代码。在广泛使用的MAWPS和Math 23 K数据集上的实验结果表明,SUMC-Solver不仅在类似的实验设置下优于几种最先进的模型,而且在低资源条件下表现得更好。

英文摘要:

As one of the challenging NLP tasks, designing math word problem (MWP) solvers has attracted increasing research attention for the past few years. In previous work, models designed by taking into account the properties of the binary tree structure of mathematical expressions at the output side have achieved better performance. However, the expressions corresponding to a MWP are often diverse (e.g., $n_1+n_2 \times n_3-n_4$, $n_3\times n_2-n_4+n_1$, etc.), and so are the corresponding binary trees, which creates difficulties in model learning due to the non-deterministic output space. In this paper, we propose the Structure-Unified M-Tree Coding Solver (SUMC-Solver), which applies a tree with any M branches (M-tree) to unify the output structures. To learn the M-tree, we use a mapping to convert the M-tree into the M-tree codes, where codes store the information of the paths from tree root to leaf nodes and the information of leaf nodes themselves, and then devise a Sequence-to-Code (seq2code) model to generate the codes. Experimental results on the widely used MAWPS and Math23K datasets have demonstrated that SUMC-Solver not only outperforms several state-of-the-art models under similar experimental settings but also performs much better under low-resource conditions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑