Nov. 23, 2022, 2:17 a.m. | Suresh Kumar, P Sreenivasa Kumar

cs.CL updates on arXiv.org arxiv.org

Machine generation of Arithmetic Word Problems (AWPs) is challenging as they
express quantities and mathematical relationships and need to be consistent.
ML-solvers require a large annotated training set of consistent problems with
language variations. Exploiting domain-knowledge is needed for consistency
checking whereas LSTM-based approaches are good for producing text with
language variations. Combining these we propose a system, OLGA, to generate
consistent word problems of TC (Transfer-Case) type, involving object transfers
among agents. Though we provide a dataset of consistent …

arxiv lstm ontology transfer type

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Alternance DATA/AI Engineer (H/F)

@ SQLI | Le Grand-Quevilly, France