Test 6 · ★ · Perrault's Tales, Riquet with the Tuft, part 11: the two p…

so he fancied her from her picture, that's proper creepy, innit

Mova's choice: option 1 · The right answer: option 3 · wrong ✗ · Who acts: he, that · What happens: fancy, be · To what, where: her, picture

This is test 6 · ★ of lesson 1086 «Perrault's Tales, Riquet with the Tuft, part 11: the two princesses and Riquet's bargain» 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	so	so	ADV	_	3 fancied	advmod
2	he	he	PRON	Case=Nom Gender=Masc Number=Sing Person=3 PronType=Prs	3 fancied	nsubj
3	fancied	fancy	VERB	Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin	root	root
4	her	she	PRON	Case=Acc Gender=Fem Number=Sing Person=3 PronType=Prs	3 fancied	obj
5	from	from	ADP	_	7 picture	case
6	her	her	PRON	Case=Gen Gender=Fem Number=Sing Person=3 Poss=Yes PronType=Prs	7 picture	nmod:poss
7	picture	picture	NOUN	Number=Sing	3 fancied	obl
8	,	,	PUNCT	_	12 creepy	punct
9	that	that	PRON	Number=Sing PronType=Dem	12 creepy	nsubj
10	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	12 creepy	cop
11	proper	proper	ADJ	Degree=Pos	12 creepy	amod
12	creepy	creepy	ADJ	Degree=Pos	3 fancied	parataxis
13	,	,	PUNCT	_	14 innit	punct
14	innit	innit	INTJ	_	12 creepy	discourse

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	fancy	past	he	her = she		her picture			vn admire-31.2 «NP V NP»: agent=Experiencer she=Stimulus
2	is	present	that					creepy 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

yeah, but it was a bit sweet, like, fair enough

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	yeah	yeah	INTJ	_	8 sweet	discourse
2	,	,	PUNCT	_	8 sweet	punct
3	but	but	CCONJ	_	8 sweet	cc
4	it	it	PRON	Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs	8 sweet	nsubj
5	was	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin	8 sweet	cop
6	a	a	DET	Definite=Ind PronType=Art	7 bit	det
7	bit	bit	NOUN	Number=Sing	8 sweet	obl:unmarked
8	sweet	sweet	ADJ	Degree=Pos	root	root
9	,	,	PUNCT	_	10 like	punct
10	like	like	ADP	_	8 sweet	conj
11	,	,	PUNCT	_	12 fair	punct
12	fair	fair	ADJ	Degree=Pos	8 sweet	conj
13	enough	enough	ADV	_	12 fair	advmod

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	past	it					a bit obl:unmarked; sweet property	tree rules
2	be							enough property	tree rules

Option 2

nah, it was a bit dodgy, like, fair enough

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	nah	nah	INTJ	_	7 dodgy	discourse
2	,	,	PUNCT	_	1 nah	punct
3	it	it	PRON	Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs	7 dodgy	nsubj
4	was	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin	7 dodgy	cop
5	a	a	DET	Definite=Ind PronType=Art	6 bit	det
6	bit	bit	NOUN	Number=Sing	7 dodgy	obl:unmarked
7	dodgy	dodgy	ADJ	Degree=Pos	root	root
8	,	,	PUNCT	_	9 like	punct
9	like	like	INTJ	_	7 dodgy	discourse
10	,	,	PUNCT	_	11 fair	punct
11	fair	fair	ADJ	Degree=Pos	7 dodgy	conj
12	enough	enough	ADV	_	11 fair	advmod

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	past	it					a bit obl:unmarked; dodgy property	tree rules
2	be							enough property	tree rules

Option 3 · ✓ the right answer

yeah, but it was a bit romantic, like, fair enough

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	yeah	yeah	INTJ	_	8 romantic	discourse
2	,	,	PUNCT	_	8 romantic	punct
3	but	but	CCONJ	_	8 romantic	cc
4	it	it	PRON	Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs	8 romantic	nsubj
5	was	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin	8 romantic	cop
6	a	a	DET	Definite=Ind PronType=Art	7 bit	det
7	bit	bit	NOUN	Number=Sing	8 romantic	obl:unmarked
8	romantic	romantic	ADJ	Degree=Pos	root	root
9	,	,	PUNCT	_	10 like	punct
10	like	like	INTJ	_	8 romantic	discourse
11	,	,	PUNCT	_	12 fair	punct
12	fair	fair	ADJ	Degree=Pos	8 romantic	conj
13	enough	enough	ADV	_	12 fair	advmod

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	past	it					a bit obl:unmarked; romantic property	tree rules
2	be							enough property	tree rules

Option 4

yeah, it was romantic

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	yeah	yeah	INTJ	_	5 romantic	discourse
2	,	,	PUNCT	_	1 yeah	punct
3	it	it	PRON	Case=Nom Gender=Neut Number=Sing Person=3 PronType=Prs	5 romantic	nsubj
4	was	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin	5 romantic	cop
5	romantic	romantic	ADJ	Degree=Pos	root	root

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	past	it					romantic 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/1086-pg29021-part11/t6/