--- title: Change CAT into DOG, one letter at a time. Which ladder is legal? — Olympiad: word puzzles — anagrams, pal… · tree and pragmatics description: Change CAT into DOG, one letter at a time. Which ladder is legal? Test 3 · ★★★ of lesson 56 «Olympiad: word puzzles — anagrams, palindromes, word ladders» of the English course of Mova's primary school, with the dependency tree and pragmatics of the question and of each option; Mova's choice was rig --- [Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/questions/english/56-olympiad-word-puzzles-anagrams-palindromes-word-ladders/t3/) [home](https://md.mova.elamur.ai/free/en/) / [corpora](https://md.mova.elamur.ai/free/en/corpora/) / [questions](https://md.mova.elamur.ai/free/en/corpora/questions/) / [English](https://md.mova.elamur.ai/free/en/corpora/questions/english/) / [Olympiad: word puzzles — anagrams, pal…](https://md.mova.elamur.ai/free/en/corpora/questions/english/56-olympiad-word-puzzles-anagrams-palindromes-word-ladders/) / t3 # Test 3 · ★★★ · Olympiad: word puzzles — anagrams, palindromes, word ladders Change CAT into DOG, one letter at a time. Which ladder is legal? **Mova's choice:** option 1 · **The right answer:** option 1 · right ✓ · **Who acts:** you, ladder · **What happens:** change, be · **To what, where:** CAT This is test 3 · ★★★ of lesson 56 «Olympiad: word puzzles — anagrams, palindromes, word ladders» of the English course of Mova's primary school. The page gives the question's syntax tree — a dependency tree in the style of Universal Dependencies — and its pragmatics clause by clause, then the 4 options as the student saw them, each with its tree and pragmatics. Every text is parsed by Mova itself. How the student answered it, with the score of every option and why: [the test at school](https://md.mova.elamur.ai/free/en/school-run/english/56-olympiad-word-puzzles-anagrams-palindromes-word-ladders/#t3). ## The question {#question} *Sentence 1:* Change CAT into DOG, one letter at a time. ```conllu # sent_id = question:english:56-olympiad-word-puzzles-anagrams-palindromes-word-ladders:t3:1 # text = Change CAT into DOG, one letter at a time. 1 Change change VERB VB Mood=Imp|VerbForm=Fin 0 root _ _ 2 CAT cat NOUN NN Number=Sing 1 obj _ _ 3 into into ADP IN _ 4 case _ _ 4 DOG dog NOUN NN Number=Sing 1 obl _ SpaceAfter=No 5 , , PUNCT , _ 7 punct _ _ 6 one one NUM CD NumForm=Word|NumType=Card 7 nummod _ _ 7 letter letter NOUN NN Number=Sing 4 conj _ _ 8 at at ADP IN _ 10 case _ _ 9 a a DET DT Definite=Ind|PronType=Art 10 det _ _ 10 time time NOUN NN Number=Sing 1 obl _ SpaceAfter=No 11 . . PUNCT . _ 1 punct _ _ ``` | # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | 1 | **change** | imperative | you *not said here* | CAT | | | time | into DOG and one letter *result* | vn turn-26.6.1-1 «NP V NP.patient PP.result»: agent=Agent cat=Patient into dog=Result | 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. *Sentence 2:* Which ladder is legal? ```conllu # sent_id = question:english:56-olympiad-word-puzzles-anagrams-palindromes-word-ladders:t3:2 # text = Which ladder is legal? 1 Which which DET WDT PronType=Int 2 det _ _ 2 ladder ladder NOUN NN Number=Sing 4 nsubj _ _ 3 is be AUX VBZ Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin 4 cop _ _ 4 legal legal ADJ JJ Degree=Pos 0 root _ SpaceAfter=No 5 ? ? PUNCT . _ 4 punct _ _ ``` | # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | 1 | **is** | present | which ladder | | | | | legal *property* | tree rules | ## The options {#options} ### Option 1 · ← Mova's choice · ✓ the right answer {#o1} CAT, COT, COG, DOG ```conllu # sent_id = question:english:56-olympiad-word-puzzles-anagrams-palindromes-word-ladders:t3:o1:1 # text = CAT, COT, COG, DOG 1 CAT cat NOUN NN Number=Sing 0 root _ SpaceAfter=No 2 , , PUNCT , _ 3 punct _ _ 3 COT cot NOUN NN Number=Sing 1 conj _ SpaceAfter=No 4 , , PUNCT , _ 5 punct _ _ 5 COG cog NOUN NN Number=Sing 1 conj _ SpaceAfter=No 6 , , PUNCT , _ 7 punct _ _ 7 DOG dog NOUN NN Number=Sing 1 conj _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 2 {#o2} CAT, BAT, BOG, DOG ```conllu # sent_id = question:english:56-olympiad-word-puzzles-anagrams-palindromes-word-ladders:t3:o2:1 # text = CAT, BAT, BOG, DOG 1 CAT cat NOUN NN Number=Sing 0 root _ SpaceAfter=No 2 , , PUNCT , _ 3 punct _ _ 3 BAT bat NOUN NN Number=Sing 1 appos _ SpaceAfter=No 4 , , PUNCT , _ 5 punct _ _ 5 BOG bog NOUN NN Number=Sing 1 conj _ SpaceAfter=No 6 , , PUNCT , _ 7 punct _ _ 7 DOG dog NOUN NN Number=Sing 1 conj _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 3 {#o3} CAT, DOT, DOG ```conllu # sent_id = question:english:56-olympiad-word-puzzles-anagrams-palindromes-word-ladders:t3:o3:1 # text = CAT, DOT, DOG 1 CAT cat NOUN NN Number=Sing 0 root _ SpaceAfter=No 2 , , PUNCT , _ 3 punct _ _ 3 DOT dot NOUN NN Number=Sing 1 conj _ SpaceAfter=No 4 , , PUNCT , _ 5 punct _ _ 5 DOG dog NOUN NN Number=Sing 1 conj _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 4 {#o4} CAT, CAG, DOG ```conllu # sent_id = question:english:56-olympiad-word-puzzles-anagrams-palindromes-word-ladders:t3:o4:1 # text = CAT, CAG, DOG 1 CAT cat NOUN NN Number=Sing 0 root _ SpaceAfter=No 2 , , PUNCT , _ 3 punct _ _ 3 CAG cag NOUN NN Number=Sing 1 conj _ SpaceAfter=No 4 , , PUNCT , _ 5 punct _ _ 5 DOG dog NOUN NN Number=Sing 1 conj _ _ ``` The frames reader finds no event or fact in this sentence. **Text:** the tests of Mova's primary school, written for Mova (`world/data/school/`), as the course runner gave them to the student. **Trees:** Mova's own parse — the `en` model on the CPU, when the site is built — not checked by a teacher; they may be wrong. **Frames:** Mova's frames reader (`prag`), each text read on its own. Elamur Cosmic License. - ← previous: [Olympiad: word puzzles — anagrams, pal…, test 2](https://md.mova.elamur.ai/free/en/corpora/questions/english/56-olympiad-word-puzzles-anagrams-palindromes-word-ladders/t2/) - next →: [Olympiad: word puzzles — anagrams, pal…, test 4](https://md.mova.elamur.ai/free/en/corpora/questions/english/56-olympiad-word-puzzles-anagrams-palindromes-word-ladders/t4/) - ↑ back to [Olympiad: word puzzles — anagrams, palindromes, word ladders](https://md.mova.elamur.ai/free/en/corpora/questions/english/56-olympiad-word-puzzles-anagrams-palindromes-word-ladders/)