Compositional Mathematical Encoding for Math Word Problems

7Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Solving math word problem (MWP) remains a challenging task, as it requires to understand both the semantic meanings of the text and the mathematical logic among quantities, i.e., for both semantics modal and quantity modal learning. Current MWP encoders work in a uni-modal setting and map the given problem description to a latent representation, then for decoding. The generalizability of these MWP encoders is thus limited because some problems are semantics-demanding and others are quantity-demanding. To address this problem, we propose a Compositional Math Word Problem Solver (C-MWP) which works in a bimodal setting encoding in an interactive way. Extensive experiments validate the effectiveness of C-MWP and show its superiority over state-of-the-art models on public benchmarks.

Cite

CITATION STYLE

APA

Liang, Z., Zhang, J., Guo, K., Wu, X., Shao, J., & Zhang, X. (2023). Compositional Mathematical Encoding for Math Word Problems. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (pp. 10008–10017). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.findings-acl.635

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free