--- title: Liking or sharing tells the algorithm to show more and tells friends… — Algorithms, bubbles and false balance · tree and pragmatics description: Liking or sharing tells the algorithm to show more and tells friends you agree; you can like a creator without sharing everything they post. Who acts: Liking, algorithm, you, people. A sentence of the lesson «Algorithms, bubbles and false balance» of the politics course of Mova's primary school with --- [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/13/) [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/) / 13 # Algorithms, bubbles and false balance, sentence 13 Liking or sharing tells the algorithm to show more and tells friends you agree; you can like a creator without sharing everything they post. **Who acts:** Liking, algorithm, you, people · **What happens:** like, share, tell, show, agree, post · **To what, where:** algorithm, more, friends, creator, everything · **Speech:** someone speaks here 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 (Liking, algorithm, you, people), 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:13 # text = Liking or sharing tells the algorithm to show more and tells friends you agree; you can like a creator without sharing everything they post. # 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): R1-cc-next ×1, R7-rel-agree ×1 1 Liking like VERB VBG Tense=Pres|VerbForm=Part 4 csubj _ _ 2 or or CCONJ CC _ 3 cc _ _ 3 sharing share VERB VBG Tense=Pres|VerbForm=Part 1 conj _ _ 4 tells tell VERB VBZ Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin 0 root _ _ 5 the the DET DT Definite=Def|PronType=Art 6 det _ _ 6 algorithm algorithm NOUN NN Number=Sing 4 obj _ _ 7 to to PART TO _ 8 mark _ _ 8 show show VERB VB VerbForm=Inf 4 xcomp _ _ 9 more more ADJ JJR Degree=Cmp 8 obj _ Agree=R7-rel-agree|Haiku=8:advmod|HaikuPos=ADV:RBR:Degree=Cmp 10 and and CCONJ CC _ 11 cc _ Agree=R1-cc-next|Haiku=4:cc 11 tells tell VERB VBZ Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin 4 conj _ _ 12 friends friend NOUN NNS Number=Plur 11 obj _ _ 13 you you PRON PRP Case=Nom|Person=2|PronType=Prs 14 nsubj _ _ 14 agree agree VERB VBP Mood=Ind|Number=Sing|Person=2|Tense=Pres|VerbForm=Fin 11 ccomp _ _ 15 ; ; PUNCT , _ 18 punct _ _ 16 you you PRON PRP Case=Nom|Person=2|PronType=Prs 18 nsubj _ _ 17 can can AUX MD VerbForm=Fin 18 aux _ _ 18 like like VERB VB VerbForm=Inf 4 parataxis _ _ 19 a a DET DT Definite=Ind|PronType=Art 20 det _ _ 20 creator creator NOUN NN Number=Sing 18 obj _ _ 21 without without SCONJ IN _ 22 mark _ _ 22 sharing share VERB VBG Tense=Pres|VerbForm=Part 18 advcl _ _ 23 everything everything PRON NN Number=Sing|PronType=Tot 22 obj _ _ 24 they they PRON PRP Case=Nom|Number=Plur|Person=3|PronType=Prs 25 nsubj _ _ 25 post post VERB VBP Mood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin 23 acl:relcl _ _ 26 . . PUNCT . _ 4 punct _ _ ``` ## Pragmatics {#pragmatics} No stored speech act for this sentence. | # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | 1 | **like** | gerund | | | | | | | vn want-32.1-1-1 «NP V NP S\_INF»: agent=Pivot | | 2 | **share** | gerund | | | | | | | tree rules | | 3 | **tell** *speech: assert* | present | Liking | the algorithm | | | | | vn transfer\_mesg-37.1.1-1-1 «NP V NP S\_INF»: agent=Agent algorithm=Recipient clause=Topic | | 4 | **show** *not said to happen* | to-infinitive | the algorithm *not said here* | more | | | | | vn transfer\_mesg-37.1.1-1-1 «NP V NP.recipient»: agent=Agent more=Recipient | | 5 | **tell** *speech: assert* | present | Liking *not said here* | | friends | | | | vn transfer\_mesg-37.1.1-1-1 «NP V NP S\_INF»: agent=Agent friend=Recipient clause=Topic | | 6 | **agree** *speech: agree* | present | you | | | | | | vn correspond-36.1-1 «NP V»: agent=Agent | | 7 | **like** | can | you | a creator | | | | | vn want-32.1-1-1 «NP V NP ADV»: agent=Pivot creator=Theme | | 8 | **share** | gerund | you *not said here* | everything | | | | | tree rules | | 9 | **post** | present | people | | | | | | vn send-11.1 «NP V NP»: 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. **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:13`. **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): R1-cc-next ×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, 12](https://md.mova.elamur.ai/free/en/corpora/school/politics/34-algorithms-bubbles-and-false-balance/12/) - next →: [Algorithms, bubbles and false balance, 14](https://md.mova.elamur.ai/free/en/corpora/school/politics/34-algorithms-bubbles-and-false-balance/14/) - ↑ back to [the lesson](https://md.mova.elamur.ai/free/en/corpora/school/politics/34-algorithms-bubbles-and-false-balance/)