Test 11 · Friends, teams and fair play

me n my best mate disagree about everything lately

Mova's choice: option 4 · The right answer: option 4 · right ✓ · Who acts: me · What happens: disagree

This is test 11 of lesson 52 «Friends, teams and fair play» of the everyday 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	me	I	PRON	Case=Acc Number=Sing Person=1 PronType=Prs	6 disagree	nsubj
2	n	n	ADP	_	5 mate	case
3	my	my	PRON	Case=Gen Number=Sing Person=1 Poss=Yes PronType=Prs	5 mate	nmod:poss
4	best	good	ADJ	Degree=Sup	5 mate	amod
5	mate	mate	NOUN	Number=Sing	6 disagree	obl
6	disagree	disagree	VERB	Mood=Ind Number=Sing Person=1 Tense=Pres VerbForm=Fin	root	root
7	about	about	ADP	_	8 everything	case
8	everything	everything	PRON	Number=Sing PronType=Tot	6 disagree	obl
9	lately	lately	ADV	_	6 disagree	advmod

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	disagree	present	me					n my best mate; about everything; lately property	vn correspond-36.1 «NP V PP.theme S»: agent=Agent about everything=Topic

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

Stop talking for good

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Stop	stop	VERB	Mood=Imp VerbForm=Fin	root	root
2	talking	talk	VERB	VerbForm=Ger	1 Stop	xcomp
3	for	for	ADP	_	4 good	case
4	good	good	ADJ	Degree=Pos	2 talking	obl

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	stop	imperative	you not said here						vn stop-55.4-1-1 «NP V S_ING»: agent=Affector clause=Eventuality
2	talk	gerund	you not said here					for good	vn talk-37.5 «NP V»: agent=Agent

Option 2

One must be wrong

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	One	one	NUM	NumForm=Word NumType=Card	4 wrong	nsubj
2	must	must	AUX	VerbForm=Fin	4 wrong	aux
3	be	be	AUX	VerbForm=Inf	4 wrong	cop
4	wrong	wrong	ADJ	Degree=Pos	root	root

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	must	One					wrong property	tree rules

Option 3

Then you're not real friends, time to find new ones

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Then	then	ADV	PronType=Dem	6 friends	advmod
2	you	you	PRON	Case=Nom Person=2 PronType=Prs	6 friends	nsubj
3	're	be	AUX	Mood=Ind Number=Sing Person=2 Tense=Pres VerbForm=Fin	6 friends	cop
4	not	not	PART	Polarity=Neg	6 friends	advmod
5	real	real	ADJ	Degree=Pos	6 friends	amod
6	friends	friend	NOUN	Number=Plur	root	root
7	,	,	PUNCT	_	8 time	punct
8	time	time	NOUN	Number=Sing	6 friends	conj
9	to	to	PART	_	10 find	mark
10	find	find	VERB	VerbForm=Inf	8 time	acl
11	new	new	ADJ	Degree=Pos	12 ones	amod
12	ones	one	NOUN	Number=Plur	10 find	obj

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	not is a	present	you	real friends and time			then		tree rules
2	find	to-infinitive	you not said here	new ones					vn discover-84 «NP V NP»: agent=Agent one=Topic

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

Friends can disagree and still be friends

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Friends	friend	NOUN	Number=Plur	3 disagree	nsubj
2	can	can	AUX	VerbForm=Fin	3 disagree	aux
3	disagree	disagree	VERB	VerbForm=Inf	root	root
4	and	and	CCONJ	_	7 friends	cc
5	still	still	ADV	_	7 friends	advmod
6	be	be	AUX	VerbForm=Inf	7 friends	cop
7	friends	friend	NOUN	Number=Plur	3 disagree	conj

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	disagree	can	Friends						vn correspond-36.1 «NP V»: agent=Agent
2	is a	infinitive	Friends not said here	friends			still		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/everyday/52-friends-teams-and-fair-play/t11/