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

Grandad: "Back in my day we just picked teams, best first. Fair's fair." What's a fair reply?

Mova's choice: option 3 · The right answer: option 1 · wrong ✗ · Who acts: we · What happens: pick, be · To what, where: teams, fair reply

This is test 9 · ★★★ 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: Grandad: "Back in my day we just picked teams, best first.

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Grandad	Grandad	PROPN	Number=Sing	4 Back	nsubj
2	:	:	PUNCT	_	4 Back	punct
3	"	"	PUNCT	_	4 Back	punct
4	Back	back	ADV	_	root	root
5	in	in	ADP	_	7 day	case
6	my	my	PRON	Case=Gen Number=Sing Person=1 Poss=Yes PronType=Prs	7 day	nmod:poss
7	day	day	NOUN	Number=Sing	4 Back	obl
8	we	we	PRON	Case=Nom Number=Plur Person=1 PronType=Prs	10 picked	nsubj
9	just	just	ADV	_	10 picked	advmod
10	picked	pick	VERB	Mood=Ind Number=Plur Person=1 Tense=Past VerbForm=Fin	7 day	acl:relcl
11	teams	team	NOUN	Number=Plur	10 picked	obj
12	,	,	PUNCT	_	13 best	punct
13	best	good	ADJ	Degree=Sup	10 picked	obj
14	first	first	ADV	NumForm=Word NumType=Ord	10 picked	advmod
15	.	.	PUNCT	_	4 Back	punct

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	pick in a quote	past	we	teams				first property	vn get-13.5.1 «NP V NP.beneficiary NP»: agent=Agent team=Beneficiary good=Theme

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: Fair's fair."

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Fair	Fair	PROPN	Number=Sing	3 fair	nmod:poss
2	's	's	PART	_	1 Fair	case
3	fair	fair	ADJ	Degree=Pos	root	root
4	.	.	PUNCT	_	3 fair	punct
5	"	"	PUNCT	_	3 fair	punct

The frames reader finds no event or fact in this sentence.

Sentence 3: What's a fair reply?

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	What	what	PRON	PronType=Int	5 reply	nsubj
2	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	5 reply	cop
3	a	a	DET	Definite=Ind PronType=Art	5 reply	det
4	fair	fair	ADJ	Degree=Pos	5 reply	amod
5	reply	reply	NOUN	Number=Sing	root	root
6	?	?	PUNCT	_	5 reply	punct

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

The options

Option 1 · ✓ the right answer

Picking the best first leaves the same kids last; drawing names or numbering off is fairer

The tree, 16 words

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Picking	pick	VERB	VerbForm=Ger	5 leaves	csubj
2	the	the	DET	Definite=Def PronType=Art	3 best	det
3	best	good	ADJ	Degree=Sup	1 Picking	obj
4	first	first	ADV	NumForm=Word NumType=Ord	1 Picking	advmod
5	leaves	leave	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	root	root
6	the	the	DET	Definite=Def PronType=Art	8 kids	det
7	same	same	ADJ	Degree=Pos	8 kids	amod
8	kids	kid	NOUN	Number=Plur	9 last	nsubj
9	last	last	VERB	Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin	5 leaves	ccomp
10	;	;	PUNCT	_	11 drawing	punct
11	drawing	draw	VERB	VerbForm=Ger	17 fairer	csubj
12	names	name	NOUN	Number=Plur	11 drawing	obj
13	or	or	CCONJ	_	14 numbering	cc
14	numbering	number	VERB	VerbForm=Ger	11 drawing	conj
15	off	off	ADP	_	14 numbering	compound:prt
16	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	17 fairer	cop
17	fairer	fair	ADJ	Degree=Cmp	5 leaves	parataxis

#	verb	tense, mood	who	what, whom	other	roles by
1	pick	gerund		the best	first property	vn chew-39.2 «NP V NP»: agent=Agent good=Patient
2	leave	present	Picking			tree rules
3	last	present	the same kids			vn cost-54.2 «NP V NP.value»: agent=Theme
4	draw	gerund		names		vn scribble-25.2-1 «NP V NP»: agent=Agent name=Theme
5	number off	gerund				vn classify-29.10 «NP V NP»: agent=Agent
6	is	present	drawing		fair property	tree rules

Option 2

The slowest should always be captain

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	The	the	DET	Definite=Def PronType=Art	2 slowest	det
2	slowest	slow	ADJ	Degree=Sup	root	root
3	should	should	AUX	VerbForm=Fin	6 captain	aux
4	always	always	ADV	PronType=Tot	6 captain	advmod
5	be	be	AUX	VerbForm=Inf	6 captain	cop
6	captain	captain	NOUN	Number=Sing	2 slowest	parataxis

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is a	should		captain				always property	tree rules

Option 3 · ← Mova's choice

Teams should be picked by height

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Teams	team	NOUN	Number=Plur	4 picked	nsubj:pass
2	should	should	AUX	VerbForm=Fin	4 picked	aux
3	be	be	AUX	VerbForm=Inf	4 picked	aux:pass
4	picked	pick	VERB	Tense=Past VerbForm=Part Voice=Pass	root	root
5	by	by	ADP	_	6 height	case
6	height	height	NOUN	Number=Sing	4 picked	obl

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	pick	should · passive	height	Teams					vn chew-39.2 «NP V NP»: agent=Agent subject=Patient

Option 4

Yes, best first is the only fair way, because then the strongest players can win the match

The tree, 17 words

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Yes	yes	INTJ	Polarity=Pos	3 best	discourse
2	,	,	PUNCT	_	1 Yes	punct
3	best	good	ADJ	Degree=Sup	9 way	amod
4	first	first	ADV	NumForm=Word NumType=Ord	3 best	advmod
5	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	9 way	cop
6	the	the	DET	Definite=Def PronType=Art	9 way	det
7	only	only	ADJ	Degree=Pos	9 way	amod
8	fair	fair	ADJ	Degree=Pos	9 way	amod
9	way	way	NOUN	Number=Sing	root	root
10	,	,	PUNCT	_	9 way	punct
11	because	because	SCONJ	_	17 win	mark
12	then	then	ADV	PronType=Dem	17 win	advmod
13	the	the	DET	Definite=Def PronType=Art	15 players	det
14	strongest	strong	ADJ	Degree=Sup	15 players	amod
15	players	player	NOUN	Number=Plur	17 win	nsubj
16	can	can	AUX	VerbForm=Fin	17 win	aux
17	win	win	VERB	VerbForm=Inf	9 way	acl
18	the	the	DET	Definite=Def PronType=Art	19 match	det
19	match	match	NOUN	Number=Sing	17 win	obj

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is a	present		the best only fair way					tree rules
2	win	can	the strongest players	the match			then		vn succeed-74-2 «NP V NP»: agent=Agent match=Eventuality

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/t9/