Test 2 · ★ · Andersen's Fairy Tales, Little Tuk, part 34: Tuk dreams of…

bruh, how many towns did he have to learn by heart?

Mova's choice: option 2 · The right answer: option 2 · right ✓ · Who acts: many towns · What happens: have, learn

This is test 2 · ★ of lesson 307 «Andersen's Fairy Tales, Little Tuk, part 34: Tuk dreams of Danish towns and falls asleep» 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	bruh	bruh	INTJ	_	8 have	discourse
2	,	,	PUNCT	_	8 have	punct
3	how	how	ADV	PronType=Int	4 many	advmod
4	many	many	ADJ	Degree=Pos	5 towns	amod
5	towns	town	NOUN	Number=Plur	8 have	nsubj
6	did	do	AUX	Mood=Ind Number=Plur Person=3 Tense=Past VerbForm=Fin	8 have	aux
7	he	he	PRON	Case=Nom Gender=Masc Number=Sing Person=3 PronType=Prs	8 have	nsubj
8	have	have	VERB	VerbForm=Inf	root	root
9	to	to	PART	_	10 learn	mark
10	learn	learn	VERB	VerbForm=Inf	8 have	xcomp
11	by	by	ADP	_	12 heart	case
12	heart	heart	NOUN	Number=Sing	10 learn	obl
13	?	?	PUNCT	_	8 have	punct

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	have	past · do-support	many towns						tree rules
2	learn	to-infinitive	many towns not said here					by heart	vn learn-14-1 «NP V»: agent=Agent

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

all of them

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	all	all	DET	PronType=Tot	root	root
2	of	of	ADP	_	3 them	case
3	them	they	PRON	Case=Acc Number=Plur Person=3 PronType=Prs	1 all	nmod

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

Option 2 · ← Mova's choice · ✓ the right answer

all the towns in Zealand

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	all	all	DET	PronType=Tot	3 towns	det:predet
2	the	the	DET	Definite=Def PronType=Art	3 towns	det
3	towns	town	NOUN	Number=Plur	root	root
4	in	in	ADP	_	5 Zealand	case
5	Zealand	Zealand	PROPN	Number=Sing	3 towns	nmod

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

Option 3

all the towns of Funen

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	all	all	DET	PronType=Tot	3 towns	det:predet
2	the	the	DET	Definite=Def PronType=Art	3 towns	det
3	towns	town	NOUN	Number=Plur	root	root
4	of	of	ADP	_	5 Funen	case
5	Funen	Funen	PROPN	Number=Sing	3 towns	nmod

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

Option 4

every town

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	every	every	DET	PronType=Tot	2 town	det
2	town	town	NOUN	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/307-pg1597-part34/t2/