Mova0.5 pre-release⌕

☰

home / corpora / questions / World / Olympiad: everyday reasoning ★★★ / t1

Test 1 · ★★★ · Olympiad: everyday reasoning ★★★

Noah, in the dark: "Red, blue and black socks in here. I'll grab 3, that's defo a pair." What is true?

Mova's choice: option 1 · The right answer: option 2 · wrong ✗ · Who acts: I, that · What happens: grab, be · To what, where: 3, pair

This is test 1 · ★★★ of lesson 194 «Olympiad: everyday reasoning ★★★» of the world 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

Sentence 1: Noah, in the dark: "Red, blue and black socks in here.

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Noah	Noah	PROPN	Number=Sing	5 dark	nsubj
2	,	,	PUNCT	_	5 dark	punct
3	in	in	ADP	_	5 dark	case
4	the	the	DET	Definite=Def PronType=Art	5 dark	det
5	dark	dark	NOUN	Number=Sing	root	root
6	:	:	PUNCT	_	13 socks	punct
7	"	"	PUNCT	_	13 socks	punct
8	Red	red	ADJ	Degree=Pos	13 socks	amod
9	,	,	PUNCT	_	10 blue	punct
10	blue	blue	ADJ	Degree=Pos	8 Red	conj
11	and	and	CCONJ	_	12 black	cc
12	black	black	ADJ	Degree=Pos	8 Red	conj
13	socks	sock	NOUN	Number=Plur	5 dark	nmod
14	in	in	ADP	_	15 here	case
15	here	here	ADV	PronType=Dem	13 socks	nmod
16	.	.	PUNCT	_	5 dark	punct

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

Sentence 2: I'll grab 3, that's defo a pair."

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	I	I	PRON	Case=Nom Number=Sing Person=1 PronType=Prs	3 grab	nsubj
2	'll	will	AUX	VerbForm=Fin	3 grab	aux
3	grab	grab	VERB	VerbForm=Inf	root	root
4	3	3	NUM	NumForm=Digit NumType=Card	3 grab	obj
5	,	,	PUNCT	_	10 pair	punct
6	that	that	PRON	Number=Sing PronType=Dem	10 pair	nsubj
7	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	10 pair	cop
8	defo	defo	X	Foreign=Yes	10 pair	dep
9	a	a	DET	Definite=Ind PronType=Art	10 pair	det
10	pair	pair	NOUN	Number=Sing	3 grab	obl
11	.	.	PUNCT	_	3 grab	punct
12	"	"	PUNCT	_	3 grab	punct

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	grab	future	I	3					vn steal-10.5-1 «NP V NP»: agent=Agent 3=Theme
2	is a	present	that	a pair					tree rules

Sentence 3: What is true?

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	What	what	PRON	PronType=Int	3 true	nsubj
2	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	3 true	cop
3	true	true	ADJ	Degree=Pos	root	root
4	?	?	PUNCT	_	3 true	punct

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

The options

Option 1 · ← Mova's choice

He needs 6 to be sure of a pair

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	He	he	PRON	Case=Nom Gender=Masc Number=Sing Person=3 PronType=Prs	2 needs	nsubj
2	needs	need	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	root	root
3	6	6	NUM	NumForm=Digit NumType=Card	2 needs	obj
4	to	to	PART	_	6 sure	mark
5	be	be	AUX	VerbForm=Inf	6 sure	cop
6	sure	sure	ADJ	Degree=Pos	2 needs	advcl
7	of	of	ADP	_	9 pair	case
8	a	a	DET	Definite=Ind PronType=Art	9 pair	det
9	pair	pair	NOUN	Number=Sing	6 sure	obl

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	need	present	He	6					vn want-32.1-1-1 «NP V NP ADV»: agent=Pivot 6=Theme
2	is	to-infinitive	He not said here					of a pair; sure property	tree rules

Option 2 · ✓ the right answer

3 could be all different; 4 makes sure

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	3	3	NUM	NumForm=Digit NumType=Card	5 different	nsubj
2	could	could	AUX	VerbForm=Fin	5 different	aux
3	be	be	AUX	VerbForm=Inf	5 different	cop
4	all	all	DET	PronType=Tot	5 different	det
5	different	different	ADJ	Degree=Pos	root	root
6	;	;	PUNCT	_	8 makes	punct
7	4	4	NUM	NumForm=Digit NumType=Card	8 makes	nsubj
8	makes	make	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	5 different	advcl
9	sure	sure	ADJ	Degree=Pos	8 makes	xcomp

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	could	3					different property	tree rules
2	make	present	4					sure property	vn build-26.1-1 «NP.asset V NP»: agent=Asset

Option 3

He needs 2, because socks come in pairs

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	He	he	PRON	Case=Nom Gender=Masc Number=Sing Person=3 PronType=Prs	2 needs	nsubj
2	needs	need	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	root	root
3	2	2	NUM	NumForm=Digit NumType=Card	2 needs	obj
4	,	,	PUNCT	_	7 come	punct
5	because	because	SCONJ	_	7 come	mark
6	socks	sock	NOUN	Number=Plur	7 come	nsubj
7	come	come	VERB	Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin	2 needs	parataxis
8	in	in	ADP	_	9 pairs	case
9	pairs	pair	NOUN	Number=Plur	7 come	obl

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	need	present	He	2					vn want-32.1-1-1 «NP V NP ADV»: agent=Pivot 2=Theme
2	come	present	socks			pairs			vn appear-48.1.1 «NP V PP.location»: agent=Theme in pair=Location

Option 4

3 is always enough for a pair of socks

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	3	3	NUM	NumForm=Digit NumType=Card	4 enough	nsubj
2	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	4 enough	cop
3	always	always	ADV	PronType=Tot	4 enough	advmod
4	enough	enough	ADJ	Degree=Pos	root	root
5	for	for	ADP	_	7 pair	case
6	a	a	DET	Definite=Ind PronType=Art	7 pair	det
7	pair	pair	NOUN	Number=Sing	4 enough	obl
8	of	of	ADP	_	9 socks	case
9	socks	sock	NOUN	Number=Plur	7 pair	nmod

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	present	3					for a pair of socks; always, enough 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/world/194-olympiad-everyday-reasoning/t1/