summaryrefslogtreecommitdiff
path: root/aied2018/aied2018.tex
diff options
context:
space:
mode:
Diffstat (limited to 'aied2018/aied2018.tex')
-rw-r--r--aied2018/aied2018.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/aied2018/aied2018.tex b/aied2018/aied2018.tex
index a028852..c26d1a2 100644
--- a/aied2018/aied2018.tex
+++ b/aied2018/aied2018.tex
@@ -42,7 +42,7 @@
\begin{abstract}
% background / problem
-Writing programs is essential to learning programming. Most programming courses use lab and homework assignments to encourage students to practice. By analyzing solutions to these exercises teachers can discover mistakes and concepts students are struggling with, in order to improve the content and presentation of the course. Students however tend to submit many different programs even for simple exercises, making such analysis difficult.
+Writing programs is essential to learning programming. Most programming courses encourage students to practice with lab and homework assignments. By analyzing solutions to these exercises teachers can discover mistakes and concepts students are struggling with, and use that knowledge to improve the content and presentation of the course. Students however tend to submit many different programs even for simple exercises, making such analysis difficult.
% solution
We propose using tree regular expressions to encode common patterns in programs. Based on these patterns we induce rules describing common approaches and mistakes for a given assignment. In this paper we describe the rule-learning algorithm and present case studies of rule-based analysis for several introductory Python problems. We show that our rules are easy to interpret, and can be learned from a relatively small set of programs.
\\\\