Test 11 · ★ · Mabinogion, Kilhwch and Olwen, part 19: Kay's wonders, the…
Wicked bloke Kay, how tall could he go, mate?
Mova's choice: option 1 · The right answer: option 1 · right ✓ · Who acts: Wicked bloke · What happens: go
This is test 11 · ★ of lesson 2000 «Mabinogion, Kilhwch and Olwen, part 19: Kay's wonders, the knights reach Olwen, and her angry father throws three poisoned darts» 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 | Wicked | wicked | ADJ | Degree=Pos | 2 bloke | amod |
| 2 | bloke | bloke | NOUN | Number=Sing | 9 go | nsubj |
| 3 | Kay | Kay | PROPN | Number=Sing | 2 bloke | appos |
| 4 | , | , | PUNCT | _ | 6 tall | punct |
| 5 | how | how | ADV | PronType=Int | 6 tall | advmod |
| 6 | tall | tall | ADJ | Degree=Pos | 2 bloke | conj |
| 7 | could | could | AUX | VerbForm=Fin | 9 go | aux |
| 8 | he | he | PRON | Case=Nom Gender=Masc Number=Sing Person=3 PronType=Prs | 9 go | nsubj |
| 9 | go | go | VERB | VerbForm=Inf | root | root |
| 10 | , | , | PUNCT | _ | 11 mate | punct |
| 11 | mate | mate | NOUN | Number=Sing | 9 go | vocative |
| 12 | ? | ? | PUNCT | _ | 9 go | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | go | could | Wicked bloke | mate vocative | vn disappearance-48.2-1 «NP V»: agent=Theme |
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 · ✓ the right answer
As tall as the highest tree
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | As | as | ADV | _ | 2 tall | advmod |
| 2 | tall | tall | ADJ | Degree=Pos | root | root |
| 3 | as | as | ADP | _ | 6 tree | case |
| 4 | the | the | DET | Definite=Def PronType=Art | 6 tree | det |
| 5 | highest | high | ADJ | Degree=Sup | 6 tree | amod |
| 6 | tree | tree | NOUN | Number=Sing | 2 tall | obl |
The frames reader finds no event or fact in this sentence.
Option 2
As tall as the highest tree in the whole forest and beyond
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | As | as | ADV | _ | 2 tall | advmod |
| 2 | tall | tall | ADJ | Degree=Pos | root | root |
| 3 | as | as | ADP | _ | 6 tree | case |
| 4 | the | the | DET | Definite=Def PronType=Art | 6 tree | det |
| 5 | highest | high | ADJ | Degree=Sup | 6 tree | amod |
| 6 | tree | tree | NOUN | Number=Sing | 2 tall | obl |
| 7 | in | in | ADP | _ | 10 forest | case |
| 8 | the | the | DET | Definite=Def PronType=Art | 10 forest | det |
| 9 | whole | whole | ADJ | Degree=Pos | 10 forest | amod |
| 10 | forest | forest | NOUN | Number=Sing | 6 tree | nmod |
| 11 | and | and | CCONJ | _ | 12 beyond | cc |
| 12 | beyond | beyond | ADV | _ | 2 tall | conj |
The frames reader finds no event or fact in this sentence.
Option 3
As tall as the castle towers
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | As | as | ADV | _ | 2 tall | advmod |
| 2 | tall | tall | ADJ | Degree=Pos | root | root |
| 3 | as | as | ADP | _ | 6 towers | case |
| 4 | the | the | DET | Definite=Def PronType=Art | 6 towers | det |
| 5 | castle | castle | NOUN | Number=Sing | 6 towers | compound |
| 6 | towers | tower | NOUN | Number=Plur | 2 tall | obl |
The frames reader finds no event or fact in this sentence.
Option 4
Tall as a tree
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Tall | tall | ADJ | Degree=Pos | root | root |
| 2 | as | as | ADP | _ | 4 tree | case |
| 3 | a | a | DET | Definite=Ind PronType=Art | 4 tree | det |
| 4 | tree | tree | NOUN | Number=Sing | 1 Tall | 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/2000-pg7885-part19/t11/