match_at_least_N() function

[Canx]

I would like to have a function that could match at least N responses, something between match_any() and match_all(). For example:

match_at_least_2(
match_mow(...)
match_mow(...)
match_mow(...)
)

Or is there any way of doing this with the current functions?

[timhunt]

There is no easy way to do that in general.

The only example I know that is a bit like that is the SI units question in the documentation here: http://www.open.edu/openlearncreate/mod/oucontent/view.php?id=52747&section=2.2.1

[Canx]

I tried using | operators but that seems to work only with simple words.

I guess there should be a similar class like pmatch_matcher_mach_any or pmatch_matcher_match_all, but checking the number of subcontents matched in the match_whole_expression method.

How this plugin is developed and funded?

[sgparry]

Me too on this please. This would make certain use cases so much easier. You can do equivalent but only by creating big permutational sets of answer rules (e.g. creating seven copies of the same four match rules)

[garetharnott]

Oh yes this would be an amazing thing. For example in a case where you want to partially grade three 'facts' you can do a match_all, then a match_2 then a match_any. At the moment for the middle option you need a complex nested match_any with 3 match_all sub-heading for the 3 permutations of getting 2/3 correct.