Test 10 · ★★★ · Olympiad: fair or unfair, chains of reasons and dilemmas ★★★

"If it's not against the rules, it's fair, no cap," says Max, who sat on the ball so nobody else could play. What's the flaw?

Mova's choice: option 1 · The right answer: option 1 · right ✓ · Who acts: it, rules, Max, nobody, flaw · What happens: not be, be, say, sit, play · To what, where: ball · Speech: someone speaks here

This is test 10 · ★★★ of lesson 103 «Olympiad: fair or unfair, chains of reasons and dilemmas ★★★» of the religion ethics 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

Sentence 1: "If it's not against the rules, it's fair, no cap," says Max, who sat on the ball so nobody else could play.

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	"	"	PUNCT	_	12 fair	punct
2	If	if	SCONJ	_	8 rules	mark
3	it	it	PRON	Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs	8 rules	nsubj
4	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	8 rules	cop
5	not	not	PART	Polarity=Neg	8 rules	advmod
6	against	against	ADP	_	8 rules	case
7	the	the	DET	Definite=Def PronType=Art	8 rules	det
8	rules	rule	NOUN	Number=Plur	12 fair	nsubj
9	,	,	PUNCT	_	8 rules	punct
10	it	it	PRON	Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs	12 fair	expl
11	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	12 fair	cop
12	fair	fair	ADJ	Degree=Pos	18 says	ccomp
13	,	,	PUNCT	_	15 cap	punct
14	no	no	DET	PronType=Neg	15 cap	det
15	cap	cap	NOUN	Number=Sing	12 fair	parataxis
16	,	,	PUNCT	_	12 fair	punct
17	"	"	PUNCT	_	12 fair	punct
18	says	say	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	root	root
19	Max	Max	PROPN	Number=Sing	18 says	nsubj
20	,	,	PUNCT	_	22 sat	punct
21	who	who	PRON	PronType=Rel	22 sat	nsubj
22	sat	sit	VERB	Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin	19 Max	acl:relcl
23	on	on	ADP	_	25 ball	case
24	the	the	DET	Definite=Def PronType=Art	25 ball	det
25	ball	ball	NOUN	Number=Sing	22 sat	obl
26	so	so	SCONJ	_	30 play	mark
27	nobody	nobody	PRON	Number=Sing PronType=Neg	30 play	nsubj
28	else	else	ADV	_	27 nobody	advmod
29	could	could	AUX	VerbForm=Fin	30 play	aux
30	play	play	VERB	VerbForm=Inf	22 sat	advcl
31	.	.	PUNCT	_	18 says	punct

#	verb	tense, mood	who	where	other	roles by
1	not is a condition, not said to happen, in a quote	present	it		against the rules	tree rules
2	is in a quote	present	the rules		fair property	tree rules
3	say speech: assert	present	Max			vn say-37.7-1-1 «NP V that S»: agent=Agent
4	sit	past	Max	the ball		vn assuming_position-50 «NP V PP.location»: agent=Agent on ball=Location
5	play	could	nobody			vn performance-26.7-1 «NP V»: agent=Agent

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.

Sentence 2: What's the flaw?

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	What	what	PRON	PronType=Int	root	root
2	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	1 What	cop
3	the	the	DET	Definite=Def PronType=Art	4 flaw	det
4	flaw	flaw	NOUN	Number=Sing	1 What	nsubj
5	?	?	PUNCT	_	1 What	punct

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

The options

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

Something can break no rule and still be unfair, like hogging the ball so others can't play

The tree, 18 words

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Something	something	PRON	Number=Sing PronType=Ind	3 break	nsubj
2	can	can	AUX	VerbForm=Fin	3 break	aux
3	break	break	VERB	VerbForm=Inf	root	root
4	no	no	DET	PronType=Neg	5 rule	det
5	rule	rule	NOUN	Number=Sing	3 break	obj
6	and	and	CCONJ	_	9 unfair	cc
7	still	still	ADV	_	9 unfair	advmod
8	be	be	AUX	VerbForm=Inf	9 unfair	cop
9	unfair	unfair	ADJ	Degree=Pos	3 break	conj
10	,	,	PUNCT	_	12 hogging	punct
11	like	like	SCONJ	_	12 hogging	mark
12	hogging	hog	VERB	Tense=Pres VerbForm=Part	3 break	advcl
13	the	the	DET	Definite=Def PronType=Art	14 ball	det
14	ball	ball	NOUN	Number=Sing	12 hogging	obj
15	so	so	SCONJ	_	19 play	mark
16	others	other	NOUN	Number=Plur	19 play	nsubj
17	ca	can	AUX	VerbForm=Fin	19 play	aux
18	n't	not	PART	Polarity=Neg	19 play	advmod
19	play	play	VERB	VerbForm=Inf	3 break	advcl

#	verb	tense, mood	who	what, whom	when	other	roles by
1	break	can	Something	no rule			vn hurt-40.8.3-1-1 «NP V NP»: agent=Experiencer rule=Patient
2	is	infinitive	Something not said here		still	unfair property	tree rules
3	hog	gerund	Something not said here	the ball			vn berry-13.7 «NP V NP»: agent=Agent ball=Location
4	not play	can	others				vn performance-26.7-1 «NP V»: agent=Agent

Option 2

He's right: anything that is allowed by the rules is fair, so sitting on the ball is fine as well

The tree, 21 words

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	He	he	PRON	Case=Nom Gender=Masc Number=Sing Person=3 PronType=Prs	3 right	nsubj
2	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	3 right	cop
3	right	right	ADJ	Degree=Pos	root	root
4	:	:	PUNCT	_	5 anything	punct
5	anything	anything	PRON	Number=Sing PronType=Ind	13 fair	nsubj
6	that	that	PRON	PronType=Rel	8 allowed	nsubj:pass
7	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	8 allowed	aux:pass
8	allowed	allow	VERB	Tense=Past VerbForm=Part Voice=Pass	5 anything	acl:relcl
9	by	by	ADP	_	11 rules	case
10	the	the	DET	Definite=Def PronType=Art	11 rules	det
11	rules	rule	NOUN	Number=Plur	8 allowed	obl
12	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	13 fair	cop
13	fair	fair	ADJ	Degree=Pos	3 right	ccomp
14	,	,	PUNCT	_	21 fine	punct
15	so	so	ADV	_	21 fine	advmod
16	sitting	sit	VERB	VerbForm=Ger	21 fine	csubj
17	on	on	ADP	_	19 ball	case
18	the	the	DET	Definite=Def PronType=Art	19 ball	det
19	ball	ball	NOUN	Number=Sing	16 sitting	obl
20	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	21 fine	cop
21	fine	fine	ADJ	Degree=Pos	3 right	conj
22	as	as	ADV	ExtPos=ADV	21 fine	advmod
23	well	well	ADV	Degree=Pos	22 as	fixed

#	verb	tense, mood	who	where	other	roles by
1	is	present	He		right property	tree rules
2	allow	present · passive	the rules			vn allow-64.1-1 «NP V NP»: agent=Agent subject=Beneficiary
3	is	present	anything		fair property	tree rules
4	sit	gerund		the ball		vn assuming_position-50 «NP V PP.location»: agent=Agent on ball=Location
5	is	present	sitting		fine property	tree rules

Option 3

Fairness only matters in board games

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Fairness	fairness	NOUN	Number=Sing	3 matters	nsubj
2	only	only	ADV	_	3 matters	advmod
3	matters	matter	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	root	root
4	in	in	ADP	_	6 games	case
5	board	board	NOUN	Number=Sing	6 games	compound
6	games	game	NOUN	Number=Plur	3 matters	obl

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	matter	present	Fairness			board games			vn matter-91 «NP V»: agent=Stimulus

Option 4

Sitting on a ball is always against the rules

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Sitting	sit	VERB	VerbForm=Ger	9 rules	csubj
2	on	on	ADP	_	4 ball	case
3	a	a	DET	Definite=Ind PronType=Art	4 ball	det
4	ball	ball	NOUN	Number=Sing	1 Sitting	obl
5	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	9 rules	cop
6	always	always	ADV	PronType=Tot	9 rules	advmod
7	against	against	ADP	_	9 rules	case
8	the	the	DET	Definite=Def PronType=Art	9 rules	det
9	rules	rule	NOUN	Number=Plur	root	root

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	sit	gerund				a ball			vn assuming_position-50 «NP V PP.location»: agent=Agent on ball=Location
2	is	present	Sitting					against the rules; always 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/religion-ethics/103-olympiad-fair-or-unfair-chains-of-reasons-and-dilemmas/t10/