Test 11 · ★ · Scottish Fairy Tales, Tamlane: Burd Janet wins her knight…

Honest, the tiny lassie wanting the stars is pure mental, eh?

Mova's choice: option 1 · The right answer: option 3 · wrong ✗ · Who acts: tiny lassie · What happens: want, be · To what, where: stars

This is test 11 · ★ of lesson 259 «Scottish Fairy Tales, Tamlane: Burd Janet wins her knight back from Elfland» 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	Honest	honest	ADJ	Degree=Pos	root	root
2	,	,	PUNCT	_	11 mental	punct
3	the	the	DET	Definite=Def PronType=Art	5 lassie	det
4	tiny	tiny	ADJ	Degree=Pos	5 lassie	amod
5	lassie	lassie	NOUN	Number=Sing	11 mental	nsubj
6	wanting	want	VERB	VerbForm=Ger	5 lassie	acl
7	the	the	DET	Definite=Def PronType=Art	8 stars	det
8	stars	star	NOUN	Number=Plur	6 wanting	obj
9	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	11 mental	cop
10	pure	pure	ADJ	Degree=Pos	11 mental	amod
11	mental	mental	ADJ	Degree=Pos	1 Honest	conj
12	,	,	PUNCT	_	11 mental	punct
13	eh	eh	INTJ	_	1 Honest	discourse
14	?	?	PUNCT	_	1 Honest	punct

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	want	gerund	the tiny lassie not said here	the stars					vn want-32.1-1-1 «NP V NP ADV»: agent=Pivot star=Theme
2	is	present	the tiny lassie					mental 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

Aye, she's no

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Aye	aye	INTJ	_	4 's	discourse
2	,	,	PUNCT	_	1 Aye	punct
3	she	she	PRON	Case=Nom Gender=Fem Number=Sing Person=3 PronType=Prs	4 's	nsubj
4	's	be	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	root	root
5	no	no	INTJ	Polarity=Neg	4 's	discourse

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	be	present	she						vn exist-47.1 «NP V»: agent=Theme

Option 2

Aye, she's jist a wee lassie wi a broom

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Aye	aye	INTJ	_	8 lassie	discourse
2	,	,	PUNCT	_	1 Aye	punct
3	she	she	PRON	Case=Nom Gender=Fem Number=Sing Person=3 PronType=Prs	8 lassie	nsubj
4	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	8 lassie	cop
5	jist	jist	X	Foreign=Yes	8 lassie	nsubj
6	a	a	DET	Definite=Ind PronType=Art	8 lassie	det
7	wee	wee	ADJ	Degree=Pos	8 lassie	amod
8	lassie	lassie	NOUN	Number=Sing	root	root
9	wi	wi	ADP	_	11 broom	case
10	a	a	DET	Definite=Ind PronType=Art	11 broom	det
11	broom	broom	NOUN	Number=Sing	8 lassie	nmod

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is a	present	she	a wee lassie				wi a broom	tree rules

Option 3 · ✓ the right answer

Aye, but she's dead keen, that's the best bit

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Aye	aye	INTJ	_	7 keen	discourse
2	,	,	PUNCT	_	7 keen	punct
3	but	but	CCONJ	_	7 keen	cc
4	she	she	PRON	Case=Nom Gender=Fem Number=Sing Person=3 PronType=Prs	7 keen	nsubj
5	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	7 keen	cop
6	dead	dead	ADJ	Degree=Pos	7 keen	amod
7	keen	keen	NOUN	Number=Sing	root	root
8	,	,	PUNCT	_	13 bit	punct
9	that	that	PRON	Number=Sing PronType=Dem	13 bit	nsubj
10	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	13 bit	cop
11	the	the	DET	Definite=Def PronType=Art	13 bit	det
12	best	good	ADJ	Degree=Sup	13 bit	amod
13	bit	bit	NOUN	Number=Sing	7 keen	conj

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is a	present	she	dead keen and the best bit					tree rules
2	is a	present	that	the best bit					tree rules

Option 4

Naw

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Naw	Naw	PROPN	Number=Sing	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/259-pg14241-part26/t11/