--- title: In a knockout contest, every match knocks out exactly one player, so… — Olympiad: thinking like a machine, Bebras puzzle… · tree and pragmatics description: 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. A sentence of the lesson «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the ai course of Mova's primary school --- [Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/12/) [home](https://md.mova.elamur.ai/free/en/) / [corpora](https://md.mova.elamur.ai/free/en/corpora/) / [school](https://md.mova.elamur.ai/free/en/corpora/school/) / [AI](https://md.mova.elamur.ai/free/en/corpora/school/ai/) / [Olympiad: thinking like a machine, Beb…](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/) / 12 # 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 {#tree} ```conllu # sent_id = school:ai:031-olympiad-thinking-like-a-machine.lesson:12 # text = 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. # source = school lesson (ours) # course = ai # lesson = 031-olympiad-thinking-like-a-machine.lesson # annotation = 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 1 In in ADP IN _ 4 case _ _ 2 a a DET DT Definite=Ind|PronType=Art 4 det _ _ 3 knockout knockout NOUN NN Number=Sing 4 compound _ _ 4 contest contest NOUN NN Number=Sing 8 obl _ _ 5 , , PUNCT , _ 4 punct _ _ 6 every every DET DT PronType=Tot 7 det _ _ 7 match match NOUN NN Number=Sing 8 nsubj _ _ 8 knocks knock VERB VBZ Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin 0 root _ _ 9 out out ADP RP _ 8 compound:prt _ _ 10 exactly exactly ADV RB _ 11 advmod _ _ 11 one one NUM CD NumForm=Word|NumType=Card 12 nummod _ _ 12 player player NOUN NN Number=Sing 8 obj _ _ 13 , , PUNCT , _ 17 punct _ _ 14 so so ADV RB _ 17 advmod _ _ 15 8 8 NUM CD NumForm=Digit|NumType=Card 16 nummod _ _ 16 players player NOUN NNS Number=Plur 17 nsubj _ _ 17 need need VERB VBP Mood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin 8 conj _ _ 18 7 7 NUM CD NumForm=Digit|NumType=Card 19 nummod _ _ 19 matches match NOUN NNS Number=Plur 17 obj _ _ 20 and and CCONJ CC _ 23 cc _ _ 21 16 16 NUM CD NumForm=Digit|NumType=Card 22 nummod _ _ 22 players player NOUN NNS Number=Plur 23 nsubj _ _ 23 need need VERB VBP Mood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin 17 conj _ _ 24 15 15 NUM CD NumForm=Digit|NumType=Card 23 obj _ _ 25 to to PART TO _ 26 mark _ _ 26 find find VERB VB VerbForm=Inf 23 advcl _ Agree=R7-rel-agree|Haiku=23:xcomp 27 one one NUM CD NumForm=Word|NumType=Card 28 nummod _ _ 28 winner winner NOUN NN Number=Sing 26 obj _ _ 29 . . PUNCT . _ 8 punct _ _ ``` ## Pragmatics {#pragmatics} - form: statement - act: assert - voice: narrator - polarity: none - teacher: kept the draft | # | verb | tense, mood | who | what, whom | to whom | where | when | other | 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](https://creativecommons.org/licenses/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](https://md.mova.elamur.ai/free/en/releases/0.4/). - ← previous: [Olympiad: thinking like a machine, Beb…, 11](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/11/) - next →: [Olympiad: thinking like a machine, Beb…, 13](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/13/) - ↑ back to [the lesson](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/)