Test 7 · ★★ · Computers and screens
Count them: in binary, each switch is on or off. How many different patterns can 2 switches make?
Mova's choice: option 1 · The right answer: option 2 · wrong ✗ · Who acts: you, switch, many different patterns · What happens: count, be, make · To what, where: them
This is test 7 · ★★ of lesson 36 «Computers and screens» of the technology 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: Count them: in binary, each switch is on or off.
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Count | count | VERB | Mood=Imp VerbForm=Fin | root | root |
| 2 | them | they | PRON | Case=Acc Number=Plur Person=3 PronType=Prs | 1 Count | obj |
| 3 | : | : | PUNCT | _ | 5 binary | punct |
| 4 | in | in | ADP | _ | 5 binary | case |
| 5 | binary | binary | NOUN | Number=Sing | 1 Count | parataxis |
| 6 | , | , | PUNCT | _ | 10 on | punct |
| 7 | each | each | DET | PronType=Tot | 8 switch | det |
| 8 | switch | switch | NOUN | Number=Sing | 10 on | nsubj |
| 9 | is | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 10 on | cop |
| 10 | on | on | ADV | _ | 5 binary | conj |
| 11 | or | or | CCONJ | _ | 12 off | cc |
| 12 | off | off | ADV | _ | 10 on | conj |
| 13 | . | . | PUNCT | _ | 1 Count | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | count | imperative | you not said here | them = they | vn multiply-108 «NP V NP»: agent=Agent they=Theme | ||||
| 2 | is | present | each switch | on property | tree rules |
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 different patterns can 2 switches make?
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 | 4 patterns | amod |
| 3 | different | different | ADJ | Degree=Pos | 4 patterns | amod |
| 4 | patterns | pattern | NOUN | Number=Plur | 8 make | nsubj |
| 5 | can | can | AUX | VerbForm=Fin | 8 make | aux |
| 6 | 2 | 2 | NUM | NumForm=Digit NumType=Card | 7 switches | nummod |
| 7 | switches | switch | NOUN | Number=Plur | 8 make | nsubj |
| 8 | make | make | VERB | VerbForm=Inf | root | root |
| 9 | ? | ? | PUNCT | _ | 8 make | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | make | can | many different patterns | vn build-26.1-1 «NP.asset V NP»: agent=Asset |
The options
Option 1 · ← Mova's choice
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 · ✓ 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 3
3
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 3 | 3 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 4
2
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 2 | 2 | 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/technology/36-computers-and-screens/t7/