Test 3 · ★ · Swaps and barter in the playground
Ollie reckons "if it's 2 for 1, I always win cos I get the rare one." Is he right?
Mova's choice: option 2 · The right answer: option 1 · wrong ✗ · Who acts: Ollie, it, I · What happens: reckon, be, win, get · To what, where: 2, rare one
This is test 3 · ★ of lesson 4 «Swaps and barter in the playground» of the money 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: Ollie reckons "if it's 2 for 1, I always win cos I get the rare one."
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Ollie | Ollie | PROPN | Number=Sing | 2 reckons | nsubj |
| 2 | reckons | reckon | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | root | root |
| 3 | " | " | PUNCT | _ | 7 2 | punct |
| 4 | if | if | SCONJ | _ | 7 2 | mark |
| 5 | it | it | PRON | Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs | 7 2 | nsubj |
| 6 | 's | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 7 2 | cop |
| 7 | 2 | 2 | NUM | NumForm=Digit NumType=Card | 2 reckons | obl |
| 8 | for | for | ADP | _ | 9 1 | case |
| 9 | 1 | 1 | NUM | NumForm=Digit NumType=Card | 7 2 | nmod |
| 10 | , | , | PUNCT | _ | 13 win | punct |
| 11 | I | I | PRON | Case=Nom Number=Sing Person=1 PronType=Prs | 13 win | nsubj |
| 12 | always | always | ADV | PronType=Tot | 13 win | advmod |
| 13 | win | win | VERB | Mood=Ind Number=Sing Person=1 Tense=Pres VerbForm=Fin | 2 reckons | conj |
| 14 | cos | cos | SCONJ | _ | 16 get | mark |
| 15 | I | I | PRON | Case=Nom Number=Sing Person=1 PronType=Prs | 16 get | nsubj |
| 16 | get | get | VERB | Mood=Ind Number=Sing Person=1 Tense=Pres VerbForm=Fin | 13 win | advcl |
| 17 | the | the | DET | Definite=Def PronType=Art | 19 one | det |
| 18 | rare | rare | ADJ | Degree=Pos | 19 one | amod |
| 19 | one | one | NOUN | Number=Sing | 16 get | obj |
| 20 | . | . | PUNCT | _ | 2 reckons | punct |
| 21 | " | " | PUNCT | _ | 2 reckons | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | reckon | present | Ollie | vn consider-29.9-1 «NP V how S»: agent=Agent | |||||
| 2 | is a a condition, not said to happen, in a quote | present | it | 2 | for 1 | tree rules | |||
| 3 | win in a quote | present | I | always property | vn succeed-74-2 «NP V»: agent=Agent | ||||
| 4 | get in a quote | present | I | the rare one | vn comprehend-87.2-1 «NP V NP»: agent=Experiencer one=Stimulus |
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: Is he right?
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Is | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 3 right | cop |
| 2 | he | he | PRON | Case=Nom Gender=Masc Number=Sing Person=3 PronType=Prs | 3 right | nsubj |
| 3 | right | right | ADJ | Degree=Pos | root | root |
| 4 | ? | ? | PUNCT | _ | 3 right | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | is | present | Ollie | right property | tree rules |
The options
Option 1 · ✓ the right answer
Not always, the "rare" one might be common and he loses a card
The tree, 13 words
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Not | not | PART | Polarity=Neg | 2 always | advmod |
| 2 | always | always | ADV | PronType=Tot | 11 common | advmod |
| 3 | , | , | PUNCT | _ | 2 always | punct |
| 4 | the | the | DET | Definite=Def PronType=Art | 8 one | det |
| 5 | " | " | PUNCT | _ | 6 rare | punct |
| 6 | rare | rare | ADJ | Degree=Pos | 8 one | amod |
| 7 | " | " | PUNCT | _ | 6 rare | punct |
| 8 | one | one | NUM | NumForm=Word NumType=Card | 11 common | nsubj |
| 9 | might | might | AUX | VerbForm=Fin | 11 common | aux |
| 10 | be | be | AUX | VerbForm=Inf | 11 common | cop |
| 11 | common | common | ADJ | Degree=Pos | root | root |
| 12 | and | and | CCONJ | _ | 14 loses | cc |
| 13 | he | he | PRON | Case=Nom Gender=Masc Number=Sing Person=3 PronType=Prs | 14 loses | nsubj |
| 14 | loses | lose | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 11 common | conj |
| 15 | a | a | DET | Definite=Ind PronType=Art | 16 card | det |
| 16 | card | card | NOUN | Number=Sing | 14 loses | obj |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | is | might | the rare one | always, common property | tree rules | ||||
| 2 | lose | present | he | a card | vn succeed-74-3-1 «NP V NP»: agent=Agent card=Eventuality |
Option 2 · ← Mova's choice
No, swaps can never be fair
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | No | no | INTJ | Polarity=Neg | 7 fair | discourse |
| 2 | , | , | PUNCT | _ | 1 No | punct |
| 3 | swaps | swap | NOUN | Number=Plur | 7 fair | nsubj |
| 4 | can | can | AUX | VerbForm=Fin | 7 fair | aux |
| 5 | never | never | ADV | PronType=Neg | 7 fair | advmod |
| 6 | be | be | AUX | VerbForm=Inf | 7 fair | cop |
| 7 | fair | fair | ADJ | Degree=Pos | root | root |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | not is | can | swaps | fair property | tree rules |
Option 3
Yes, 1 card is always worth more than 2
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Yes | yes | INTJ | Polarity=Pos | 7 worth | discourse |
| 2 | , | , | PUNCT | _ | 1 Yes | punct |
| 3 | 1 | 1 | NUM | NumForm=Digit NumType=Card | 4 card | nummod |
| 4 | card | card | NOUN | Number=Sing | 7 worth | nsubj |
| 5 | is | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 7 worth | cop |
| 6 | always | always | ADV | PronType=Tot | 7 worth | advmod |
| 7 | worth | worth | ADJ | Degree=Pos | root | root |
| 8 | more | more | ADJ | Degree=Cmp ExtPos=ADV | 10 2 | advmod |
| 9 | than | than | ADP | _ | 8 more | fixed |
| 10 | 2 | 2 | NUM | NumForm=Digit NumType=Card | 7 worth | obj |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | is | present | 1 card | always, worth property | tree rules |
Option 4
Yes, getting the rare one always means you win
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Yes | yes | INTJ | Polarity=Pos | 3 getting | discourse |
| 2 | , | , | PUNCT | _ | 1 Yes | punct |
| 3 | getting | get | VERB | VerbForm=Ger | 8 means | csubj |
| 4 | the | the | DET | Definite=Def PronType=Art | 6 one | det |
| 5 | rare | rare | ADJ | Degree=Pos | 6 one | amod |
| 6 | one | one | NOUN | Number=Sing | 3 getting | obj |
| 7 | always | always | ADV | PronType=Tot | 8 means | advmod |
| 8 | means | mean | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | root | root |
| 9 | you | you | PRON | Case=Nom Person=2 PronType=Prs | 10 win | nsubj |
| 10 | win | win | VERB | Mood=Ind Number=Sing Person=2 Tense=Pres VerbForm=Fin | 8 means | ccomp |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | get | gerund | the rare one | vn comprehend-87.2-1 «NP V NP»: agent=Experiencer one=Stimulus | |||||
| 2 | mean | present | getting | always property | vn intend-61.2-1 «NP V S»: agent=Agent clause=Topic | ||||
| 3 | win | present | you | vn 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/money/4-swaps-and-barter-in-the-playground/t3/