Solving mathematical (math) word problems (MWP) automatically is a challenging research problem in natural language processing, machine learning, and education (learning) technology domains, which has ...

The two problems are equivalent when V is extension-closed. Turning to practical computations, we modify Ribes and Zalesskiĭ's algorithm to compute the pro-p closure of a finitely generated subgroup ...