Test 4 · ★ · English Fairy Tales, The Laidly Worm of Spindleston Heugh:…

Was the worm dead hungry or just being a pain?

Mova's choice: option 1 · The right answer: option 3 · wrong ✗ · What happens: be · To what, where: worm, pain

This is test 4 · ★ of lesson 1970 «English Fairy Tales, The Laidly Worm of Spindleston Heugh: Margaret is freed by three kisses, and the witch-queen becomes a toad» 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	Was	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin	3 worm	cop
2	the	the	DET	Definite=Def PronType=Art	3 worm	det
3	worm	worm	NOUN	Number=Sing	5 hungry	csubj
4	dead	dead	ADJ	Degree=Pos	5 hungry	amod
5	hungry	hungry	ADJ	Degree=Pos	root	root
6	or	or	CCONJ	_	10 pain	cc
7	just	just	ADV	_	10 pain	advmod
8	being	be	AUX	Tense=Pres VerbForm=Part	10 pain	cop
9	a	a	DET	Definite=Ind PronType=Art	10 pain	det
10	pain	pain	NOUN	Number=Sing	5 hungry	conj
11	?	?	PUNCT	_	5 hungry	punct

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is a	past		the worm					tree rules
2	is a	gerund		a pain					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.

The options

Option 1 · ← Mova's choice

Naughty

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Naughty	naughty	ADJ	Degree=Pos	root	root

The frames reader finds no event or fact in this sentence.

Option 2

Very hungry too

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Very	very	ADV	_	2 hungry	advmod
2	hungry	hungry	ADJ	Degree=Pos	root	root
3	too	too	ADV	_	2 hungry	advmod

The frames reader finds no event or fact in this sentence.

Option 3 · ✓ the right answer

Dead hungry

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Dead	dead	ADV	_	2 hungry	advmod
2	hungry	hungry	ADJ	Degree=Pos	root	root

The frames reader finds no event or fact in this sentence.

Option 4

Sleepy

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Sleepy	sleepy	ADJ	Degree=Pos	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/1970-pg7439-part29/t4/