版权说明 操作指南
首页 > 成果 > 详情

A Framework for Solving Explicit Arithmetic Word Problems and Proving Plane Geometry Theorems

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Yu, Xinguo(余新国);Wang, Mingshu;Gan, Wenbin;He, Bin*;Ye, Nan
通讯作者:
He, Bin
作者机构:
[Yu, Xinguo; Gan, Wenbin; He, Bin; Wang, Mingshu] Cent China Normal Univ, Natl Engn Res Ctr E Learning, Wuhan 430079, Hubei, Peoples R China.
[Ye, Nan] Univ Queensland, Brisbane, Qld 4072, Australia.
通讯机构:
[He, Bin] C
Cent China Normal Univ, Natl Engn Res Ctr E Learning, Wuhan 430079, Hubei, Peoples R China.
语种:
英文
关键词:
Automatic solver;relation extraction;syntax-semantic model;arithmetic word problems;plane geometry theorems
期刊:
International Journal of Pattern Recognition and Artificial Intelligence
ISSN:
0218-0014
年:
2019
卷:
33
期:
7
页码:
1940005:1-1940005:21
基金类别:
National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [61802142]; Fundamental Research Funds for the Central UniversitiesFundamental Research Funds for the Central Universities [CCNU17QN005]
机构署名:
本校为第一且通讯机构
院系归属:
国家数字化学习工程技术研究中心
摘要:
This paper presents a framework for solving math problems stated in a natural language (NL) and applies the framework to develop algorithms for solving explicit arithmetic word problems and proving plane geometry theorems. We focus on problem understanding, that is, the transformation of a NL description of a math problem to a formal representation. We view this as a relation extraction problem, and adopt a greedy algorithm to extract the mathematical relations using a syntax-semantics model, which is a set of patterns describing how a syntactic pattern is mapped to its formal semantics. Our m...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com