On Sat, Oct 17, 2009 at 11:39 AM, Pierre Abbat <phma@phma.optus.nu> wrote:
>
> How should that sort of question be implemented in the database? And how
> should it be scored?
Maybe the database should contain N matching pairs, and for a given
test randomly select n < N pairs, randomly ordered. That way we get
lots of different versions of the question relatively cheap.
mu'o mi'e xorxes