--- title: An algorithm is a set of rules a computer follows; feeds use it to c… — Algorithms, bubbles and false balance · tree and pragmatics description: An algorithm is a set of rules a computer follows; feeds use it to choose what to show next from what you watched and clicked. Who acts: algorithm, computer, feeds, you. A sentence of the lesson «Algorithms, bubbles and false balance» of the politics course of Mova's primary school with its dependen --- [Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/school/politics/34-algorithms-bubbles-and-false-balance/5/) [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/) / [Politics](https://md.mova.elamur.ai/free/en/corpora/school/politics/) / [Algorithms, bubbles and false balance](https://md.mova.elamur.ai/free/en/corpora/school/politics/34-algorithms-bubbles-and-false-balance/) / 5 # Algorithms, bubbles and false balance, sentence 5 An algorithm is a set of rules a computer follows; feeds use it to choose what to show next from what you watched and clicked. **Who acts:** algorithm, computer, feeds, you · **What happens:** be, follow, use, choose, show, watch · **To what, where:** set, rules, computer This is a sentence of the lesson «Algorithms, bubbles and false balance» of the politics 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 (algorithm, computer, feeds, you), what happens, when and where, as Mova's frames read it from the tree. ## The tree {#tree} ```conllu # sent_id = school:politics:034-algorithms-bubbles-and-false-balance.lesson:5 # text = An algorithm is a set of rules a computer follows; feeds use it to choose what to show next from what you watched and clicked. # source = school lesson (ours) # course = politics # lesson = 034-algorithms-bubbles-and-false-balance.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 An a DET DT Definite=Ind|PronType=Art 2 det _ _ 2 algorithm algorithm NOUN NN Number=Sing 5 nsubj _ _ 3 is be AUX VBZ Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin 5 cop _ _ 4 a a DET DT Definite=Ind|PronType=Art 5 det _ _ 5 set set NOUN NN Number=Sing 0 root _ _ 6 of of ADP IN _ 7 case _ _ 7 rules rule NOUN NNS Number=Plur 5 nmod _ _ 8 a a DET DT Definite=Ind|PronType=Art 9 det _ _ 9 computer computer NOUN NN Number=Sing 10 nsubj _ _ 10 follows follow VERB VBZ Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin 7 acl:relcl _ _ 11 ; ; PUNCT , _ 13 punct _ _ 12 feeds feed NOUN NNS Number=Plur 13 nsubj _ _ 13 use use VERB VBP Mood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin 5 parataxis _ Agree=R7-rel-agree|Haiku=5:conj 14 it it PRON PRP Case=Acc|Gender=Neut|Number=Sing|Person=3|PronType=Prs 13 obj _ _ 15 to to PART TO _ 16 mark _ _ 16 choose choose VERB VB VerbForm=Inf 13 advcl _ _ 17 what what PRON WP PronType=Int 19 obj _ _ 18 to to PART TO _ 19 mark _ _ 19 show show VERB VB VerbForm=Inf 16 xcomp _ _ 20 next next ADV RB _ 19 advmod _ Agree=R5-strong|Haiku=22:advmod 21 from from ADP IN _ 22 case _ _ 22 what what PRON WP PronType=Int 19 obl _ _ 23 you you PRON PRP Case=Nom|Person=2|PronType=Prs 24 nsubj _ _ 24 watched watch VERB VBD Mood=Ind|Number=Sing|Person=2|Tense=Past|VerbForm=Fin 22 acl:relcl _ _ 25 and and CCONJ CC _ 26 cc _ _ 26 clicked click VERB VBD Mood=Ind|Number=Sing|Person=2|Tense=Past|VerbForm=Fin 24 conj _ _ 27 . . PUNCT . _ 5 punct _ _ ``` ## Pragmatics {#pragmatics} No stored speech act for this sentence. | # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | 1 | **is a** | present | a algorithm | a set | | | | of rules | tree rules | | 2 | **follow** | present | a computer | rules *not said here* | | | | | vn chase-51.6 «NP V NP»: agent=Agent rule=Theme | | 3 | **use** | present | feeds | computer | | | | | vn eat-39.1 «NP V NP»: agent=Agent it=Patient | | 4 | **choose** | to-infinitive | feeds *not said here* | | | | | | tree rules | | 5 | **show** | to-infinitive | feeds *not said here* | | | | | next *property* | vn transfer\_mesg-37.1.1-1-1 «NP V NP.recipient»: agent=Agent what=Recipient | | 6 | **watch** | past | you | | | | | | vn search-35.2 «NP V PP.location»: agent=Agent | | 7 | **click** | past | you *not said here* | | | | | | vn sound\_emission-43.2 «NP V»: agent=Theme | 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. **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:politics:034-algorithms-bubbles-and-false-balance.lesson:5`. **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/). - ← previous: [Algorithms, bubbles and false balance, 4](https://md.mova.elamur.ai/free/en/corpora/school/politics/34-algorithms-bubbles-and-false-balance/4/) - next →: [Algorithms, bubbles and false balance, 6](https://md.mova.elamur.ai/free/en/corpora/school/politics/34-algorithms-bubbles-and-false-balance/6/) - ↑ back to [the lesson](https://md.mova.elamur.ai/free/en/corpora/school/politics/34-algorithms-bubbles-and-false-balance/)