Exam question 2 · Olympiad: claims, clues and tricky messages ★★★
It is given that a program answers correctly in nine instances out of every ten. Ascertain the approximate number of incorrect answers among forty.
Mova's choice: option 1 · The right answer: option 3 · wrong ✗ · Who acts: program, you · What happens: give, answer, ascertain · To what, where: It, nine instances, approximate number
This is exam question 2 of lesson 32 «Olympiad: claims, clues and tricky messages ★★★» of the AI course of Mova's primary school, asked in stiff, formal language. 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: It is given that a program answers correctly in nine instances out of every ten.
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | It | it | PRON | Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs | 3 given | nsubj:pass |
| 2 | is | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 3 given | aux:pass |
| 3 | given | give | VERB | Tense=Past VerbForm=Part Voice=Pass | root | root |
| 4 | that | that | SCONJ | _ | 7 answers | mark |
| 5 | a | a | DET | Definite=Ind PronType=Art | 6 program | det |
| 6 | program | program | NOUN | Number=Sing | 7 answers | nsubj |
| 7 | answers | answer | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 3 given | advcl |
| 8 | correctly | correctly | ADV | _ | 7 answers | advmod |
| 9 | in | in | ADP | _ | 11 instances | case |
| 10 | nine | nine | NUM | NumForm=Word NumType=Card | 11 instances | nummod |
| 11 | instances | instance | NOUN | Number=Plur | 7 answers | obl |
| 12 | out | out | ADP | _ | 15 ten | case |
| 13 | of | of | ADP | _ | 15 ten | case |
| 14 | every | every | DET | PronType=Tot | 15 ten | det |
| 15 | ten | ten | NUM | NumForm=Word NumType=Card | 11 instances | nmod |
| 16 | . | . | PUNCT | _ | 3 given | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | give | present · passive | It | vn give-13.1-1 «NP V NP»: subject=Theme | |||||
| 2 | answer speech: assert | present | a program | nine instances out every ten | correctly property | vn reciprocate-112-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: Ascertain the approximate number of incorrect answers among forty.
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Ascertain | ascertain | VERB | Mood=Imp VerbForm=Fin | root | root |
| 2 | the | the | DET | Definite=Def PronType=Art | 4 number | det |
| 3 | approximate | approximate | ADJ | Degree=Pos | 4 number | amod |
| 4 | number | number | NOUN | Number=Sing | 1 Ascertain | obj |
| 5 | of | of | ADP | _ | 7 answers | case |
| 6 | incorrect | incorrect | ADJ | Degree=Pos | 7 answers | amod |
| 7 | answers | answer | NOUN | Number=Plur | 4 number | nmod |
| 8 | among | among | ADP | _ | 9 forty | case |
| 9 | forty | forty | NUM | NumForm=Word NumType=Card | 7 answers | nmod |
| 10 | . | . | PUNCT | _ | 1 Ascertain | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | ascertain | imperative | you not said here | the approximate number of incorrect answers among forty | vn discover-84 «NP V NP»: agent=Agent number=Topic |
The options
Option 1 · ← Mova's choice
9
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 9 | 9 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 2
36
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 36 | 36 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 3 · ✓ the right answer
4
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 4 | 4 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 4
10
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 10 | 10 | 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/32-olympiad-claims-clues-and-tricky-messages/e2/