--- title: It's lopsided in a funny way: ONE example breaks "nobody can", but t… — One counterexample is enough · tree and pragmatics description: It's lopsided in a funny way: ONE example breaks "nobody can", but to PROVE "nobody can" you would have to check everybody. Who acts: trick, ONE example, you. A sentence of the lesson «One counterexample is enough» of the world course of Mova's primary school with its dependency tree and the pragmat --- [Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/school/world/187-one-counterexample-is-enough/4/) [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/) / [World](https://md.mova.elamur.ai/free/en/corpora/school/world/) / [One counterexample is enough](https://md.mova.elamur.ai/free/en/corpora/school/world/187-one-counterexample-is-enough/) / 4 # One counterexample is enough, sentence 4 It's lopsided in a funny way: ONE example breaks "nobody can", but to PROVE "nobody can" you would have to check everybody. **Who acts:** trick, ONE example, you · **What happens:** be, break, prove, have, check · **To what, where:** funny way, nobody, everybody This is a sentence of the lesson «One counterexample is enough» of the world 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 (trick, ONE example, you), what happens, when and where, as Mova's frames read it from the tree. ## The tree {#tree} ```conllu # sent_id = school:world:187-one-counterexample-is-enough.lesson:4 # text = It's lopsided in a funny way: ONE example breaks "nobody can", but to PROVE "nobody can" you would have to check everybody. # source = school lesson (ours) # course = world # lesson = 187-one-counterexample-is-enough.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 ×2, R6-punct-agree ×2, R8-pos-agree ×1 1 It it PRON PRP Case=Nom|Gender=Neut|Number=Sing|Person=3|PronType=Prs 3 nsubj _ _ 2 's be AUX VBZ Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin 3 cop _ _ 3 lopsided lopsided ADJ JJ Degree=Pos 0 root _ _ 4 in in ADP IN _ 7 case _ _ 5 a a DET DT Definite=Ind|PronType=Art 7 det _ _ 6 funny funny ADJ JJ Degree=Pos 7 amod _ _ 7 way way NOUN NN Number=Sing 3 obl _ _ 8 : : PUNCT : _ 3 punct _ _ 9 ONE one NUM CD NumForm=Word|NumType=Card 10 nummod _ _ 10 example example NOUN NN Number=Sing 11 nsubj _ _ 11 breaks break VERB VBZ Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin 3 parataxis _ _ 12 " " PUNCT '' _ 11 punct _ _ 13 nobody nobody PRON NN Number=Sing|PronType=Neg 14 nsubj _ Agree=R5-strong|Haiku=11:obj 14 can can AUX MD VerbForm=Fin 11 ccomp _ Agree=R5-strong|Haiku=13:acl:relcl 15 " " PUNCT '' _ 14 punct _ Agree=R8-pos-agree|Haiku=14:punct|HaikuPos=PUNCT:``:_ 16 , , PUNCT , _ 26 punct _ Agree=R6-punct-agree|Haiku=19:punct 17 but but CCONJ CC _ 26 cc _ _ 18 to to PART TO _ 19 mark _ _ 19 PROVE prove VERB VB VerbForm=Inf 26 advcl _ _ 20 " " PUNCT `` _ 26 punct _ _ 21 nobody nobody PRON NN Number=Sing|PronType=Neg 19 obj _ _ 22 can can AUX MD VerbForm=Fin 21 aux _ _ 23 " " PUNCT '' _ 22 punct _ Agree=R6-punct-agree|Haiku=21:punct|HaikuPos=PUNCT:``:_ 24 you you PRON PRP Case=Nom|Person=2|PronType=Prs 26 nsubj _ _ 25 would would AUX MD VerbForm=Fin 26 aux _ _ 26 have have VERB VB VerbForm=Inf 11 conj _ _ 27 to to PART TO _ 28 mark _ _ 28 check check VERB VB VerbForm=Inf 26 xcomp _ _ 29 everybody everybody PRON NN Number=Sing|PronType=Tot 28 obj _ _ 30 . . PUNCT . _ 3 punct _ _ ``` ## Pragmatics {#pragmatics} - form: statement - act: assert - voice: narrator - polarity: none - teacher: kept the draft | # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | 1 | **is** | present | trick | | | a funny way | | lopsided *property* | tree rules | | 2 | **break** | present | ONE example | | | | | | vn hurt-40.8.3-1-1 «NP V»: agent=Patient | | 3 | **prove** | to-infinitive | you *not said here* | nobody | | | | | vn deduce-97.2 «NP V NP»: agent=Agent nobody=Theme | | 4 | **have** | would | you | | | | | | tree rules | | 5 | **check** | to-infinitive | you *not said here* | everybody | | | | | vn assessment-34.1 «NP V NP»: agent=Agent everybody=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:world:187-one-counterexample-is-enough.lesson:4`. **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 ×2, R6-punct-agree ×2, R8-pos-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: [One counterexample is enough, 3](https://md.mova.elamur.ai/free/en/corpora/school/world/187-one-counterexample-is-enough/3/) - next →: [One counterexample is enough, 5](https://md.mova.elamur.ai/free/en/corpora/school/world/187-one-counterexample-is-enough/5/) - ↑ back to [the lesson](https://md.mova.elamur.ai/free/en/corpora/school/world/187-one-counterexample-is-enough/)