Mova0.5 pre-release⌕
☰
home / corpora / questions / Everyday / Playing fair and cheating in games / t3

Test 3 · ★ · Playing fair and cheating in games

Why would agreeing on rules before a game prevent arguments?

Mova's choice: option 4 · The right answer: option 4 · right ✓ · What happens: agree, prevent · To what, where: arguments

This is test 3 · ★ of lesson 200 «Playing fair and cheating in games» of the everyday 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

advmodauxcaseoblcasedetoblconjobjpunctrootWhyADVwouldAUXagreeingVERBonADPrulesNOUNbeforeADPaDETgameNOUNpreventVERBargumentsNOUN?PUNCT
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1WhywhyADVPronType=Int3 agreeingadvmod
2wouldwouldAUXVerbForm=Fin3 agreeingaux
3agreeingagreeVERBTense=Pres VerbForm=Partrootroot
4ononADP_5 rulescase
5rulesruleNOUNNumber=Plur3 agreeingobl
6beforebeforeADP_8 gamecase
7aaDETDefinite=Ind PronType=Art8 gamedet
8gamegameNOUNNumber=Sing3 agreeingobl
9preventpreventVERBVerbForm=Inf3 agreeingconj
10argumentsargumentNOUNNumber=Plur9 preventobj
11??PUNCT_3 agreeingpunct
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1agree speech: agreewouldbefore a gameon rulesvn correspond-36.1-1 «NP V PP.theme S»: agent=Agent on rule=Topic
2preventinfinitiveargumentsvn forbid-64.4-1 «NP V NP»: agent=Causer argument=Theme

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.

The options

Option 1

Because the loser gets to choose new rules

markdetnsubjmarkxcompamodobjrootBecauseSCONJtheDETloserNOUNgetsVERBtoPARTchooseVERBnewADJrulesNOUN
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1BecausebecauseSCONJ_4 getsmark
2thetheDETDefinite=Def PronType=Art3 loserdet
3loserloserNOUNNumber=Sing4 getsnsubj
4getsgetVERBMood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Finrootroot
5totoPART_6 choosemark
6choosechooseVERBVerbForm=Inf4 getsxcomp
7newnewADJDegree=Pos8 rulesamod
8rulesruleNOUNNumber=Plur6 chooseobj
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1getpresentthe loservn comprehend-87.2-1 «NP V how S_INF»: agent=Experiencer clause=Stimulus
2chooseto-infinitivethe loser not said herenew rulesvn get-13.5.1 «NP V NP»: agent=Agent rule=Theme

Option 2

Because games with rules are always boring

marknsubjcasenmodcopadvmodrootBecauseSCONJgamesNOUNwithADPrulesNOUNareAUXalwaysADVboringADJ
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1BecausebecauseSCONJ_7 boringmark
2gamesgameNOUNNumber=Plur7 boringnsubj
3withwithADP_4 rulescase
4rulesruleNOUNNumber=Plur2 gamesnmod
5arebeAUXMood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin7 boringcop
6alwaysalwaysADVPronType=Tot7 boringadvmod
7boringboringADJDegree=Posrootroot
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1ispresentgames with rulesalways, boring propertytree rules

Option 3

Because rules are only for the winners

caseoblcopadvmodcasedetrootBecauseADPrulesNOUNareAUXonlyADVforADPtheDETwinnersNOUN
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1BecausebecauseADPExtPos=ADP2 rulescase
2rulesruleNOUNNumber=Plur7 winnersobl
3arebeAUXMood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin7 winnerscop
4onlyonlyADV_7 winnersadvmod
5forforADP_7 winnerscase
6thetheDETDefinite=Def PronType=Art7 winnersdet
7winnerswinnerNOUNNumber=Plurrootroot
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1ispresentfor the winners; because rulestree rules

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

Nobody can change them halfway to win

nsubjauxobjadvmodmarkadvclrootNobodyPRONcanAUXchangeVERBthemPRONhalfwayADVtoPARTwinVERB
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1NobodynobodyPRONNumber=Sing PronType=Neg3 changensubj
2cancanAUXVerbForm=Fin3 changeaux
3changechangeVERBVerbForm=Infrootroot
4themtheyPRONCase=Acc Number=Plur Person=3 PronType=Prs3 changeobj
5halfwayhalfwayADV_3 changeadvmod
6totoPART_7 winmark
7winwinVERBVerbForm=Inf3 changeadvcl
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1changecanNobodythem = theyhalfway propertyvn dress-41.1.1-1-1 «NP V NP»: agent=Agent they=Patient
2winto-infinitiveNobody not said herevn succeed-74-2 «NP V»: agent=Agent

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/everyday/200-cheating-in-games/t3/