Practical Grammar 12: Difference between revisions
No edit summary |
No edit summary |
||
| (26 intermediate revisions by the same user not shown) | |||
| Line 2: | Line 2: | ||
<font size="3"> | <font size="3"> | ||
== | == Term Paper Project == | ||
In your final class project, your task is to write a grammar for '''the English auxiliary system'''. | In your final class project, your task is to write a grammar for '''the English auxiliary system'''. | ||
| Line 9: | Line 9: | ||
1. Go to <span class="newwin">https://xlfg.labri.fr/</span> and log in.<br> | 1. Go to <span class="newwin">https://xlfg.labri.fr/</span> and log in.<br> | ||
2. Open the grammar '' | 2. Open the grammar ''Term Paper Project''.<br> | ||
3. Parse the whole test suite.<br> | 3. Parse the whole test suite.<br> | ||
4. At this point, none of the grammatical sentences parse.<br> | 4. At this point, none of the grammatical sentences parse.<br> | ||
5. Your task is to make the grammar accept all the grammatical sentences in the test suite while excluding the ungrammatical ones.<br> | 5. Your task is to make the grammar accept all the grammatical sentences in the test suite while excluding the ungrammatical ones. '''Of course, the grammar should yield these results for the right reason.'''<br> | ||
6. To achieve this, you will need to add phrase structure rules and lexical entries. | 6. To achieve this, you will need to add phrase structure rules and lexical entries. | ||
Below, you see the representations of a sentence with one or more auxiliaries: | |||
[[File:Fred-will-have-bought-olives-cs.JPG| 500px]] | |||
[[File:Fred-will-have-bought-olives-fs.JPG| 1000px]] | |||
== Goals == | == Goals == | ||
| Line 45: | Line 50: | ||
(7) Fred had bought olives. | (7) Fred had bought olives. | ||
[[File:Fred-had-bought-olives-asJPG.JPG| | [[File:Fred-had-bought-olives-asJPG.JPG| 500px]] | ||
(8) Fred was buying olives. | (8) Fred was buying olives. | ||
[[File:Fred-was-buying-olives-as.JPG| | [[File:Fred-was-buying-olives-as.JPG| 500px]] | ||
== Hints == | == Hints == | ||
1. Add only those | 1. Add only those rules and lexical entries which are necessary for the test sentences.<br> | ||
2. Give finite auxiliaries the cagegory I and non-finite ones the category V<br> | 2. Give finite auxiliaries the cagegory I and non-finite ones the category V.<br> | ||
3. Make use of the following features and their values:<br> | 3. Make use of the following features and their values:<br> | ||
a. TNS: PRES, PAST, | a. TNS: PRES, PAST, FUT | ||
b. VFORM: FIN, INF, PRESP, PASTP | b. VFORM: FIN, INF, PRESP, PASTP | ||
4. Assume that the VP following each auxiliary bears the grammatical function XCOMP.<br> | 4. Assume that the VP following each auxiliary bears the grammatical function XCOMP.<br> | ||
5. Every IP/VP has at most a single auxiliary | 5. Every IP/VP has at most a single auxiliary daughter.<br> | ||
6. As long as you get a well formed f-structure, ignore the "Extended Coherence" message! | 6. As long as you get a well formed f-structure, ignore the "Extended Coherence" message! | ||
<br> | <br> | ||
<br> | <br> | ||
<font face="Arial, Helvetica, sans-serif"> | |||
<font size="2"> | |||
<div align="center"> | |||
[[Practical_Grammar |'''Main page''']] [[Practical_Grammar_2|'''Week 2''']] [[Practical_Grammar_3|'''Week 3''']] [[Practical_Grammar_4|'''Week 4''']] [[Practical_Grammar_5|'''Week 5''']] [[Practical_Grammar_6|'''Week 6''']] [[Practical_Grammar_7_new|'''Week 7''']] [[Practical_Grammar_8|'''Week 8''']] [[Practical_Grammar_9|'''Week 9''']] | |||
</div> | |||
<div align="center"> | <div align="center"> | ||
[[Practical_Grammar_10|'''Week 10''']] [[Practical_Grammar_11|'''Week 11''']] '''Term Paper Project''' | |||
</div> | </div> | ||
Latest revision as of 12:32, 6 February 2023
Term Paper Project
In your final class project, your task is to write a grammar for the English auxiliary system.
Exercise 12.1
1. Go to https://xlfg.labri.fr/ and log in.
2. Open the grammar Term Paper Project.
3. Parse the whole test suite.
4. At this point, none of the grammatical sentences parse.
5. Your task is to make the grammar accept all the grammatical sentences in the test suite while excluding the ungrammatical ones. Of course, the grammar should yield these results for the right reason.
6. To achieve this, you will need to add phrase structure rules and lexical entries.
Below, you see the representations of a sentence with one or more auxiliaries:
Goals
In what follows, you will find the argument structure representations of some of the test sentences that your grammar should produce.
(1) Fred will buy olives.
(2) Fred has bought olives.
(3) Fred is buying olives.
(4) Fred will have bought olives.
(5) Fred has been buying olives.
(6) Fred will have been buying olives.
(7) Fred had bought olives.
(8) Fred was buying olives.
Hints
1. Add only those rules and lexical entries which are necessary for the test sentences.
2. Give finite auxiliaries the cagegory I and non-finite ones the category V.
3. Make use of the following features and their values:
a. TNS: PRES, PAST, FUT b. VFORM: FIN, INF, PRESP, PASTP
4. Assume that the VP following each auxiliary bears the grammatical function XCOMP.
5. Every IP/VP has at most a single auxiliary daughter.
6. As long as you get a well formed f-structure, ignore the "Extended Coherence" message!