Difference between revisions of "Pattern-match question type"

Jump to: navigation, search
m (* Regular Expression Short-Answer question type additional plugin (that can easily account for permutations and accepting any combination of blank spaces).)
 
(One intermediate revision by the same user not shown)
Line 25: Line 25:
 
* [http://labspace.open.ac.uk/course/view.php?id=3484 eAssessment at the Open University with open source software]
 
* [http://labspace.open.ac.uk/course/view.php?id=3484 eAssessment at the Open University with open source software]
  
* [[Preg question type]] additional plugin
+
* [[Regular Expression Short-Answer question type]] additional plugin (that can easily account for permutations and accepting any combination of blank spaces).
* [[Regular Expression Short-Answer question type]] additional plugin
 
 
* [[Essay (auto-grade) question type]] additional plugin  
 
* [[Essay (auto-grade) question type]] additional plugin  
 +
* [[Preg question type]] additional plugin (for Moodle branches 2.3 to 3.1 only)
 +
  
  

Latest revision as of 19:47, 14 January 2020

Pattern-match question type
Type question type
Set N/A
Downloads https://moodle.org/plugins/qtype_pmatch
Issues https://github.com/moodleou/moodle-qtype_pmatch
Discussion https://moodle.org/mod/forum/view.php?id=737
Maintainer(s) Tim Hunt


Pattern-match questions allow the student to give an answer of up to about 20 words, which can then be automatically graded by matching the students response against a number of different patterns expressed in the PMatch syntax. The first matching pattern determines the score and the feedback.

pmatch.png

This is a question type created and maintained by the Open University.

Note: This question type assumes that the decimal separator is a full stop. It will not work if you try to use a a decimal comma.


More documentation

More documentation is available in the Open University's reference manual. That includes a description of the pmatch syntax. There is another page that explains The OU PMatch algorithm, but that was written before development started, and may not be a 100% accurate description of what was finally implemented.

See also