Mova0.5 pre-release⌕

☰

home / corpora / questions / English / How to learn spellings that stick / t2

Test 2 · How to learn spellings that stick

«spellcheck'll sort it, spelling's for boomers lol». What's the problem?

Mova's choice: option 3 · The right answer: option 3 · right ✓ · Who acts: spellcheck, problem · What happens: sort, be · To what, where: it

This is test 2 of lesson 15 «How to learn spellings that stick» 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.

The question

Sentence 1: «spellcheck'll sort it, spelling's for boomers lol».

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	«	«	PUNCT	_	4 sort	punct
2	spellcheck	spellcheck	NOUN	Number=Sing	4 sort	nsubj
3	'll	will	AUX	VerbForm=Fin	4 sort	aux
4	sort	sort	VERB	VerbForm=Inf	root	root
5	it	it	PRON	Case=Acc Gender=Neut Number=Sing Person=3 PronType=Prs	4 sort	obj
6	,	,	PUNCT	_	7 spelling	punct
7	spelling	spelling	NOUN	Number=Sing	4 sort	obl
8	's	's	PART	_	7 spelling	case
9	for	for	ADP	_	10 boomers	case
10	boomers	boomer	NOUN	Number=Plur	4 sort	obl
11	lol	lol	INTJ	_	4 sort	discourse
12	»	»	PUNCT	_	4 sort	punct
13	.	.	PUNCT	_	4 sort	punct

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	sort in a quote	future	spellcheck	it				's spelling; for boomers	vn classify-29.10 «NP V NP»: agent=Agent it=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.

Sentence 2: What's the problem?

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	What	what	PRON	PronType=Int	root	root
2	's	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	1 What	cop
3	the	the	DET	Definite=Def PronType=Art	4 problem	det
4	problem	problem	NOUN	Number=Sing	1 What	nsubj
5	?	?	PUNCT	_	1 What	punct

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is a	present	the problem						tree rules

The options

Option 1

Boomers invented spellcheck

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Boomers	boomer	NOUN	Number=Plur	root	root
2	invented	invent	VERB	Tense=Past VerbForm=Part Voice=Pass	1 Boomers	acl
3	spellcheck	spellcheck	NOUN	Number=Sing	2 invented	obj

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	invent	participle	Boomers not said here	spellcheck					vn create-26.4-1 «NP V NP»: agent=Agent spellcheck=Result

Option 2

Spellcheck is always perfect, so there's no problem

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Spellcheck	spellcheck	NOUN	Number=Sing	4 perfect	nsubj
2	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	4 perfect	cop
3	always	always	ADV	PronType=Tot	4 perfect	advmod
4	perfect	perfect	ADJ	Degree=Pos	root	root
5	,	,	PUNCT	_	8 's	punct
6	so	so	ADV	_	8 's	advmod
7	there	there	PRON	PronType=Dem	8 's	expl
8	's	be	VERB	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	4 perfect	parataxis
9	no	no	DET	PronType=Neg	10 problem	det
10	problem	problem	NOUN	Number=Sing	8 's	nsubj

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	is	present	Spellcheck					always, perfect property	tree rules
2	be	present	no problem			there			vn exist-47.1 «NP V»: agent=Theme

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

Spellcheck can pick the wrong word if your try is far off

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Spellcheck	spellcheck	NOUN	Number=Sing	3 pick	nsubj
2	can	can	AUX	VerbForm=Fin	3 pick	aux
3	pick	pick	VERB	VerbForm=Inf	root	root
4	the	the	DET	Definite=Def PronType=Art	6 word	det
5	wrong	wrong	ADJ	Degree=Pos	6 word	amod
6	word	word	NOUN	Number=Sing	3 pick	obj
7	if	if	SCONJ	_	11 far	mark
8	your	your	PRON	Case=Gen Person=2 Poss=Yes PronType=Prs	9 try	nmod:poss
9	try	try	NOUN	Number=Sing	11 far	nsubj
10	is	be	AUX	Mood=Ind Number=Sing Person=3 Tense=Pres VerbForm=Fin	11 far	cop
11	far	far	ADV	Degree=Pos	3 pick	advcl
12	off	off	ADV	_	11 far	advmod

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	pick	can	Spellcheck	the wrong word					vn chew-39.2 «NP V NP»: agent=Agent word=Patient
2	is a condition, not said to happen	present	your try					far, off property	tree rules
3	try		your						nom try «act transitive»: poss=agent

Option 4

Phones refuse to spell long words, so you need to know them yourself anyway

The tree, 14 words

The words, one row each (CoNLL-U)

#	word	lemma	UPOS	features	head	relation
1	Phones	phone	NOUN	Number=Plur	2 refuse	nsubj
2	refuse	refuse	VERB	Mood=Ind Number=Plur Person=3 Tense=Pres VerbForm=Fin	root	root
3	to	to	PART	_	4 spell	mark
4	spell	spell	VERB	VerbForm=Inf	2 refuse	xcomp
5	long	long	ADJ	Degree=Pos	6 words	amod
6	words	word	NOUN	Number=Plur	4 spell	obj
7	,	,	PUNCT	_	10 need	punct
8	so	so	ADV	_	10 need	advmod
9	you	you	PRON	Case=Nom Person=2 PronType=Prs	10 need	nsubj
10	need	need	VERB	Mood=Ind Number=Sing Person=2 Tense=Pres VerbForm=Fin	2 refuse	conj
11	to	to	PART	_	12 know	mark
12	know	know	VERB	VerbForm=Inf	10 need	xcomp
13	them	they	PRON	Case=Acc Number=Plur Person=3 PronType=Prs	12 know	obj
14	yourself	yourself	PRON	Case=Acc Number=Sing Person=2 PronType=Prs Reflex=Yes	12 know	obj
15	anyway	anyway	ADV	_	12 know	advmod

#	verb	tense, mood	who	what, whom	to whom	where	when	other	roles by
1	refuse	present	Phones						vn reject-77.2 «NP V S_ING»: agent=Agent clause=Theme
2	not spell	to-infinitive	Phones not said here	long words					vn pronounce-29.3.1 «NP V NP ADVP»: agent=Agent word=Theme
3	need	present	you						vn want-32.1-1-1 «NP V NP S_INF»: agent=Pivot clause=Theme
4	know not said to happen	to-infinitive	you not said here	words = word				anyway property	tree rules

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/english/15-how-to-learn-spellings-that-stick/t2/