AUTOMATIC UNDERSTANDING AND FORMALIZATION OF NATURAL LANGUAGE GEOMETRY PROBLEMS USING SYNTAX-SEMANTICS MODELS

被引:20
作者
Gan, Wenbin [1 ]
Yu, Xinguo [1 ]
机构
[1] Cent China Normal Univ, Natl Engn Res Ctr E Learning, 152 Luoyu Rd, Wuhan 430079, Hubei, Peoples R China
来源
INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL | 2018年 / 14卷 / 01期
基金
中国国家自然科学基金;
关键词
Understanding geometry problems; Formalized geometric propositions; Relation extraction; Syntax-semantics model; Automatic solution;
D O I
10.24507/ijicic.14.01.83
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Automatic understanding of natural language problems is a long-standing challenge research problem in automatic solving. This paper models the understanding of geometry questions as a problem of relation extraction, instead of as the problem of semantic understanding of natural language; further it discovers that the entities and the geometric attribute pattern of elements can play an important role in relation extraction. Based on these ideas this paper proposes a syntax-semantics (S-2) model approach to understand geometry problem, targeting to produce a group of relations to represent the given geometry problem. The formalized geometric relations can then be transformed into the target system-native representations for manipulation to obtain geometric solutions. Experiments conducted on the test problem dataset show that 91.5% of questions can be correctly understood and solved, and the F-1 score in formalizing these problems is substantially high (0.990). The comparisons also demonstrate that the proposed method can achieve good performance against the state-of-the-art method. Integrating the automatic understanding method with different geometry systems will greatly enhance the efficiency and intelligence in automatic solving.
引用
收藏
页码:83 / 98
页数:16
相关论文
共 27 条
[1]   Help Helps, but only so Much: Research on Help Seeking with Intelligent Tutoring Systems [J].
Aleven V. ;
Roll I. ;
McLaren B.M. ;
Koedinger K.R. .
International Journal of Artificial Intelligence in Education, 2016, 26 (01) :205-223
[2]   Automated Theorem Proving in GeoGebra: Current Achievements [J].
Botana, Francisco ;
Hohenwarter, Markus ;
Janicic, Predrag ;
Kovacs, Zoltan ;
Petrovic, Ivan ;
Recio, Tomas ;
Weitzhofer, Simon .
JOURNAL OF AUTOMATED REASONING, 2015, 55 (01) :39-59
[3]  
Boutry P., 2017, J SYMB COMPUT, P23
[4]   Grounding proposition stores for question answering over linked data [J].
Cabaleiro, Bernardo ;
Penas, Anselmo ;
Manandhar, Suresh .
KNOWLEDGE-BASED SYSTEMS, 2017, 128 :34-42
[5]   Representation and automated transformation of geometric statements [J].
Chen Xiaoyu .
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2014, 27 (02) :382-412
[6]  
Chou S.C, 1988, MECH GEOMETRY THEORE
[7]   My Computer Is an Honor Student - But How Intelligent Is It? Standardized Tests as a Measure of AI [J].
Clark, Peter ;
Etzioni, Oren .
AI MAGAZINE, 2016, 37 (01) :5-12
[8]   A Fully Automatic Theorem Prover with Human-Style Output [J].
Ganesalingam, M. ;
Gowers, W. T. .
JOURNAL OF AUTOMATED REASONING, 2017, 58 (02) :253-291
[9]   A review and prospect of readable machine proofs for geometry theorems [J].
Jiang, Jianguo ;
Zhang, Jingzhong .
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2012, 25 (04) :802-820
[10]  
Liu Q., 2012, COMPUTER SCI, V39, P503