Verb Categorisation for Hindi Word Problem Solving

• URL: http://arxiv.org/abs/2312.11395v1
• Date: Mon, 18 Dec 2023 17:55:05 GMT
• Title: Verb Categorisation for Hindi Word Problem Solving
• Authors: Harshita Sharma, Pruthwik Mishra, Dipti Misra Sharma
• Abstract summary: We have built a Hindi arithmetic word problem solver which makes use of verbs. We propose a rule-based solver that uses verb categorisation to identify operations in a word problem and generate answers for it.
• Score: 4.926283917321646
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Word problem Solving is a challenging NLP task that deals with solving mathematical problems described in natural language. Recently, there has been renewed interest in developing word problem solvers for Indian languages. As part of this paper, we have built a Hindi arithmetic word problem solver which makes use of verbs. Additionally, we have created verb categorization data for Hindi. Verbs are very important for solving word problems with addition/subtraction operations as they help us identify the set of operations required to solve the word problems. We propose a rule-based solver that uses verb categorisation to identify operations in a word problem and generate answers for it. To perform verb categorisation, we explore several approaches and present a comparative study.

Related papers

• Problem Categorization Can Help Large Language Models Solve Math Problems [0.0]
  We show the effectiveness of using the classification of problems into different categories to facilitate problem-solving. We also optimize the classification of problems into categories by creating an accurate dataset.
  arXiv  Detail & Related papers  (2024-10-29T16:06:26Z)
• Do Language Models Exhibit the Same Cognitive Biases in Problem Solving as Human Learners? [140.9751389452011]
  We study the biases of large language models (LLMs) in relation to those known in children when solving arithmetic word problems. We generate a novel set of word problems for each of these tests, using a neuro-symbolic approach that enables fine-grained control over the problem features.
  arXiv  Detail & Related papers  (2024-01-31T18:48:20Z)
• Explaining Math Word Problem Solvers [2.792030485253753]
  We investigate what information math word problem solvers use to generate solutions. Our results show that the model is not sensitive to the removal of many words from the input and can still find a correct answer when given a nonsense question. This indicates that automatic solvers do not follow the semantic logic of math word problems, and may be overfitting to the presence of specific words.
  arXiv  Detail & Related papers  (2023-07-24T21:05:47Z)
• Solving Math Word Problems by Combining Language Models With Symbolic Solvers [28.010617102877923]
  Large language models (LLMs) can be combined with external tools to perform complex reasoning and calculation. We propose an approach that combines an LLM that can incrementally formalize word problems as a set of variables and equations with an external symbolic solver. Our approach achieves comparable accuracy to the original PAL on the GSM8K benchmark of math word problems and outperforms PAL by an absolute 20% on ALGEBRA.
  arXiv  Detail & Related papers  (2023-04-16T04:16:06Z)
• Automatic Generation of Socratic Subquestions for Teaching Math Word Problems [16.97827669744673]
  We explore the ability of large language models (LMs) in generating sequential questions for guiding math word problem-solving. On both automatic and human quality evaluations, we find that LMs constrained with desirable question properties generate superior questions. Results suggest that the difficulty level of problems plays an important role in determining whether questioning improves or hinders human performance.
  arXiv  Detail & Related papers  (2022-11-23T10:40:22Z)
• 'John ate 5 apples' != 'John ate some apples': Self-Supervised Paraphrase Quality Detection for Algebraic Word Problems [5.682665111938764]
  This paper introduces the novel task of scoring paraphrases for Algebraic Word Problems (AWP) We propose ParaQD, a self-supervised paraphrase quality detection method using novel data augmentations. Our method outperforms existing state-of-the-art self-supervised methods by up to 32% while also demonstrating impressive zero-shot performance.
  arXiv  Detail & Related papers  (2022-06-16T16:01:59Z)
• Least-to-Most Prompting Enables Complex Reasoning in Large Language Models [52.59923418570378]
  We propose a novel prompting strategy, least-to-most prompting, to overcome the challenge of easy-to-hard generalization. We show that least-to-most prompting is capable of generalizing to more difficult problems than those seen in prompts. neural-symbolic models in the literature that specialize in solving SCAN are trained on the entire training set containing over 15,000 examples.
  arXiv  Detail & Related papers  (2022-05-21T15:34:53Z)
• Utilizing Wordnets for Cognate Detection among Indian Languages [50.83320088758705]
  We detect cognate word pairs among ten Indian languages with Hindi. We use deep learning methodologies to predict whether a word pair is cognate or not. We report improved performance of up to 26%.
  arXiv  Detail & Related papers  (2021-12-30T16:46:28Z)
• Challenge Dataset of Cognates and False Friend Pairs from Indian Languages [54.6340870873525]
  Cognates are present in multiple variants of the same text across different languages. In this paper, we describe the creation of two cognate datasets for twelve Indian languages.
  arXiv  Detail & Related papers  (2021-12-17T14:23:43Z)
• Machine Number Sense: A Dataset of Visual Arithmetic Problems for Abstract and Relational Reasoning [95.18337034090648]
  We propose a dataset, Machine Number Sense (MNS), consisting of visual arithmetic problems automatically generated using a grammar model--And-Or Graph (AOG) These visual arithmetic problems are in the form of geometric figures. We benchmark the MNS dataset using four predominant neural network models as baselines in this visual reasoning task.
  arXiv  Detail & Related papers  (2020-04-25T17:14:58Z)
• Techniques for Vocabulary Expansion in Hybrid Speech Recognition Systems [54.49880724137688]
  The problem of out of vocabulary words (OOV) is typical for any speech recognition system. One of the popular approach to cover OOVs is to use subword units rather then words. In this paper we explore different existing methods of this solution on both graph construction and search method levels.
  arXiv  Detail & Related papers  (2020-03-19T21:24:45Z)

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.