Test 2 · ★ · Sharing toys and playing board games fairly

Why is it important that all players read the rules before a new game?

Mova's choice: option 2 · The right answer: option 2 · right ✓ · Who acts: players · What happens: be, read · To what, where: rules

This is test 2 · ★ of lesson 242 «Sharing toys and playing board games fairly» of the everyday course of Mova's primary school. The page gives the question's syntax tree — a dependency tree in the style of Universal Dependencies — and its pragmatics clause by clause, then the 4 options as the student saw them, each with its tree and pragmatics. Every text is parsed by Mova itself. How the student answered it, with the score of every option and why: the test at school.

The question

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Why	why	ADV	PronType=Int	4 important	advmod
2	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	4 important	cop
3	it	it	PRON	Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs	4 important	expl
4	important	important	ADJ	Degree=Pos	root	root
5	that	that	SCONJ	_	8 read	mark
6	all	all	DET	PronType=Tot	7 players	det
7	players	player	NOUN	Number=Plur	8 read	nsubj
8	read	read	VERB	Mood=Ind Number=Plur Person=3 Tense=Past VerbForm=Fin	4 important	advcl
9	the	the	DET	Definite=Def PronType=Art	10 rules	det
10	rules	rule	NOUN	Number=Plur	8 read	obj
11	before	before	ADP	_	14 game	case
12	a	a	DET	Definite=Ind PronType=Art	14 game	det
13	new	new	ADJ	Degree=Pos	14 game	amod
14	game	game	NOUN	Number=Sing	8 read	obl
15	?	?	PUNCT	_	4 important	punct

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	present						important property	tree rules
2	read	past	all players	the rules			before a new game		vn transfer_mesg-37.1.1-1 «NP V NP»: agent=Agent rule=Topic

One row per clause the reader finds. «not said here»: a role filled from the clause above. «roles by»: a VerbNet class and frame when one fits the verb, else the reader's rules on the tree.

The options

Option 1

The box says that you must, by law

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	The	the	DET	Definite=Def PronType=Art	2 box	det
2	box	box	NOUN	Number=Sing	3 says	nsubj
3	says	say	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	root	root
4	that	that	SCONJ	_	6 must	mark
5	you	you	PRON	Case=Nom Person=2 PronType=Prs	6 must	nsubj
6	must	must	AUX	VerbForm=Fin	3 says	ccomp
7	,	,	PUNCT	_	9 law	punct
8	by	by	ADP	_	9 law	case
9	law	law	NOUN	Number=Sing	3 says	ccomp

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	say speech: assert	present	the box						vn say-37.7-1-1 «NP V that S»: agent=Agent

Option 2 · ← Mova's choice · ✓ the right answer

Everyone needs the same rules for the game to be fair

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Everyone	everyone	PRON	Number=Sing PronType=Tot	2 needs	nsubj
2	needs	need	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	root	root
3	the	the	DET	Definite=Def PronType=Art	5 rules	det
4	same	same	ADJ	Degree=Pos	5 rules	amod
5	rules	rule	NOUN	Number=Plur	2 needs	obj
6	for	for	ADP	_	8 game	case
7	the	the	DET	Definite=Def PronType=Art	8 game	det
8	game	game	NOUN	Number=Sing	5 rules	nmod
9	to	to	PART	_	11 fair	mark
10	be	be	AUX	VerbForm=Inf	11 fair	cop
11	fair	fair	ADJ	Degree=Pos	2 needs	xcomp

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	need	present	Everyone	the same rules				for the game	vn want-32.1-1-1 «NP V NP ADJ»: agent=Pivot rule=Theme
2	is not said to happen	to-infinitive	the same rules not said here					fair property	tree rules

Option 3

It makes the game last much longer

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	It	it	PRON	Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs	2 makes	nsubj
2	makes	make	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	root	root
3	the	the	DET	Definite=Def PronType=Art	4 game	det
4	game	game	NOUN	Number=Sing	2 makes	obj
5	last	last	VERB	Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin	2 makes	xcomp
6	much	much	ADV	_	7 longer	advmod
7	longer	long	ADV	Degree=Cmp	2 makes	advmod

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	make	present	It	the game				long property	tree rules
2	last	present	the game not said here						vn cost-54.2 «NP V NP.value»: agent=Theme

Option 4

So that the winner can say afterwards that the rules were wrong

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	So	so	ADV	_	6 say	advmod
2	that	that	SCONJ	_	6 say	mark
3	the	the	DET	Definite=Def PronType=Art	4 winner	det
4	winner	winner	NOUN	Number=Sing	6 say	nsubj
5	can	can	AUX	VerbForm=Fin	6 say	aux
6	say	say	VERB	VerbForm=Inf	root	root
7	afterwards	afterwards	ADV	_	6 say	advmod
8	that	that	SCONJ	_	12 wrong	mark
9	the	the	DET	Definite=Def PronType=Art	10 rules	det
10	rules	rule	NOUN	Number=Plur	12 wrong	nsubj
11	were	be	AUX	Mood=Ind Number=Plur Person=3 Tense=Past VerbForm=Fin	12 wrong	cop
12	wrong	wrong	ADJ	Degree=Pos	6 say	advcl

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	say speech: assert	can	the winner					afterwards property	vn say-37.7-1-1 «NP V that S»: agent=Agent
2	is	past	the rules					wrong property	tree rules

Text: the tests of Mova's primary school, written for Mova (world/data/school/), as the course runner gave them to the student. Trees: Mova's own parse — the en model on the CPU, when the site is built — not checked by a teacher; they may be wrong. Frames: Mova's frames reader (prag), each text read on its own. Elamur Cosmic License.

This page in Markdown → https://md.mova.elamur.ai/free/en/corpora/questions/everyday/242-sharing-toys-and-board-games/t2/