Test 7 · ★ · Roads and road signs
Count them: a road has 3 lanes each way. How many lanes is that in total?
Mova's choice: option 1 · The right answer: option 4 · wrong ✗ · Who acts: you, road, many lanes · What happens: count, have, be · To what, where: them, 3 lanes
This is test 7 · ★ of lesson 31 «Roads and road signs» 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: a road has 3 lanes each way.
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 | _ | 6 has | punct |
| 4 | a | a | DET | Definite=Ind PronType=Art | 5 road | det |
| 5 | road | road | NOUN | Number=Sing | 6 has | nsubj |
| 6 | has | have | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 1 Count | parataxis |
| 7 | 3 | 3 | NUM | NumForm=Digit NumType=Card | 8 lanes | nummod |
| 8 | lanes | lane | NOUN | Number=Plur | 6 has | obj |
| 9 | each | each | DET | PronType=Tot | 10 way | det |
| 10 | way | way | NOUN | Number=Sing | 6 has | obj |
| 11 | . | . | 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 | have | present | a road | 3 lanes | 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 lanes is that in total?
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 | 3 lanes | amod |
| 3 | lanes | lane | NOUN | Number=Plur | 7 total | nsubj |
| 4 | is | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 7 total | cop |
| 5 | that | that | SCONJ | _ | 7 total | mark |
| 6 | in | in | ADP | _ | 7 total | case |
| 7 | total | total | ADJ | Degree=Pos | root | root |
| 8 | ? | ? | PUNCT | _ | 7 total | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | is | present | many lanes | total property | tree rules |
The options
Option 1 · ← Mova's choice
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 2
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 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 · ✓ the right answer
6
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 6 | 6 | 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/31-roads-and-road-signs/t7/