summaryrefslogtreecommitdiff
path: root/aied2017/aied2017.tex
diff options
context:
space:
mode:
Diffstat (limited to 'aied2017/aied2017.tex')
-rw-r--r--aied2017/aied2017.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/aied2017/aied2017.tex b/aied2017/aied2017.tex
index a7ed5e1..3faaaf8 100644
--- a/aied2017/aied2017.tex
+++ b/aied2017/aied2017.tex
@@ -41,7 +41,7 @@
% motivation
When implementing a programming tutor, it is often difficult to manually consider all possible errors encountered by students. An alternative is to automatically learn a bug library of erroneous patterns from students’ programs.
% learning
-We propose using abstract-syntax-tree (AST) patterns as features for learning rules to distinguish between correct and incorrect programs. These rules can be used for debugging student programs: rules for incorrect programs (buggy rules) contain patterns indicating mistakes, whereas each rule for correct programs covers a subset of submissions sharing the same solution strategy.
+We propose using abstract-syntax-tree (AST) patterns as features for learning rules to distinguish between correct and incorrect programs. These rules can be used for debugging student programs: rules for incorrect programs (buggy rules) contain patterns indicating mistakes, whereas rules for correct programs cover subsets of submissions sharing the same solution strategy.
% generating hints
To generate hints, we first check all buggy rules and point out incorrect patterns. If no buggy rule matches, rules for correct programs are used to recognize the student’s intent and suggest patterns that still need to be implemented.
% evaluation