This paper presents a novel approach to automatically solving arithmetic word
problems. This is the first algorithmic approach that can handle arithmetic
problems with multiple steps and operations, without depending on additional
annotations or predefined templates. We develop a theory for expression trees
that can be used to represent and evaluate the target arithmetic expressions;
we use it to uniquely decompose the target arithmetic problem to multiple
classification problems; we then compose an expression tree, combining these
with world knowledge through a constrained inference framework. Our classifiers
gain from the use of {\em quantity schemas} that supports better extraction of
features. Experimental results show that our method outperforms existing
systems, achieving state of the art performance on benchmark datasets of
arithmetic word problems.

本文介绍了一种新的自动解决算术词问题的方法，它是第一种能够处理多步骤和多操作算术问题的算法方法，不依赖于附加的注释或预定义的模板。作者提出了一种表达式树的理论，可以用于表示和评估目标算术表达式，并将其唯一分解为多个分类问题；然后，作者采用受限推理框架将这些问题组合成表达式树，并通过 “数量模式” 提升模型表现，实验结果表明，该方法在算术词问题的基准数据集上实现了业界领先的性能。