.png){kind=icon}
返回
HGEN: Learning Hierarchical Heterogeneous Graph Encoding for Math Word Problem Solving
.png){kind=icon}
PRE
AI
DOI：10.1109/TASLP.2022.3145314.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Designing algorithms to solve math word problems (MWPs) is an important research topic in natural language processing and smart education domains. The task of solving MWPs involves transforming math problem texts into math equations. Although recent Graph2Tree-based models, which adopt homogeneous graph encoders to learn quantity representations, have obtained very promising results in generating math equations, they do not consider the heterogeneous issue and the long-distance dependencies of heterogeneous nodes. In this paper, we propose a novel hierarchical heterogeneous graph encoding called HGEN for MWPs. Specifically, HGEN first introduces a heterogeneous graph consisting of a node-level attention layer and a type-aware attention layer to learn the heterogeneous node embedding. HGEN then captures the long-distance dependent information by propagating the multi-hop nodes in a hierarchical manner. We conduct extensive experiments on two popular MWP datasets. Our empirical results show that HGEN significantly outperforms the state-of-the-art Graph2Tree-based models in the literature.
Keyword:
Mathematical models
Decoding
Natural languages
Encoding
Electronic mail
Arithmetic
Task analysis
Math word problem
natural language processing
text mining
representation learning
期刊
I
IF:
5.1
论文数:
2.6K
被引数:
1.1W
机构
引用论文
分享收藏
Crystal structure of human PACRG in complex with MEIG1 reveals roles in axoneme formation and tubulin binding.png)
Structure
OAAI
StructureIF0
OAAI分享收藏
查看更多内容