Olympiad: thinking like a machine, Bebras puzzles ★★★, sentence 12

In a knockout contest, every match knocks out exactly one player, so 8 players need 7 matches and 16 players need 15 to find one winner.

Who acts: match, 8 players, 16 players · What happens: knock out, need, find · To what, where: one player, knockout contest, 7 matches, 15, one winner

This is a sentence of the lesson «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the ai course of Mova's primary school. The page gives its syntax tree — a dependency tree in the style of Universal Dependencies — and its pragmatics clause by clause: who acts (match, 8 players, 16 players), what happens, when and where, as Mova's frames read it from the tree.

The tree

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	In	in	ADP	_	4 contest	case
2	a	a	DET	Definite=Ind PronType=Art	4 contest	det
3	knockout	knockout	NOUN	Number=Sing	4 contest	compound
4	contest	contest	NOUN	Number=Sing	8 knocks	obl
5	,	,	PUNCT	_	4 contest	punct
6	every	every	DET	PronType=Tot	7 match	det
7	match	match	NOUN	Number=Sing	8 knocks	nsubj
8	knocks	knock	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	root	root
9	out	out	ADP	_	8 knocks	compound:prt
10	exactly	exactly	ADV	_	11 one	advmod
11	one	one	NUM	NumForm=Word NumType=Card	12 player	nummod
12	player	player	NOUN	Number=Sing	8 knocks	obj
13	,	,	PUNCT	_	17 need	punct
14	so	so	ADV	_	17 need	advmod
15	8	8	NUM	NumForm=Digit NumType=Card	16 players	nummod
16	players	player	NOUN	Number=Plur	17 need	nsubj
17	need	need	VERB	Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin	8 knocks	conj
18	7	7	NUM	NumForm=Digit NumType=Card	19 matches	nummod
19	matches	match	NOUN	Number=Plur	17 need	obj
20	and	and	CCONJ	_	23 need	cc
21	16	16	NUM	NumForm=Digit NumType=Card	22 players	nummod
22	players	player	NOUN	Number=Plur	23 need	nsubj
23	need	need	VERB	Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin	17 need	conj
24	15	15	NUM	NumForm=Digit NumType=Card	23 need	obj
25	to	to	PART	_	26 find	mark
26	find	find	VERB	VerbForm=Inf	23 need	advcl
27	one	one	NUM	NumForm=Word NumType=Card	28 winner	nummod
28	winner	winner	NOUN	Number=Sing	26 find	obj
29	.	.	PUNCT	_	8 knocks	punct

Pragmatics

form: statement
act: assert
voice: narrator
polarity: none
teacher: kept the draft

#	verb	tense, mood	who	what, whom	where	roles by
1	knock out	present	every match	one player	a knockout contest	vn throw-17.1-1 «NP V NP PP.destinations»: agent=Agent player=Theme in contest=Destination
2	need	present	8 players	7 matches		vn want-32.1-1-1 «NP V NP ADV»: agent=Pivot match=Theme
3	need	present	16 players	15		vn want-32.1-1-1 «NP V NP ADV»: agent=Pivot 15=Theme
4	find	to-infinitive	16 players not said here	one winner		vn discover-84 «NP V NP»: agent=Agent winner=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.

Licence: CC BY-SA 4.0, as the whole of Mova corpus 0.4, of which this treebank (the agreed school, mova-school-agreed-en.conllu) is part. The lessons were written for Mova's primary school. Sentence school:ai:031-olympiad-thinking-like-a-machine.lesson:12.

The tree: Mova annot: Rust (en) → Haiku 5.5 (medium, Batches API) patches; gates UD 2.18; agreed by treeagree rules (Stanza, Trankit, spaCy trf): R7-rel-agree ×1. The frames are read from the tree by Mova's frames reader (prag) when this page is built, the lesson read in order, so a pronoun may be resolved from an earlier sentence.

See the release 0.4.

This page in Markdown → https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/12/