Pulse Explorar nav.journalClub Debates Tendencias Investigadores

Join discussions, follow papers, and never miss your next session.

Download on theApp Store

Inicio Explorar nav.journalClub Tendencias

⌘+K

January 1, 2019Open Access

Tree-structured Decoding for Solving Math Word Problems

QLQianying LiuNational Institute of Informatics WGWenyv GuanPeking University SLSujian LiUniversity of Science and Technology Beijing

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

Qianying Liu, Wenyv Guan, Sujian Li, Daisuke Kawahara. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.

Preguntar a la IA

Me gusta

Guardar

Compartir

Ver artículo completo

Preguntar a la IA

Me gusta

Guardar

Compartir

Ver artículo completo

Cite This Study

Liu et al. (Tue,) studied this question.

synapsesocial.com/papers/6a16d0cb83b2be9fec6b7a7a https://doi.org/https://doi.org/10.18653/v1/d19-1241

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Template-Based Math Word Problem Solvers with Recursive Neural Networks2019 · 150 citations
2Learning Fine-Grained Expressions to Solve Math Word Problems2017 · 95 citations
3MathDQN: Solving Arithmetic Word Problems via Deep Reinforcement Learning2018 · 124 citations
4How well do Computers Solve Math Word Problems? Large-Scale Dataset Construction and Evaluation2016 · 144 citations
5Mapping to Declarative Knowledge for Word Problem Solving2018 · 100 citations

Decodificación en Estructura de Árbol para Resolver Problemas de Palabras Matemáticos | Synapse