Test 12 · ★ · Andersen's Fairy Tales, The Little Match Girl: a poor girl…
Mad, how many matches did she burn all at once?
Mova's choice: option 1 · The right answer: option 2 · wrong ✗ · Who acts: Mad many matches · What happens: burn
This is test 12 · ★ of lesson 306 «Andersen's Fairy Tales, The Little Match Girl: a poor girl freezes on New Year's Eve» of the books 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 | Mad | mad | ADJ | Degree=Pos | 5 matches | amod |
| 2 | , | , | PUNCT | _ | 1 Mad | punct |
| 3 | how | how | ADV | PronType=Int | 4 many | advmod |
| 4 | many | many | ADJ | Degree=Pos | 5 matches | amod |
| 5 | matches | match | NOUN | Number=Plur | 8 burn | nsubj |
| 6 | did | do | AUX | Mood=Ind Number=Plur Person=3 Tense=Past VerbForm=Fin | 8 burn | aux |
| 7 | she | she | PRON | Case=Nom Gender=Fem Number=Sing Person=3 PronType=Prs | 8 burn | nsubj |
| 8 | burn | burn | VERB | VerbForm=Inf | root | root |
| 9 | all | all | ADV | _ | 8 burn | advmod |
| 10 | at | at | ADP | _ | 11 once | case |
| 11 | once | once | ADV | NumForm=Word NumType=Mult | 8 burn | obl |
| 12 | ? | ? | PUNCT | _ | 8 burn | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | burn | past · do-support | Mad many matches | all property | vn light_emission-43.1 «NP V PP.location»: agent=Theme at once=Location |
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 · ← Mova's choice
a few
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | a | a | DET | Definite=Ind PronType=Art | 2 few | det |
| 2 | few | few | ADJ | Degree=Pos | root | root |
The frames reader finds no event or fact in this sentence.
Option 2 · ✓ the right answer
all of them
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | all | all | DET | PronType=Tot | root | root |
| 2 | of | of | ADP | _ | 3 them | case |
| 3 | them | they | PRON | Case=Acc Number=Plur Person=3 PronType=Prs | 1 all | nmod |
The frames reader finds no event or fact in this sentence.
Option 3
the last one
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | the | the | DET | Definite=Def PronType=Art | 3 one | det |
| 2 | last | last | ADJ | Degree=Pos | 3 one | amod |
| 3 | one | one | NOUN | Number=Sing | root | root |
The frames reader finds no event or fact in this sentence.
Option 4
two
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | two | two | NUM | NumForm=Word 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/books/306-pg1597-part33/t12/