---
title: Which of the following statements most accurately characterises the… — Playing fair and cheating in games · tree and pragmatics
description: Which of the following statements most accurately characterises the alteration of rules halfway through a game in order to win? Exam question 1 of lesson 200 «Playing fair and cheating in games» of the everyday course of Mova's primary school, with the dependency tree and pragmatics of the question 
---

<!-- md -->
[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/questions/everyday/200-cheating-in-games/e1/)

<!-- crumbs -->
[home](https://md.mova.elamur.ai/free/en/) / [corpora](https://md.mova.elamur.ai/free/en/corpora/) / [questions](https://md.mova.elamur.ai/free/en/corpora/questions/) / [Everyday](https://md.mova.elamur.ai/free/en/corpora/questions/everyday/) / [Playing fair and cheating in games](https://md.mova.elamur.ai/free/en/corpora/questions/everyday/200-cheating-in-games/) / e1

# Exam question 1 · Playing fair and cheating in games

<!-- .ven lang=en -->
Which of the following statements most accurately characterises the alteration of rules halfway through a game in order to win?

<!-- .vintro -->
**Mova's choice:** option 1 · **The right answer:** option 1 · right ✓ · **What happens:** follow, characteris, win, alter · **To what, where:** alteration, game, rules

<!-- .vabout -->
This is exam question 1 of lesson 200 «Playing fair and cheating in games» of the everyday course of Mova's primary school, asked in stiff, formal language. 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](https://md.mova.elamur.ai/free/en/school-run/everyday/200-cheating-in-games/#e1).

## The question {#question}

```conllu
# sent_id = question:everyday:200-cheating-in-games:e1:1
# text = Which of the following statements most accurately characterises the alteration of rules halfway through a game in order to win?
1	Which	which	PRON	WDT	PronType=Rel	8	nsubj	_	_
2	of	of	ADP	IN	_	5	case	_	_
3	the	the	DET	DT	Definite=Def|PronType=Art	5	det	_	_
4	following	follow	VERB	VBG	VerbForm=Ger	5	amod	_	_
5	statements	statement	NOUN	NNS	Number=Plur	1	nmod	_	_
6	most	most	ADV	RBS	Degree=Sup	7	advmod	_	_
7	accurately	accurately	ADV	RB	_	8	advmod	_	_
8	characterises	characteris	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	0	root	_	_
9	the	the	DET	DT	Definite=Def|PronType=Art	10	det	_	_
10	alteration	alteration	NOUN	NN	Number=Sing	8	obj	_	_
11	of	of	ADP	IN	_	12	case	_	_
12	rules	rule	NOUN	NNS	Number=Plur	10	nmod	_	_
13	halfway	halfway	ADV	RB	_	8	advmod	_	_
14	through	through	ADP	IN	_	16	case	_	_
15	a	a	DET	DT	Definite=Ind|PronType=Art	16	det	_	_
16	game	game	NOUN	NN	Number=Sing	8	obl	_	_
17	in	in	SCONJ	IN	ExtPos=SCONJ	20	mark	_	_
18	order	order	NOUN	NN	Number=Sing	17	fixed	_	_
19	to	to	PART	TO	_	20	mark	_	_
20	win	win	VERB	VB	VerbForm=Inf	8	advcl	_	SpaceAfter=No
21	?	?	PUNCT	.	_	8	punct	_	_
```

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **follow** | gerund |  |  |  |  |  |  | vn occur-48.3-1 «NP V»: agent=Theme |
| 2 | **characteris** | present |  | the alteration of rules |  | a game |  | accurately, halfway *property* | tree rules |
| 3 | **win** | to-infinitive |  |  |  |  |  |  | vn succeed-74-2 «NP V»: agent=Agent |
| 4 | **alter** |  |  | rules |  |  |  |  | nom alteration «event transitive»: of=patient |

<!-- .note -->
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 {#options}

### Option 1 · ← Mova's choice · ✓ the right answer {#o1}

<!-- .ven lang=en -->
It is cheating

```conllu
# sent_id = question:everyday:200-cheating-in-games:e1:o1:1
# text = It is cheating
1	It	it	PRON	PRP	Case=Nom|Gender=Neut|Number=Sing|Person=3|PronType=Prs	3	nsubj	_	_
2	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	3	aux	_	_
3	cheating	cheat	VERB	VBG	Tense=Pres|VerbForm=Part	0	root	_	_
```

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **cheat** | present · progressive | It |  |  |  |  |  | vn cheat-10.6.1 «NP V NP»: agent=Agent |

### Option 2 {#o2}

<!-- .ven lang=en -->
It is fair if one is losing

```conllu
# sent_id = question:everyday:200-cheating-in-games:e1:o2:1
# text = It is fair if one is losing
1	It	it	PRON	PRP	Case=Nom|Gender=Neut|Number=Sing|Person=3|PronType=Prs	3	expl	_	_
2	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	3	cop	_	_
3	fair	fair	ADJ	JJ	Degree=Pos	0	root	_	_
4	if	if	SCONJ	IN	_	7	mark	_	_
5	one	one	NUM	CD	NumForm=Word|NumType=Card	7	nsubj	_	_
6	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	7	aux	_	_
7	losing	lose	VERB	VBG	VerbForm=Ger	3	advcl	_	_
```

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **is** | present |  |  |  |  |  | fair *property* | tree rules |
| 2 | **lose** *a condition, not said to happen* | present · progressive | one |  |  |  |  |  | vn succeed-74-3-1 «NP V»: agent=Agent |

### Option 3 {#o3}

<!-- .ven lang=en -->
It is permitted once a game

```conllu
# sent_id = question:everyday:200-cheating-in-games:e1:o3:1
# text = It is permitted once a game
1	It	it	PRON	PRP	Case=Nom|Gender=Neut|Number=Sing|Person=3|PronType=Prs	3	nsubj:pass	_	_
2	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	3	aux:pass	_	_
3	permitted	permit	VERB	VBN	Tense=Past|VerbForm=Part|Voice=Pass	0	root	_	_
4	once	once	SCONJ	IN	_	6	case	_	_
5	a	a	DET	DT	Definite=Ind|PronType=Art	6	det	_	_
6	game	game	NOUN	NN	Number=Sing	3	obl	_	_
```

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **permit** | present · passive |  | It |  |  |  | once a game | vn admit-64.3-1 «NP V NP»: subject=Theme |

### Option 4 {#o4}

<!-- .ven lang=en -->
It is a clever tactic

```conllu
# sent_id = question:everyday:200-cheating-in-games:e1:o4:1
# text = It is a clever tactic
1	It	it	PRON	PRP	Case=Nom|Gender=Neut|Number=Sing|Person=3|PronType=Prs	5	nsubj	_	_
2	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	5	cop	_	_
3	a	a	DET	DT	Definite=Ind|PronType=Art	5	det	_	_
4	clever	clever	ADJ	JJ	Degree=Pos	5	amod	_	_
5	tactic	tactic	NOUN	NN	Number=Sing	0	root	_	_
```

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **is a** | present | It | a clever tactic |  |  |  |  | tree rules |

<!-- div src -->

**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.

<!-- /div -->

<!-- pn -->
- ← previous: [Playing fair and cheating in games, test 18](https://md.mova.elamur.ai/free/en/corpora/questions/everyday/200-cheating-in-games/t18/)
- next →: [Playing fair and cheating in games, exam 2](https://md.mova.elamur.ai/free/en/corpora/questions/everyday/200-cheating-in-games/e2/)
- ↑ back to [Playing fair and cheating in games](https://md.mova.elamur.ai/free/en/corpora/questions/everyday/200-cheating-in-games/)

