MWPRanker: An Expression Similarity Based Math Word Problem Retriever

• URL: http://arxiv.org/abs/2307.01240v1
• Date: Mon, 3 Jul 2023 15:44:18 GMT
• Title: MWPRanker: An Expression Similarity Based Math Word Problem Retriever
• Authors: Mayank Goel, Venktesh V, and Vikram Goyal
• Abstract summary: Math Word Problems (MWPs) in online assessments help test the ability of the learner to make critical inferences. We propose a tool in this work for MWP retrieval.
• Score: 12.638925774492403
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Math Word Problems (MWPs) in online assessments help test the ability of the learner to make critical inferences by interpreting the linguistic information in them. To test the mathematical reasoning capabilities of the learners, sometimes the problem is rephrased or the thematic setting of the original MWP is changed. Since manual identification of MWPs with similar problem models is cumbersome, we propose a tool in this work for MWP retrieval. We propose a hybrid approach to retrieve similar MWPs with the same problem model. In our work, the problem model refers to the sequence of operations to be performed to arrive at the solution. We demonstrate that our tool is useful for the mentioned tasks and better than semantic similarity-based approaches, which fail to capture the arithmetic and logical sequence of the MWPs. A demo of the tool can be found at https://www.youtube.com/watch?v=gSQWP3chFIs

Related papers

• Benchmarking Hallucination in Large Language Models based on Unanswerable Math Word Problem [58.3723958800254]
  Large language models (LLMs) are highly effective in various natural language processing (NLP) tasks. They are susceptible to producing unreliable conjectures in ambiguous contexts called hallucination. This paper presents a new method for evaluating LLM hallucination in Question Answering (QA) based on the unanswerable math word problem (MWP)
  arXiv  Detail & Related papers  (2024-03-06T09:06:34Z)
• Solving Math Word Problems with Reexamination [27.80592576792461]
  We propose a pseudo-dual (PseDual) learning scheme to model such process, which is model-agnostic. The pseudo-dual task is specifically defined as filling the numbers in the expression back into the original word problem with numbers masked. Our pseudo-dual learning scheme has been tested and proven effective when being equipped in several representative MWP solvers through empirical studies.
  arXiv  Detail & Related papers  (2023-10-14T14:23:44Z)
• Learning by Analogy: Diverse Questions Generation in Math Word Problem [21.211970350827183]
  Solving math word problem (MWP) with AI techniques has recently made great progress with the success of deep neural networks (DNN) We argue that the ability of learning by analogy is essential for an MWP solver to better understand same problems which may typically be formulated in diverse ways. In this paper, we make a first attempt to solve MWPs by generating diverse yet consistent questions/equations.
  arXiv  Detail & Related papers  (2023-06-15T11:47:07Z)
• Analogical Math Word Problems Solving with Enhanced Problem-Solution Association [37.70402758178867]
  We propose to build a novel MWP solver by leveraging analogical MWPs. The key idea, named analogy identification, is to associate the analogical MWP pairs in a latent space. A solution discriminator is integrated into the MWP solver to enhance the association between the representations of MWPs and their true solutions.
  arXiv  Detail & Related papers  (2022-12-01T19:50:30Z)
• Dynamic Prompt Learning via Policy Gradient for Semi-structured Mathematical Reasoning [150.17907456113537]
  We present Tabular Math Word Problems (TabMWP), a new dataset containing 38,431 grade-level problems that require mathematical reasoning. We evaluate different pre-trained models on TabMWP, including the GPT-3 model in a few-shot setting. We propose a novel approach, PromptPG, which utilizes policy gradient to learn to select in-context examples from a small amount of training data.
  arXiv  Detail & Related papers  (2022-09-29T08:01:04Z)
• Unbiased Math Word Problems Benchmark for Mitigating Solving Bias [72.8677805114825]
  Current solvers exist solving bias which consists of data bias and learning bias due to biased dataset and improper training strategy. Our experiments verify MWP solvers are easy to be biased by the biased training datasets which do not cover diverse questions for each problem narrative of all MWPs. An MWP can be naturally solved by multiple equivalent equations while current datasets take only one of the equivalent equations as ground truth.
  arXiv  Detail & Related papers  (2022-05-17T06:07:04Z)
• DISK: Domain-constrained Instance Sketch for Math Word Problem Generation [16.045655800225436]
  A math word problem (MWP) is a coherent narrative which reflects the underlying logic of math equations. Previous methods mainly generate MWP text based on inflexible pre-defined templates. We propose a neural model for generating MWP text from math equations.
  arXiv  Detail & Related papers  (2022-04-10T13:54:23Z)
• Generate & Rank: A Multi-task Framework for Math Word Problems [48.99880318686938]
  Math word problem (MWP) is a challenging and critical task in natural language processing. We propose Generate & Rank, a framework based on a generative pre-trained language model. By joint training with generation and ranking, the model learns from its own mistakes and is able to distinguish between correct and incorrect expressions.
  arXiv  Detail & Related papers  (2021-09-07T12:21:49Z)
• MWP-BERT: A Strong Baseline for Math Word Problems [47.51572465676904]
  Math word problem (MWP) solving is the task of transforming a sequence of natural language problem descriptions to executable math equations. Although recent sequence modeling MWP solvers have gained credits on the math-text contextual understanding, pre-trained language models (PLM) have not been explored for solving MWP. We introduce MWP-BERT to obtain pre-trained token representations that capture the alignment between text description and mathematical logic.
  arXiv  Detail & Related papers  (2021-07-28T15:28:41Z)
• Semantically-Aligned Universal Tree-Structured Solver for Math Word Problems [129.90766822085132]
  A practical automatic textual math word problems (MWPs) solver should be able to solve various textual MWPs. We propose a simple but efficient method called Universal Expression Tree (UET) to make the first attempt to represent the equations of various MWPs uniformly. Then a semantically-aligned universal tree-structured solver (SAU-r) based on an encoder-decoder framework is proposed to resolve multiple types of MWPs in a unified model.
  arXiv  Detail & Related papers  (2020-10-14T06:27:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.