Test 11 · ★ · Arabian Nights, Noureddin and the Beautiful Persian, part…

so what's the least the slave guys said she was worth?

Mova's choice: option 1 · The right answer: option 4 · wrong ✗ · Who acts: slave guys, she · What happens: be, say · Speech: someone speaks here

This is test 11 · ★ of lesson 207 «Arabian Nights, Noureddin and the Beautiful Persian, part 47: Noureddin's friends desert him and the Persian is put up for sale» 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	_	5 least	advmod
2	what	what	PRON	PronType=Int	5 least	obj
3	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	5 least	cop
4	the	the	DET	Definite=Def PronType=Art	5 least	det
5	least	least	ADJ	Degree=Sup	9 said	obl
6	the	the	DET	Definite=Def PronType=Art	8 guys	det
7	slave	slave	NOUN	Number=Sing	8 guys	compound
8	guys	guy	NOUN	Number=Plur	9 said	nsubj
9	said	say	VERB	Mood=Ind Number=Plur Person=3 Tense=Past VerbForm=Fin	root	root
10	she	she	PRON	Case=Nom Gender=Fem Number=Sing Person=3 PronType=Prs	12 worth	nsubj
11	was	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin	12 worth	cop
12	worth	worth	ADJ	Degree=Pos	9 said	ccomp
13	?	?	PUNCT	_	9 said	punct

#	verb	tense, mood	who	other	roles by
1	is	present		least property	tree rules
2	say speech: assert	past	the slave guys		vn say-37.7-1-1 «NP V that S»: agent=Agent
3	is	past	she	worth 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

5,000 gold coins

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	5,000	5000	NUM	NumForm=Digit NumType=Card	3 coins	nummod
2	gold	gold	NOUN	Number=Sing	3 coins	compound
3	coins	coin	NOUN	Number=Plur	root	root

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

Option 2

Four thousand gold pieces at least

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Four	four	NUM	NumForm=Word NumType=Card	2 thousand	compound
2	thousand	thousand	NUM	NumForm=Word NumType=Card	4 pieces	nummod
3	gold	gold	NOUN	Number=Sing	4 pieces	compound
4	pieces	piece	NOUN	Number=Plur	root	root
5	at	at	ADP	_	6 least	case
6	least	least	ADJ	Degree=Sup	4 pieces	nmod

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

Option 3

2,000 coins

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	2,000	2000	NUM	NumForm=Digit NumType=Card	2 coins	nummod
2	coins	coin	NOUN	Number=Plur	root	root

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

Option 4 · ✓ the right answer

4,000 gold pieces

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	4,000	4,000	NUM	NumForm=Digit NumType=Card	3 pieces	nummod
2	gold	gold	NOUN	Number=Sing	3 pieces	compound
3	pieces	piece	NOUN	Number=Plur	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/207-pg128-part47/t11/