Test 10 · Days, weeks and months

What would happen if every month had exactly 4 weeks?

Mova's choice: option 1 · The right answer: option 1 · right ✓ · Who acts: month · What happens: happen, have

This is test 10 of lesson 111 «Days, weeks and months» 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

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	What	what	PRON	PronType=Int	3 happen	nsubj
2	would	would	AUX	VerbForm=Fin	3 happen	aux
3	happen	happen	VERB	VerbForm=Inf	root	root
4	if	if	SCONJ	_	7 had	mark
5	every	every	DET	PronType=Tot	6 month	det
6	month	month	NOUN	Number=Sing	7 had	nsubj
7	had	have	VERB	Mood=Ind Number=Sing Person=3 Tense=Past VerbForm=Fin	3 happen	advcl
8	exactly	exactly	ADV	_	9 4	advmod
9	4	4	NUM	NumForm=Digit NumType=Card	10 weeks	nummod
10	weeks	week	NOUN	Number=Plur	7 had	obj
11	?	?	PUNCT	_	3 happen	punct

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	happen	would							vn occur-48.3-1 «NP V»: agent=Theme
2	have a condition, not said to happen	past	every month				week		vn birth-28.2-1 «NP V NP»: 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 · ← Mova's choice · ✓ the right answer

A year of 12 months would be only 336 days, too short

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	A	a	DET	Definite=Ind PronType=Art	2 year	det
2	year	year	NOUN	Number=Sing	10 days	nsubj
3	of	of	ADP	_	5 months	case
4	12	12	NUM	NumForm=Digit NumType=Card	5 months	nummod
5	months	month	NOUN	Number=Plur	2 year	nmod
6	would	would	AUX	VerbForm=Fin	10 days	aux
7	be	be	AUX	VerbForm=Inf	10 days	cop
8	only	only	ADV	_	9 336	advmod
9	336	336	NUM	NumForm=Digit NumType=Card	10 days	nummod
10	days	day	NOUN	Number=Plur	root	root
11	,	,	PUNCT	_	13 short	punct
12	too	too	ADV	_	13 short	advmod
13	short	short	ADJ	Degree=Pos	10 days	conj

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is a	would	a year of 12 months	336 days					tree rules
2	be		a year of 12 months not said here						tree rules

Option 2

Nothing would change

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Nothing	nothing	PRON	Number=Sing PronType=Neg	3 change	nsubj
2	would	would	AUX	VerbForm=Fin	3 change	aux
3	change	change	VERB	VerbForm=Inf	root	root

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	change	would	Nothing						vn dress-41.1.1-1-1 «NP V»: agent=Agent

Option 3

A year would still be 365 days

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	A	a	DET	Definite=Ind PronType=Art	2 year	det
2	year	year	NOUN	Number=Sing	7 days	nsubj
3	would	would	AUX	VerbForm=Fin	7 days	aux
4	still	still	ADV	_	6 365	advmod
5	be	be	AUX	VerbForm=Inf	6 365	cop
6	365	365	NUM	NumForm=Digit NumType=Card	7 days	nummod
7	days	day	NOUN	Number=Plur	root	root

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is a	infinitive		365			still		tree rules

Option 4

A year would be 400 days, too long

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	A	a	DET	Definite=Ind PronType=Art	2 year	det
2	year	year	NOUN	Number=Sing	6 days	nsubj
3	would	would	AUX	VerbForm=Fin	6 days	aux
4	be	be	AUX	VerbForm=Inf	6 days	cop
5	400	400	NUM	NumForm=Digit NumType=Card	6 days	nummod
6	days	day	NOUN	Number=Plur	root	root
7	,	,	PUNCT	_	6 days	punct
8	too	too	ADV	_	9 long	advmod
9	long	long	ADV	Degree=Pos	6 days	advmod

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is a	would	a year	400 days				long 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/111-days-weeks-and-months/t10/