We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X,A) = B, where w is a finite word in the alphabet {X,A}. We think of A,B ∈ G as fixed coefficients, and X ∈ G as the unknown. Certain word equations, such as XAXAX = B, have solutions in terms of radicals: X = A−1/2(A1/2BA1/2)1/3A−1/2, while others su...

This paper formalizes the problem of solving multi-sentence algebraic word problems as that of generating and scoring equation trees. We use integer linear programming to generate equation trees and score their likelihood by learning local and global discriminative models. These models are trained on a small set of word problems and their answers, without any manual annotation, in order to choo...

Many text mining methods have used statistical information as and language-independent procedures that are not deterministic. On the other hand, grammatical structure-based limited to use in a certain language text. We aim suggest an algorithmic algebraic equation deterministic nonprobabilistic way while maintaining advantage of independence. propose mathematical approach transforms labels into...

Zusammenfassung Solving word problems is an important part in school education in primary as well as in high school. Although, the equations that are given by a word problem could be solved by most computer algebra programs without problems, there are just few systems that are able to solve word problems. In this paper we present the ongoing work on a system, that is able to solve word problems...

Context uniication was originally deened by H. Comon in ICALP'92, as the problem of nding a uniier for a set of equations containing rst-order variables and context variables. These context variables have arguments, and can be instantiated by contexts. In other words, they are second-order variables that are restricted to be instantiated by linear terms (a linear term is a-expression x1 xn : t ...

Researchers have been interested in developing AI tools to help students learn various mathematical subjects. One challenging set of tasks for school is learning solve math word problems. We explore how recent advances natural language processing, specifically the rise powerful transformer based models, can be applied learners with such Concretely, we evaluate use GPT-3, a 1.75B parameter model...

Solving arithmetic word problems is a cornerstone task in assessing language understanding and reasoning capabilities NLP systems. Recent works use automatic extraction ranking of candidate solution equations providing the answer to problems. In this work, we explore novel approaches score such using tree-structured recursive neural network (Tree-RNN) configurations. The advantage Tree-RNN appr...

Context unification was originally defined by H. Comon in ICALP’92, as the problem of finding a unifier for a set of equations containing first-order variables and context variables. These context variables have arguments, and can be instantiated by contexts. In other words, they are second-order variables that are restricted to be instantiated by linear terms (a linear term is a λ-expression λ...