Test 11 · ★ · Fairy Tales, Toads and Diamonds: two sisters at the founta…

what did the Fairy say a prince needed to be really happy?

Mova's choice: option 1 · The right answer: option 2 · wrong ✗ · Who acts: Fairy · What happens: do, say, need, be · To what, where: prince · Speech: someone speaks here

This is test 11 · ★ of lesson 1477 «Fairy Tales, Toads and Diamonds: two sisters at the fountain, one gets pearls and diamonds, the other gets snakes and toads» 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	what	what	PRON	PronType=Int	2 did	nsubj
2	did	do	VERB	Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin	root	root
3	the	the	DET	Definite=Def PronType=Art	4 Fairy	det
4	Fairy	Fairy	PROPN	Number=Sing	5 say	nsubj
5	say	say	VERB	Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin	2 did	ccomp
6	a	a	DET	Definite=Ind PronType=Art	7 prince	det
7	prince	prince	NOUN	Number=Sing	5 say	obj
8	needed	need	VERB	Tense=Past VerbForm=Part Voice=Pass	7 prince	acl
9	to	to	PART	_	12 happy	mark
10	be	be	AUX	VerbForm=Inf	12 happy	cop
11	really	really	ADV	_	12 happy	advmod
12	happy	happy	ADJ	Degree=Pos	8 needed	advcl
13	?	?	PUNCT	_	2 did	punct

#	verb	tense, mood	who	what, whom	other	roles by
1	do	past				tree rules
2	say speech: assert	present	the Fairy	a prince		vn say-37.7-1-1 «NP V NP.topic»: agent=Agent prince=Topic
3	need	participle		a prince not said here		vn want-32.1-1-1 «NP V NP S_INF»: agent=Pivot
4	is	to-infinitive			happy property	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

to be wise, that's the proper way

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	to	to	PART	_	3 wise	mark
2	be	be	AUX	VerbForm=Inf	3 wise	cop
3	wise	wise	ADJ	Degree=Pos	root	root
4	,	,	PUNCT	_	9 way	punct
5	that	that	PRON	Number=Sing PronType=Dem	9 way	nsubj
6	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	9 way	cop
7	the	the	DET	Definite=Def PronType=Art	9 way	det
8	proper	proper	ADJ	Degree=Pos	9 way	amod
9	way	way	NOUN	Number=Sing	3 wise	obl

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	to-infinitive						wise property	tree rules
2	is a	present	that	the proper way					tree rules

Option 2 · ✓ the right answer

to be good, that's the real deal

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	to	to	PART	_	3 good	mark
2	be	be	AUX	VerbForm=Inf	3 good	cop
3	good	good	ADJ	Degree=Pos	root	root
4	,	,	PUNCT	_	9 deal	punct
5	that	that	PRON	Number=Sing PronType=Dem	9 deal	nsubj
6	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	9 deal	cop
7	the	the	DET	Definite=Def PronType=Art	9 deal	det
8	real	real	ADJ	Degree=Pos	9 deal	amod
9	deal	deal	NOUN	Number=Sing	3 good	conj

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	to-infinitive						good property	tree rules
2	is a	present	that	the real deal					tree rules

Option 3

to be good

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	to	to	PART	_	3 good	mark
2	be	be	AUX	VerbForm=Inf	3 good	cop
3	good	good	ADJ	Degree=Pos	root	root

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	to-infinitive						good property	tree rules

Option 4

be rich, mate

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	be	be	AUX	VerbForm=Inf	2 rich	cop
2	rich	rich	ADJ	Degree=Pos	4 mate	amod
3	,	,	PUNCT	_	2 rich	punct
4	mate	mate	NOUN	Number=Sing	root	root

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	infinitive						rich property	tree rules

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/1477-pg503-part64/t11/