Test 5 · ★★★ · Olympiad: thinking like a machine, Bebras puzzles ★★★
"Gran reckons a knockout for 16 teams takes forever, like a hundred matches". How many matches are really needed?
Mova's choice: option 3 · The right answer: option 3 · right ✓ · Who acts: Gran, knockout · What happens: reckon, take, need · To what, where: many matches · Speech: someone speaks here
This is test 5 · ★★★ of lesson 31 «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the AI 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: "Gran reckons a knockout for 16 teams takes forever, like a hundred matches".
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | " | " | PUNCT | _ | 3 reckons | punct |
| 2 | Gran | Gran | PROPN | Number=Sing | 3 reckons | nsubj |
| 3 | reckons | reckon | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | root | root |
| 4 | a | a | DET | Definite=Ind PronType=Art | 5 knockout | det |
| 5 | knockout | knockout | NOUN | Number=Sing | 9 takes | nsubj |
| 6 | for | for | ADP | _ | 8 teams | case |
| 7 | 16 | 16 | NUM | NumForm=Digit NumType=Card | 8 teams | nummod |
| 8 | teams | team | NOUN | Number=Plur | 5 knockout | nmod |
| 9 | takes | take | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 3 reckons | ccomp |
| 10 | forever | forever | ADV | _ | 9 takes | advmod |
| 11 | , | , | PUNCT | _ | 15 matches | punct |
| 12 | like | like | ADP | _ | 15 matches | case |
| 13 | a | a | DET | Definite=Ind PronType=Art | 14 hundred | det |
| 14 | hundred | hundred | NUM | NumForm=Word NumType=Card | 15 matches | nummod |
| 15 | matches | match | NOUN | Number=Plur | 9 takes | parataxis |
| 16 | " | " | PUNCT | _ | 15 matches | punct |
| 17 | . | . | PUNCT | _ | 3 reckons | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | reckon in a quote | present | Gran | vn consider-29.9-1 «NP V how S»: agent=Agent clause=Theme | |||||
| 2 | take in a quote | present | a knockout for 16 teams | forever property | vn bring-11.3 «NP V NP»: 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: How many matches are really needed?
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | How | how | ADV | PronType=Int | 2 many | advmod |
| 2 | many | many | ADJ | Degree=Pos | 3 matches | amod |
| 3 | matches | match | NOUN | Number=Plur | 6 needed | nsubj:pass |
| 4 | are | be | AUX | Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin | 6 needed | aux:pass |
| 5 | really | really | ADV | _ | 6 needed | advmod |
| 6 | needed | need | VERB | Tense=Past VerbForm=Part Voice=Pass | root | root |
| 7 | ? | ? | PUNCT | _ | 6 needed | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | need | present · passive | many matches | vn want-32.1-1-1 «NP V NP ADV»: subject=Theme |
The options
Option 1
8
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 8 | 8 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 2
16
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 16 | 16 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 3 · ← Mova's choice · ✓ the right answer
15
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 15 | 15 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 4
100
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 100 | 100 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
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/ai/31-olympiad-thinking-like-a-machine/t5/