Mova0.5 pre-release⌕
☰
home / corpora / questions / Everyday / Too-good-to-be-true offers, online sca… / t13

Test 13 · ★★ · Too-good-to-be-true offers, online scams and checking the…

500 accounts saying the same thing so it must be true

Mova's choice: option 3 · The right answer: option 3 · right ✓ · Who acts: 500 accounts, thing · What happens: say, be · To what, where: same thing · Speech: someone speaks here

This is test 13 · ★★ of lesson 314 «Too-good-to-be-true offers, online scams and checking the news» of the everyday 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.

The question

nummodacldetamodobjadvmodnsubjauxcopccomproot500NUMaccountsNOUNsayingVERBtheDETsameADJthingNOUNsoADVitPRONmustAUXbeAUXtrueADJ
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1500500NUMNumForm=Digit NumType=Card2 accountsnummod
2accountsaccountNOUNNumber=Plurrootroot
3sayingsayVERBVerbForm=Ger2 accountsacl
4thetheDETDefinite=Def PronType=Art6 thingdet
5samesameADJDegree=Pos6 thingamod
6thingthingNOUNNumber=Sing3 sayingobj
7sosoADV_11 trueadvmod
8ititPRONCase=Nom Gender=Neut Number=Sing Person=3 PronType=Prs11 truensubj
9mustmustAUXVerbForm=Fin11 trueaux
10bebeAUXVerbForm=Inf11 truecop
11truetrueADJDegree=Pos3 sayingccomp
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1say speech: assertgerund500 accounts not said herethe same thingvn say-37.7-1-1 «NP V NP.topic»: agent=Agent thing=Topic
2ismustthingtrue propertytree 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.

The options

Option 1

Only if they use capitals

advmodmarknsubjobjrootOnlyADVifSCONJtheyPRONuseVERBcapitalsNOUN
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1OnlyonlyADV_4 useadvmod
2ififSCONJ_4 usemark
3theytheyPRONCase=Nom Number=Plur Person=3 PronType=Prs4 usensubj
4useuseVERBMood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Finrootroot
5capitalscapitalNOUNNumber=Plur4 useobj
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1usepresenttheycapitalsvn eat-39.1 «NP V NP»: agent=Agent capital=Patient

Option 2

Yes, that many people can't all be wrong at once

discoursepunctmarkamodnsubjauxadvmodadvmodcopcaseoblrootYesINTJ,PUNCTthatSCONJmanyADJpeopleNOUNcaAUXn'tPARTallADVbeAUXwrongADJatADPonceADV
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1YesyesINTJPolarity=Pos10 wrongdiscourse
2,,PUNCT_10 wrongpunct
3thatthatSCONJ_10 wrongmark
4manymanyADJDegree=Pos5 peopleamod
5peoplepeopleNOUNNumber=Plur10 wrongnsubj
6cacanAUXVerbForm=Fin10 wrongaux
7n'tnotPARTPolarity=Neg10 wrongadvmod
8allallADV_10 wrongadvmod
9bebeAUXVerbForm=Inf10 wrongcop
10wrongwrongADJDegree=Posrootroot
11atatADP_12 oncecase
12onceonceADVNumForm=Word NumType=Mult10 wrongobl
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1not iscanmany peopleall, wrong propertytree rules

Option 3 · ← Mova's choice · ✓ the right answer

Not always, bots repeat things to look popular

advmodadvmodpunctnsubjobjmarkadvclxcomprootNotPARTalwaysADV,PUNCTbotsNOUNrepeatVERBthingsNOUNtoPARTlookVERBpopularADJ
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1NotnotPARTPolarity=Neg2 alwaysadvmod
2alwaysalwaysADVPronType=Tot5 repeatadvmod
3,,PUNCT_2 alwayspunct
4botsbotNOUNNumber=Plur5 repeatnsubj
5repeatrepeatVERBMood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Finrootroot
6thingsthingNOUNNumber=Plur5 repeatobj
7totoPART_8 lookmark
8looklookVERBVerbForm=Inf5 repeatadvcl
9popularpopularADJDegree=Pos8 lookxcomp
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1repeatpresentbotsthingsalways propertyvn begin-55.1-1-1 «NP V NP»: agent=Agent thing=Eventuality
2lookto-infinitivebots not said herepopular propertyvn stimulus_subject-30.4 «NP V ADJ»: agent=Stimulus

Option 4

Yes, if they all have photos

discoursepunctmarknsubjadvmodobjrootYesINTJ,PUNCTifSCONJtheyPRONallDEThaveVERBphotosNOUN
The words, one row each (CoNLL-U)
#wordlemmaUPOSfeaturesheadrelation
1YesyesINTJPolarity=Pos6 havediscourse
2,,PUNCT_6 havepunct
3ififSCONJ_6 havemark
4theytheyPRONCase=Nom Number=Plur Person=3 PronType=Prs6 havensubj
5allallDETPronType=Tot6 haveadvmod
6havehaveVERBMood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Finrootroot
7photosphotoNOUNNumber=Plur6 haveobj
#verbtense, moodwhowhat, whomto whomwherewhenotherroles by
1havepresenttheyphotosvn birth-28.2-1 «NP V NP»: agent=Agent photo=Patient

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.

This page in Markdown → https://md.mova.elamur.ai/free/en/corpora/questions/everyday/314-too-good-offers-scams-and-checking-news/t13/