Mova0.5 pre-release⌕
☰
home / corpora / questions / AI / Olympiad: thinking like a machine, Beb… / e2

Exam question 2 · Olympiad: thinking like a machine, Bebras puzzles ★★★

It is given that a knockout competition commences with 32 entrants and that each match eliminates precisely one entrant. Determine the number of matches required.

Mova's choice: option 1 · The right answer: option 1 · right ✓ · Who acts: knockout competition, match, you · What happens: give, commence, eliminate, determine, require · To what, where: It, one entrant, number, matches

This is exam question 2 of lesson 31 «Olympiad: thinking like a machine, Bebras puzzles ★★★» 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 knockout competition commences with 32 entrants and that each match eliminates precisely one entrant.

nsubj:passaux:passmarkdetcompoundnsubjadvclcasenummodoblccmarkdetnsubjconjadvmodnummodobjpunctrootItPRONisAUXgivenVERBthatSCONJaDETknockoutNOUNcompetitionNOUNcommencesVERBwithADP32NUMentrantsNOUNandCCONJthatSCONJeachDETmatchNOUNeliminatesVERBpreciselyADVoneNUMentrantNOUN.PUNCT
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1ItitPRONCase=Nom Gender=Neut Number=Sing Person=3 PronType=Prs3 givennsubj:pass
2isbeAUXMood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin3 givenaux:pass
3givengiveVERBTense=Past VerbForm=Part Voice=Passrootroot
4thatthatSCONJ_8 commencesmark
5aaDETDefinite=Ind PronType=Art7 competitiondet
6knockoutknockoutNOUNNumber=Sing7 competitioncompound
7competitioncompetitionNOUNNumber=Sing8 commencesnsubj
8commencescommenceVERBMood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin3 givenadvcl
9withwithADP_11 entrantscase
103232NUMNumForm=Digit NumType=Card11 entrantsnummod
11entrantsentrantNOUNNumber=Plur8 commencesobl
12andandCCONJ_16 eliminatescc
13thatthatSCONJ_16 eliminatesmark
14eacheachDETPronType=Tot15 matchdet
15matchmatchNOUNNumber=Sing16 eliminatesnsubj
16eliminateseliminateVERBMood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin8 commencesconj
17preciselypreciselyADV_18 oneadvmod
18oneoneNUMNumForm=Word NumType=Card19 entrantnummod
19entrantentrantNOUNNumber=Sing16 eliminatesobj
20..PUNCT_3 givenpunct
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1givepresent · passiveItvn give-13.1-1 «NP V NP»: subject=Theme
2commencepresenta knockout competitionwith 32 entrantsvn begin-55.1-1-1 «NP V PP.subeventuality»: agent=Eventuality with entrant=Subeventuality
3eliminatepresenteach matchone entrantvn murder-42.1 «NP V NP»: agent=Agent entrant=Patient

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: Determine the number of matches required.

detobjcasenmodaclpunctrootDetermineVERBtheDETnumberNOUNofADPmatchesNOUNrequiredVERB.PUNCT
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1DeterminedetermineVERBMood=Imp VerbForm=Finrootroot
2thetheDETDefinite=Def PronType=Art3 numberdet
3numbernumberNOUNNumber=Sing1 Determineobj
4ofofADP_5 matchescase
5matchesmatchNOUNNumber=Plur3 numbernmod
6requiredrequireVERBTense=Past VerbForm=Part Voice=Pass5 matchesacl
7..PUNCT_1 Determinepunct
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1determineimperativeyou not said herethe number of matchesvn discover-84 «NP V NP»: agent=Agent number=Topic
2requireparticiplematches not said herevn require-103-1 «NP V NP S_INF»: agent=Theme

The options

Option 1 · ← Mova's choice · ✓ the right answer

31

root31NUM
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
13131NUMNumForm=Digit NumType=Cardrootroot

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

Option 2

64

root64NUM
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
16464NUMNumForm=Digit NumType=Cardrootroot

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

Option 3

16

root16NUM
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
11616NUMNumForm=Digit NumType=Cardrootroot

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

Option 4

32

root32NUM
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
13232NUMNumForm=Digit NumType=Cardrootroot

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