Test 10 · ★ · Lang fairy book, The Golden Lion: the youngest brother hid…
lowkey, how many days till the sash?
Mova's choice: option 1 · The right answer: option 3 · wrong ✗
This is test 10 · ★ of lesson 1651 «Lang fairy book, The Golden Lion: the youngest brother hides in a golden lion, wins the princess by her white sash, and marries her» 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 | lowkey | lowkey | PROPN | Number=Sing | root | root |
| 2 | , | , | PUNCT | _ | 5 days | punct |
| 3 | how | how | ADV | PronType=Int | 4 many | advmod |
| 4 | many | many | ADJ | Degree=Pos | 5 days | amod |
| 5 | days | day | NOUN | Number=Plur | 1 lowkey | appos |
| 6 | till | till | ADP | _ | 8 sash | case |
| 7 | the | the | DET | Definite=Def PronType=Art | 8 sash | det |
| 8 | sash | sash | NOUN | Number=Sing | 5 days | nmod |
| 9 | ? | ? | PUNCT | _ | 1 lowkey | punct |
The frames reader finds no event or fact in this sentence.
The options
Option 1 · ← Mova's choice
eight whole days until the feast
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | eight | eight | NUM | NumForm=Word NumType=Card | 3 days | nummod |
| 2 | whole | whole | ADJ | Degree=Pos | 3 days | amod |
| 3 | days | day | NOUN | Number=Plur | root | root |
| 4 | until | until | ADP | _ | 6 feast | case |
| 5 | the | the | DET | Definite=Def PronType=Art | 6 feast | det |
| 6 | feast | feast | NOUN | Number=Sing | 3 days | nmod |
The frames reader finds no event or fact in this sentence.
Option 2
seven days
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | seven | seven | NUM | NumForm=Word NumType=Card | 2 days | nummod |
| 2 | days | day | NOUN | Number=Plur | root | root |
The frames reader finds no event or fact in this sentence.
Option 3 · ✓ the right answer
eight days
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | eight | eight | NUM | NumForm=Word NumType=Card | 2 days | nummod |
| 2 | days | day | NOUN | Number=Plur | root | root |
The frames reader finds no event or fact in this sentence.
Option 4
eight days from now
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | eight | eight | NUM | NumForm=Word NumType=Card | 2 days | nummod |
| 2 | days | day | NOUN | Number=Plur | root | root |
| 3 | from | from | ADP | _ | 4 now | case |
| 4 | now | now | ADV | PronType=Dem | 2 days | obl |
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/1651-pg5615-part40/t10/