---
title: A sorting machine that asks yes-or-no questions one after another, e… — Olympiad: thinking like a machine, Bebras puzzle… · tree and pragmatics
description: A sorting machine that asks yes-or-no questions one after another, each answer choosing the next question, is called a decision tree. Who acts: sorting machine, answer. A sentence of the lesson «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the ai course of Mova's primary school with its
---

<!-- md -->
[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/10/)

<!-- crumbs -->
[home](https://md.mova.elamur.ai/free/en/) / [corpora](https://md.mova.elamur.ai/free/en/corpora/) / [school](https://md.mova.elamur.ai/free/en/corpora/school/) / [AI](https://md.mova.elamur.ai/free/en/corpora/school/ai/) / [Olympiad: thinking like a machine, Beb…](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/) / 10

# Olympiad: thinking like a machine, Bebras puzzles ★★★, sentence 10

<!-- .ven lang=en -->
A sorting machine that asks yes-or-no questions one after another, each answer choosing the next question, is called a decision tree.

<!-- .vintro -->
**Who acts:** sorting machine, answer · **What happens:** ask, choose, call · **To what, where:** questions, next question, sorting machine · **Speech:** someone speaks here

<!-- .vabout -->
This is a sentence of the lesson «Olympiad: thinking like a machine, Bebras puzzles ★★★» of the ai course of Mova's primary school. The page gives its syntax tree — a dependency tree in the style of Universal Dependencies — and its pragmatics clause by clause: who acts (sorting machine, answer), what happens, when and where, as Mova's frames read it from the tree.

## The tree {#tree}

```conllu
# sent_id = school:ai:031-olympiad-thinking-like-a-machine.lesson:10
# text = A sorting machine that asks yes-or-no questions one after another, each answer choosing the next question, is called a decision tree.
# source = school lesson (ours)
# course = ai
# lesson = 031-olympiad-thinking-like-a-machine.lesson
# annotation = Mova annot: Rust (en) → Haiku 5.5 (medium, Batches API) patches; gates UD 2.18; agreed by treeagree rules (Stanza, Trankit, spaCy trf): R5-strong ×1, R7-rel-agree ×1
1	A	a	DET	DT	Definite=Ind|PronType=Art	3	det	_	_
2	sorting	sorting	NOUN	NN	Number=Sing	3	compound	_	_
3	machine	machine	NOUN	NN	Number=Sing	24	nsubj:pass	_	_
4	that	that	PRON	WDT	PronType=Rel	5	nsubj	_	_
5	asks	ask	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	3	acl:relcl	_	_
6	yes	yes	INTJ	UH	Polarity=Pos	11	discourse	_	_
7	-	-	PUNCT	HYPH	_	6	punct	_	_
8	or	or	CCONJ	CC	_	11	cc	_	_
9	-	-	PUNCT	,	_	8	punct	_	_
10	no	no	DET	DT	PronType=Neg	11	det	_	_
11	questions	question	NOUN	NNS	Number=Plur	5	obj	_	_
12	one	one	NUM	CD	NumForm=Word|NumType=Card	11	flat	_	_
13	after	after	ADP	IN	_	14	case	_	_
14	another	another	DET	DT	PronType=Ind	12	nmod	_	Agree=R5-strong|Haiku=11:nmod
15	,	,	PUNCT	,	_	18	punct	_	_
16	each	each	DET	DT	PronType=Tot	17	det	_	_
17	answer	answer	NOUN	NN	Number=Sing	18	nsubj	_	_
18	choosing	choose	VERB	VBG	Tense=Pres|VerbForm=Part	5	advcl	_	_
19	the	the	DET	DT	Definite=Def|PronType=Art	21	det	_	_
20	next	next	ADJ	JJ	Degree=Pos	21	amod	_	_
21	question	question	NOUN	NN	Number=Sing	18	obj	_	_
22	,	,	PUNCT	,	_	24	punct	_	_
23	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	24	aux:pass	_	_
24	called	call	VERB	VBN	Tense=Past|VerbForm=Part|Voice=Pass	0	root	_	_
25	a	a	DET	DT	Definite=Ind|PronType=Art	27	det	_	_
26	decision	decision	NOUN	NN	Number=Sing	27	compound	_	_
27	tree	tree	NOUN	NN	Number=Sing	24	xcomp	_	Agree=R7-rel-agree|Haiku=24:obj
28	.	.	PUNCT	.	_	24	punct	_	_
```

## Pragmatics {#pragmatics}

<!-- sa -->
- form: statement
- act: assert
- voice: narrator
- polarity: none
- teacher: changed act=assert

<!-- .fr -->
| # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | **ask** *speech: ask* | present | a sorting machine | no questions |  |  |  |  | vn inquire-37.1.2 «NP V NP.recipient»: agent=Agent question=Recipient |
| 2 | **choose** | gerund | each answer | the next question |  |  |  |  | vn get-13.5.1 «NP V NP»: agent=Agent question=Theme |
| 3 | **call** | present · passive |  | a sorting machine |  |  |  |  | vn initiate\_communication-37.4.2-1 «NP V NP.recipient»: subject=Recipient |

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

<!-- div src -->

**Licence: [CC BY-SA 4.0](https://creativecommons.org/licenses/by-sa/4.0/)**, as the whole of Mova corpus 0.4, of which this treebank (the agreed school, `mova-school-agreed-en.conllu`) is part. The lessons were written for Mova's primary school. Sentence `school:ai:031-olympiad-thinking-like-a-machine.lesson:10`.

**The tree:** Mova annot: Rust (en) → Haiku 5.5 (medium, Batches API) patches; gates UD 2.18; agreed by treeagree rules (Stanza, Trankit, spaCy trf): R5-strong ×1, R7-rel-agree ×1. **The frames** are read from the tree by Mova's frames reader (`prag`) when this page is built, the lesson read in order, so a pronoun may be resolved from an earlier sentence.

See the [release 0.4](https://md.mova.elamur.ai/free/en/releases/0.4/).

<!-- /div -->

<!-- pn -->
- ← previous: [Olympiad: thinking like a machine, Beb…, 9](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/9/)
- next →: [Olympiad: thinking like a machine, Beb…, 11](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/11/)
- ↑ back to [the lesson](https://md.mova.elamur.ai/free/en/corpora/school/ai/31-olympiad-thinking-like-a-machine/)

