--- title: Codes are puzzles with a secret rule: shift every letter one step al… — Olympiad: real languages and codes · tree and pragmatics description: Codes are puzzles with a secret rule: shift every letter one step along the alphabet (IFMMP is HELLO), or swap letters for numbers (A = 1, B = 2 and so on). Who acts: Codes. A sentence of the lesson «Olympiad: real languages and codes» of the english 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/english/59-olympiad-real-languages-and-codes/3/) [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/) / [English](https://md.mova.elamur.ai/free/en/corpora/school/english/) / [Olympiad: real languages and codes](https://md.mova.elamur.ai/free/en/corpora/school/english/59-olympiad-real-languages-and-codes/) / 3 # Olympiad: real languages and codes, sentence 3 Codes are puzzles with a secret rule: shift every letter one step along the alphabet (IFMMP is HELLO), or swap letters for numbers (A = 1, B = 2 and so on). **Who acts:** Codes · **What happens:** be, shift · **To what, where:** puzzles, letter, HELLO This is a sentence of the lesson «Olympiad: real languages and codes» of the english 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 (Codes), what happens, when and where, as Mova's frames read it from the tree. ## The tree {#tree} ```conllu # sent_id = school:english:059-olympiad-real-languages-and-codes.lesson:3 # text = Codes are puzzles with a secret rule: shift every letter one step along the alphabet (IFMMP is HELLO), or swap letters for numbers (A = 1, B = 2 and so on). # source = school lesson (ours) # course = english # lesson = 059-olympiad-real-languages-and-codes.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 ×1, R7-rel-agree ×2 1 Codes code NOUN NNS Number=Plur 3 nsubj _ _ 2 are be AUX VBP Mood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin 3 cop _ _ 3 puzzles puzzle NOUN NNS Number=Plur 0 root _ _ 4 with with ADP IN _ 7 case _ _ 5 a a DET DT Definite=Ind|PronType=Art 7 det _ _ 6 secret secret ADJ JJ Degree=Pos 7 amod _ Agree=R7-rel-agree|Haiku=7:compound|HaikuPos=NOUN:NN:Number=Sing 7 rule rule NOUN NN Number=Sing 3 nmod _ _ 8 : : PUNCT : _ 9 punct _ _ 9 shift shift VERB VB VerbForm=Inf 3 parataxis _ Agree=R7-rel-agree|Haiku=3:conj 10 every every DET DT PronType=Tot 11 det _ Agree=R5-strong|Haiku=13:det 11 letter letter NOUN NN Number=Sing 9 obj _ Agree=R5-strong|Haiku=13:compound 12 one one NUM CD NumForm=Word|NumType=Card 11 flat _ _ 13 step step NOUN NN Number=Sing 9 obj _ _ 14 along along ADP IN _ 16 case _ _ 15 the the DET DT Definite=Def|PronType=Art 16 det _ _ 16 alphabet alphabet NOUN NN Number=Sing 9 obl _ _ 17 ( ( PUNCT -LRB- _ 18 punct _ _ 18 IFMMP IFMMP PROPN NNP Number=Sing 16 appos _ _ 19 is be AUX VBZ Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin 20 cop _ _ 20 HELLO hello PROPN NNP Number=Sing 18 parataxis _ _ 21 ) ) PUNCT -RRB- _ 20 punct _ Agree=R6-punct-agree|Haiku=18:punct 22 , , PUNCT , _ 25 punct _ _ 23 or or CCONJ CC _ 25 cc _ _ 24 swap swap NOUN NN Number=Sing 25 compound _ _ 25 letters letter NOUN NNS Number=Plur 9 obl _ _ 26 for for ADP IN _ 27 case _ _ 27 numbers number NOUN NNS Number=Plur 25 nmod _ _ 28 ( ( PUNCT -LRB- _ 29 punct _ _ 29 A A NOUN NN Number=Sing 27 conj _ _ 30 = = SYM SYM _ 31 case _ _ 31 1 1 NUM CD NumForm=Digit|NumType=Card 29 nmod _ _ 32 , , PUNCT , _ 33 punct _ _ 33 B B PROPN NNP Number=Sing 27 nmod _ _ 34 = = ADV RB _ 35 advmod _ _ 35 2 2 NUM CD NumForm=Digit|NumType=Card 33 flat _ _ 36 and and CCONJ CC _ 38 cc _ _ 37 so so ADV RB _ 38 advmod _ _ 38 on on ADP IN _ 25 nmod _ _ 39 ) ) PUNCT -RRB- _ 38 punct _ _ 40 . . 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 a** | present | Codes | puzzles | | | | with a secret rule | tree rules | | 2 | **shift** | infinitive | | every letter | | | | along the alphabet; swap letters for numbers B and A = 1 *obl* | vn caused\_calibratable\_cos-45.6.2-1 «NP V NP.patient NP.extent PP.initial\_state PP.result»: agent=Causer letter=Patient step=Extent | | 3 | **is a** | present | | HELLO | | | | | tree rules | 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:english:059-olympiad-real-languages-and-codes.lesson:3`. **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 ×1, R7-rel-agree ×2. **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: [Olympiad: real languages and codes, 2](https://md.mova.elamur.ai/free/en/corpora/school/english/59-olympiad-real-languages-and-codes/2/) - next →: [Olympiad: real languages and codes, 4](https://md.mova.elamur.ai/free/en/corpora/school/english/59-olympiad-real-languages-and-codes/4/) - ↑ back to [the lesson](https://md.mova.elamur.ai/free/en/corpora/school/english/59-olympiad-real-languages-and-codes/)