Test 11 · ★★ · Arguing politely and never calling names
Liam and Jake are best mates but disagree about a four-day week. Can they stay friends?
Mova's choice: option 1 · The right answer: option 1 · right ✓ · Who acts: Liam · What happens: be, disagree, stay · To what, where: best mates, friends
This is test 11 · ★★ of lesson 39 «Arguing politely and never calling names» of the politics 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: Liam and Jake are best mates but disagree about a four-day week.
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Liam | Liam | PROPN | Number=Sing | 6 mates | nsubj |
| 2 | and | and | CCONJ | _ | 3 Jake | cc |
| 3 | Jake | Jake | PROPN | Number=Sing | 1 Liam | conj |
| 4 | are | be | AUX | Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin | 6 mates | cop |
| 5 | best | good | ADJ | Degree=Sup | 6 mates | amod |
| 6 | mates | mate | NOUN | Number=Plur | root | root |
| 7 | but | but | CCONJ | _ | 8 disagree | cc |
| 8 | disagree | disagree | VERB | Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin | 6 mates | conj |
| 9 | about | about | ADP | _ | 14 week | case |
| 10 | a | a | DET | Definite=Ind PronType=Art | 14 week | det |
| 11 | four | four | NUM | NumForm=Word NumType=Card | 13 day | nummod |
| 12 | - | - | PUNCT | _ | 11 four | punct |
| 13 | day | day | NOUN | Number=Sing | 14 week | compound |
| 14 | week | week | NOUN | Number=Sing | 8 disagree | obl |
| 15 | . | . | PUNCT | _ | 6 mates | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | is a | present | Liam and Jake | best mates | tree rules | ||||
| 2 | disagree | present | Liam and Jake not said here | week | vn correspond-36.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.
Sentence 2: Can they stay friends?
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Can | can | AUX | VerbForm=Fin | 3 stay | aux |
| 2 | they | they | PRON | Case=Nom Number=Plur Person=3 PronType=Prs | 3 stay | nsubj |
| 3 | stay | stay | VERB | VerbForm=Inf | root | root |
| 4 | friends | friend | NOUN | Number=Plur | 3 stay | xcomp |
| 5 | ? | ? | PUNCT | _ | 3 stay | punct |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | stay | can | Liam | friends | vn exist-47.1 «NP V»: agent=Theme |
The options
Option 1 · ← Mova's choice · ✓ the right answer
Yes, you can disagree about ideas and still be friends
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Yes | yes | INTJ | Polarity=Pos | 5 disagree | discourse |
| 2 | , | , | PUNCT | _ | 1 Yes | punct |
| 3 | you | you | PRON | Case=Nom Person=2 PronType=Prs | 5 disagree | nsubj |
| 4 | can | can | AUX | VerbForm=Fin | 5 disagree | aux |
| 5 | disagree | disagree | VERB | VerbForm=Inf | root | root |
| 6 | about | about | ADP | _ | 7 ideas | case |
| 7 | ideas | idea | NOUN | Number=Plur | 5 disagree | obl |
| 8 | and | and | CCONJ | _ | 11 friends | cc |
| 9 | still | still | ADV | _ | 11 friends | advmod |
| 10 | be | be | AUX | VerbForm=Inf | 11 friends | cop |
| 11 | friends | friend | NOUN | Number=Plur | 5 disagree | conj |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | disagree | can | you | about ideas | vn correspond-36.1 «NP V PP.theme S»: agent=Agent about idea=Topic | ||||
| 2 | is a | infinitive | you not said here | friends | still | tree rules |
Option 2
No, friends must agree about everything
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | No | no | INTJ | Polarity=Neg | 5 agree | discourse |
| 2 | , | , | PUNCT | _ | 1 No | punct |
| 3 | friends | friend | NOUN | Number=Plur | 5 agree | nsubj |
| 4 | must | must | AUX | VerbForm=Fin | 5 agree | aux |
| 5 | agree | agree | VERB | VerbForm=Inf | root | root |
| 6 | about | about | ADP | _ | 7 everything | case |
| 7 | everything | everything | PRON | Number=Sing PronType=Tot | 5 agree | obl |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | agree speech: agree | must | friends | about everything | vn correspond-36.1-1 «NP V PP.theme S»: agent=Agent about everything=Topic |
Option 3
No, one must admit the other is stupid
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | No | no | INTJ | Polarity=Neg | 5 admit | discourse |
| 2 | , | , | PUNCT | _ | 5 admit | punct |
| 3 | one | one | NUM | NumForm=Word NumType=Card | 5 admit | nsubj |
| 4 | must | must | AUX | VerbForm=Fin | 5 admit | aux |
| 5 | admit | admit | VERB | VerbForm=Inf | 9 stupid | csubj |
| 6 | the | the | DET | Definite=Def PronType=Art | 7 other | det |
| 7 | other | other | ADJ | Degree=Pos | 5 admit | obj |
| 8 | is | be | AUX | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 9 stupid | cop |
| 9 | stupid | stupid | ADJ | Degree=Pos | root | root |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | admit speech: other | must | one | the other | vn admit-64.3-1 «NP V NP»: agent=Agent other=Theme | ||||
| 2 | is | present | stupid property | tree rules |
Option 4
Only if one of them changes school
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Only | only | ADV | _ | 6 changes | advmod |
| 2 | if | if | SCONJ | _ | 6 changes | mark |
| 3 | one | one | NUM | NumForm=Word NumType=Card | 6 changes | nsubj |
| 4 | of | of | ADP | _ | 5 them | case |
| 5 | them | they | PRON | Case=Acc Number=Plur Person=3 PronType=Prs | 3 one | nmod |
| 6 | changes | change | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | root | root |
| 7 | school | school | NOUN | Number=Sing | 6 changes | obj |
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
|---|---|---|---|---|---|---|---|---|---|
| 1 | change | present | one of them | school | vn dress-41.1.1-1-1 «NP V NP»: agent=Agent school=Patient |
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/politics/39-arguing-politely-and-never-calling-names/t11/