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
The words, one row each (CoNLL-U)
| # | word | lemma | UPOS | features | head | relation |
|---|---|---|---|---|---|---|
| 1 | Liking | like | VERB | Tense=Pres VerbForm=Part | 4 tells | csubj |
| 2 | or | or | CCONJ | _ | 3 sharing | cc |
| 3 | sharing | share | VERB | Tense=Pres VerbForm=Part | 1 Liking | conj |
| 4 | tells | tell | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | root | root |
| 5 | the | the | DET | Definite=Def PronType=Art | 6 algorithm | det |
| 6 | algorithm | algorithm | NOUN | Number=Sing | 4 tells | obj |
| 7 | to | to | PART | _ | 8 show | mark |
| 8 | show | show | VERB | VerbForm=Inf | 4 tells | xcomp |
| 9 | more | more | ADJ | Degree=Cmp | 8 show | obj |
| 10 | and | and | CCONJ | _ | 11 tells | cc |
| 11 | tells | tell | VERB | Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin | 4 tells | conj |
| 12 | friends | friend | NOUN | Number=Plur | 11 tells | obj |
| 13 | you | you | PRON | Case=Nom Person=2 PronType=Prs | 14 agree | nsubj |
| 14 | agree | agree | VERB | Mood=Ind Number=Sing Person=2 Tense=Pres VerbForm=Fin | 11 tells | ccomp |
| 15 | ; | ; | PUNCT | _ | 18 like | punct |
| 16 | you | you | PRON | Case=Nom Person=2 PronType=Prs | 18 like | nsubj |
| 17 | can | can | AUX | VerbForm=Fin | 18 like | aux |
| 18 | like | like | VERB | VerbForm=Inf | 4 tells | parataxis |
| 19 | a | a | DET | Definite=Ind PronType=Art | 20 creator | det |
| 20 | creator | creator | NOUN | Number=Sing | 18 like | obj |
| 21 | without | without | SCONJ | _ | 22 sharing | mark |
| 22 | sharing | share | VERB | Tense=Pres VerbForm=Part | 18 like | advcl |
| 23 | everything | everything | PRON | Number=Sing PronType=Tot | 22 sharing | obj |
| 24 | they | they | PRON | Case=Nom Number=Plur Person=3 PronType=Prs | 25 post | nsubj |
| 25 | post | post | VERB | Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin | 23 everything | acl:relcl |
| 26 | . | . | PUNCT | _ | 4 tells | punct |
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, 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.
This page in Markdown → https://md.mova.elamur.ai/free/en/corpora/school/politics/34-algorithms-bubbles-and-false-balance/13/