--- title: Mia's family found 14 bits of AI in one day. If each of 3 days had 1… — Counting the AI in one ordinary day · tree and pragmatics description: Mia's family found 14 bits of AI in one day. If each of 3 days had 14, how many would they count? Test 10 · ★ of lesson 19 «Counting the AI in one ordinary day» of the AI course of Mova's primary school, with the dependency tree and pragmatics of the question and of each option; Mova's choice was wr --- [Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/questions/ai/19-ai-in-one-ordinary-day/t10/) [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/) / [AI](https://md.mova.elamur.ai/free/en/corpora/questions/ai/) / [Counting the AI in one ordinary day](https://md.mova.elamur.ai/free/en/corpora/questions/ai/19-ai-in-one-ordinary-day/) / t10 # Test 10 · ★ · Counting the AI in one ordinary day Mia's family found 14 bits of AI in one day. If each of 3 days had 14, how many would they count? **Mova's choice:** option 1 · **The right answer:** option 2 · wrong ✗ · **Who acts:** family, 3 days, many · **What happens:** find, have, count · **To what, where:** 14 bits, 14 This is test 10 · ★ of lesson 19 «Counting the AI in one ordinary day» of the AI 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/ai/19-ai-in-one-ordinary-day/#t10). ## The question {#question} *Sentence 1:* Mia's family found 14 bits of AI in one day. ```conllu # sent_id = question:ai:19-ai-in-one-ordinary-day:t10:1 # text = Mia's family found 14 bits of AI in one day. 1 Mia Mia PROPN NNP Number=Sing 3 nmod:poss _ SpaceAfter=No 2 's 's PART POS _ 1 case _ _ 3 family family NOUN NN Number=Sing 4 nsubj _ _ 4 found find VERB VBD Mood=Ind|Number=Sing|Person=3|Tense=Past|VerbForm=Fin 0 root _ _ 5 14 14 NUM CD NumForm=Digit|NumType=Card 6 nummod _ _ 6 bits bit NOUN NNS Number=Plur 4 obj _ _ 7 of of ADP IN _ 8 case _ _ 8 AI ai NOUN NN Number=Sing 6 nmod _ _ 9 in in ADP IN _ 11 case _ _ 10 one one NUM CD NumForm=Word|NumType=Card 11 nummod _ _ 11 day day NOUN NN Number=Sing 4 obl _ SpaceAfter=No 12 . . PUNCT . _ 4 punct _ _ ``` | # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | 1 | **find** | past | Mia's family | 14 bits of AI | | | day | | vn discover-84 «NP V NP»: agent=Agent bit=Topic | 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:* If each of 3 days had 14, how many would they count? ```conllu # sent_id = question:ai:19-ai-in-one-ordinary-day:t10:2 # text = If each of 3 days had 14, how many would they count? 1 If if SCONJ IN _ 6 mark _ _ 2 each each DET DT PronType=Tot 5 det _ _ 3 of of ADP IN _ 5 case _ _ 4 3 3 NUM CD NumForm=Digit|NumType=Card 5 nummod _ _ 5 days day NOUN NNS Number=Plur 6 nsubj _ _ 6 had have VERB VBD Mood=Ind|Number=Plur|Person=3|Tense=Past|VerbForm=Fin 13 advcl _ _ 7 14 14 NUM CD NumForm=Digit|NumType=Card 6 obj _ SpaceAfter=No 8 , , PUNCT , _ 13 punct _ _ 9 how how ADV WRB PronType=Int 10 advmod _ _ 10 many many ADJ JJ Degree=Pos 13 nsubj _ _ 11 would would AUX MD VerbForm=Fin 13 aux _ _ 12 they they PRON PRP Case=Nom|Number=Plur|Person=3|PronType=Prs 13 nsubj _ _ 13 count count VERB VB VerbForm=Inf 0 root _ SpaceAfter=No 14 ? ? PUNCT . _ 13 punct _ _ ``` | # | verb | tense, mood | who | what, whom | to whom | where | when | other | roles by | | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | | 1 | **have** *a condition, not said to happen* | past | each 3 days | 14 | | | | | vn birth-28.2-1 «NP V NP»: agent=Agent 14=Patient | | 2 | **count** | would | many | | | | | | vn matter-91 «NP V»: agent=Stimulus | ## The options {#options} ### Option 1 · ← Mova's choice {#o1} 28 ```conllu # sent_id = question:ai:19-ai-in-one-ordinary-day:t10:o1:1 # text = 28 1 28 28 NUM CD NumForm=Digit|NumType=Card 0 root _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 2 · ✓ the right answer {#o2} 42 ```conllu # sent_id = question:ai:19-ai-in-one-ordinary-day:t10:o2:1 # text = 42 1 42 42 NUM CD NumForm=Digit|NumType=Card 0 root _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 3 {#o3} 34 ```conllu # sent_id = question:ai:19-ai-in-one-ordinary-day:t10:o3:1 # text = 34 1 34 34 NUM CD NumForm=Digit|NumType=Card 0 root _ _ ``` The frames reader finds no event or fact in this sentence. ### Option 4 {#o4} 17 ```conllu # sent_id = question:ai:19-ai-in-one-ordinary-day:t10:o4:1 # text = 17 1 17 17 NUM CD NumForm=Digit|NumType=Card 0 root _ _ ``` 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: [Counting the AI in one ordinary day, test 9](https://md.mova.elamur.ai/free/en/corpora/questions/ai/19-ai-in-one-ordinary-day/t9/) - next →: [Counting the AI in one ordinary day, exam 1](https://md.mova.elamur.ai/free/en/corpora/questions/ai/19-ai-in-one-ordinary-day/e1/) - ↑ back to [Counting the AI in one ordinary day](https://md.mova.elamur.ai/free/en/corpora/questions/ai/19-ai-in-one-ordinary-day/)