Test 11 · ★ · Playing fair and cheating in games

let my 4yo cousin win snap, that cheating?

Mova's choice: option 2 · The right answer: option 2 · right ✓ · Who acts: you, yo cousin · What happens: let, win · To what, where: snap

This is test 11 · ★ of lesson 200 «Playing fair and cheating in games» 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	let	let	VERB	Mood=Imp VerbForm=Fin	root	root
2	my	my	PRON	Case=Gen Number=Sing Person=1 Poss=Yes PronType=Prs	5 cousin	nmod:poss
3	4	4	NUM	NumForm=Digit NumType=Card	4 yo	nummod
4	yo	yo	NOUN	Number=Sing	5 cousin	compound
5	cousin	cousin	NOUN	Number=Sing	6 win	nsubj
6	win	win	VERB	Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin	1 let	parataxis
7	snap	snap	NOUN	Number=Sing	6 win	obj
8	,	,	PUNCT	_	10 cheating	punct
9	that	that	DET	Number=Sing PronType=Dem	10 cheating	det
10	cheating	cheating	NOUN	Number=Sing	7 snap	conj
11	?	?	PUNCT	_	1 let	punct

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	let	imperative	you not said here						vn give-13.1-1 «NP V PP.recipient»: agent=Agent
2	win	present	my yo cousin	snap and that cheating					vn succeed-74-2 «NP V NP»: agent=Agent snap=Eventuality

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

Yes, it's the worst cheating

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Yes	yes	INTJ	Polarity=Pos	7 cheating	discourse
2	,	,	PUNCT	_	1 Yes	punct
3	it	it	PRON	Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs	7 cheating	nsubj
4	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	7 cheating	cop
5	the	the	DET	Definite=Def PronType=Art	7 cheating	det
6	worst	bad	ADJ	Degree=Sup	7 cheating	amod
7	cheating	cheating	NOUN	Number=Sing	root	root

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is a	present	it	the worst cheating					tree rules

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

No, it's kind to let a small child win sometimes

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	No	no	INTJ	Polarity=Neg	5 kind	discourse
2	,	,	PUNCT	_	1 No	punct
3	it	it	PRON	Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs	5 kind	nsubj
4	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	5 kind	cop
5	kind	kind	ADJ	Degree=Pos	root	root
6	to	to	PART	_	7 let	mark
7	let	let	VERB	VerbForm=Inf	5 kind	xcomp
8	a	a	DET	Definite=Ind PronType=Art	10 child	det
9	small	small	ADJ	Degree=Pos	10 child	amod
10	child	child	NOUN	Number=Sing	7 let	obj
11	win	win	VERB	VerbForm=Inf	7 let	xcomp
12	sometimes	sometimes	ADV	PronType=Ind	5 kind	advmod

#	verb	tense, mood	who	what, whom	other	roles by
1	is	present	it		kind, sometimes property	tree rules
2	let	to-infinitive		a small child		tree rules
3	win	infinitive	a small child not said here			vn succeed-74-2 «NP V»: agent=Agent

Option 3

Yes, you must always try your hardest to win, whoever is playing

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Yes	yes	INTJ	Polarity=Pos	6 try	discourse
2	,	,	PUNCT	_	1 Yes	punct
3	you	you	PRON	Case=Nom Person=2 PronType=Prs	6 try	nsubj
4	must	must	AUX	VerbForm=Fin	6 try	aux
5	always	always	ADV	PronType=Tot	6 try	advmod
6	try	try	VERB	VerbForm=Inf	root	root
7	your	your	PRON	Case=Gen Person=2 Poss=Yes PronType=Prs	8 hardest	nmod:poss
8	hardest	hard	ADJ	Degree=Sup	6 try	obj
9	to	to	PART	_	10 win	mark
10	win	win	VERB	VerbForm=Inf	6 try	xcomp
11	,	,	PUNCT	_	12 whoever	punct
12	whoever	whoever	PRON	PronType=Rel	14 playing	nsubj
13	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	14 playing	aux
14	playing	play	VERB	Tense=Pres VerbForm=Part	6 try	parataxis

#	verb	tense, mood	who	what, whom	other	roles by
1	try	must	you	your hardest	always property	tree rules
2	win not said to happen	to-infinitive	you not said here			vn succeed-74-2 «NP V»: agent=Agent
3	play	present · progressive	whoever			vn performance-26.7-1 «NP V»: agent=Agent

Option 4

Only cheating if she notices

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Only	only	ADV	_	2 cheating	advmod
2	cheating	cheat	VERB	Tense=Pres VerbForm=Part	root	root
3	if	if	SCONJ	_	5 notices	mark
4	she	she	PRON	Case=Nom Gender=Fem Number=Sing Person=3 PronType=Prs	5 notices	nsubj
5	notices	notice	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	2 cheating	advcl

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	cheat	gerund							vn cheat-10.6.1 «NP V NP»: agent=Agent
2	notice a condition, not said to happen	present	she						vn see-30.1-1 «NP V S_ING»: agent=Experiencer

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/200-cheating-in-games/t11/