Test 4 · ★★ · Record-breakers: the loudest and the longest-lived
«3 cicadas buzzing and 2 mice, how many legs»
Mova's choice: option 1 · The right answer: option 2 · wrong ✗
This is test 4 · ★★ of lesson 187 «Record-breakers: the loudest and the longest-lived» of the biology 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
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | « | « | PUNCT | _ | 4 buzzing | punct |
| 2 | 3 | 3 | NUM | NumForm=Digit NumType=Card | 3 cicadas | nummod |
| 3 | cicadas | cicada | NOUN | Number=Plur | 4 buzzing | compound |
| 4 | buzzing | buzzing | NOUN | Number=Sing | root | root |
| 5 | and | and | CCONJ | _ | 7 mice | cc |
| 6 | 2 | 2 | NUM | NumForm=Digit NumType=Card | 7 mice | nummod |
| 7 | mice | mouse | NOUN | Number=Plur | 4 buzzing | conj |
| 8 | , | , | PUNCT | _ | 11 legs | punct |
| 9 | how | how | ADV | PronType=Int | 10 many | advmod |
| 10 | many | many | ADJ | Degree=Pos | 11 legs | amod |
| 11 | legs | leg | NOUN | Number=Plur | 4 buzzing | conj |
| 12 | » | » | PUNCT | _ | 4 buzzing | punct |
The frames reader finds no event or fact in this sentence.
The options
Option 1 · ← Mova's choice
30
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 30 | 30 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 2 · ✓ the right answer
26
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 26 | 26 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 3
24
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 24 | 24 | NUM | NumForm=Digit NumType=Card | root | root |
The frames reader finds no event or fact in this sentence.
Option 4
20
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | 20 | 20 | 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/biology/187-record-breakers-the-loudest-and-the-longest-lived/t4/