Probabilistic Equivalence Verification Approach for Automatic Mathematical Solution Assessment

Automatic mathematical solution assessment checks the equivalence of mathematical expressions in the user answer and standard solution. It is a challenging problem as the semantics of mathematical expressions are highly symbolic and equivalent mathematical expressions can be expressed in different forms. In this paper, we propose an effective Probabilistic Equivalence Verification (PEV) approach for automatic mathematical solution assessment. The proposed PEV approach is a randomized method based on the probabilistic numerical equivalence testing of two mathematical expressions. It can avoid false negative errors completely while guaranteeing a small probability of false positive errors to occur. The performance results have shown that the proposed PEV approach has outperformed other popular techniques in Computer Algebra Systems such as Maple and Mathematica.

[1]  Antti Rasila,et al.  Automatic assessment in engineering mathematics: evaluation of the impact , 2010 .

[2]  Peter C. Jurs,et al.  Mathematica , 2019, J. Chem. Inf. Comput. Sci..

[3]  Kaizhong Zhang,et al.  Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[4]  Chee-Keng Yap,et al.  Fundamental problems of algorithmic algebra , 1999 .

[5]  Abdou Youssef,et al.  Equivalence detection using parse-tree normalization for math search , 2007, 2007 2nd International Conference on Digital Information Management.

[6]  Eduardo Guzmán,et al.  Improving Student Performance Using Self-Assessment Tests , 2007, IEEE Intelligent Systems.

[7]  Joel S. Cohen,et al.  Computer Algebra and Symbolic Computation: Mathematical Methods , 2003 .

[8]  D. McIlroy.  Algebraic Simplification , 1966, CACM.

[9]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[10]  Paul Hyman.  In the year of disruptive education , 2012, CACM.

[11]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

[12]  Manuel Blum,et al.  Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time , 1980, Inf. Process. Lett..

[13]  Boris Beizer,et al.  Software Testing Techniques , 1983 .

[14]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[16]  Kai Zenger,et al.  Automatic assessment of mathematics exercises: Experiences and future prospects , 2007 .

[17]  Oscar H. Ibarra,et al.  Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs , 1983, JACM.

[18]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[19]  Rada Mihalcea,et al.  Learning to Grade Short Answer Questions using Semantic Similarity Measures and Dependency Graph Alignments , 2011, ACL.

[20]  Bruno Buchberger,et al.  Computer algebra symbolic and algebraic computation , 1982, SIGS.

[21]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

[22]  Sumit Gulwani,et al.  Synthesizing geometry constructions , 2011, PLDI '11.

[23]  Ding-Zhu Du,et al.  A survey on combinatorial group testing algorithms with applications to DNA Library Screening , 1999, Discrete Mathematical Problems with Medical Applications.

[24]  Marti A. Hearst.  The debate on automated essay grading , 2000 .

[25]  Sumit Gulwani,et al.  Automatically Generating Algebra Problems , 2012, AAAI.

[26]  Z. Galil,et al.  Pattern matching algorithms , 1997 .