Grammar Writing: Week 10 - Revision history

Gert: /* Homework (due date: Sunday, 8 p.m. on January 7th 2018) */

2018-01-08T11:49:32Z

Homework (due date: Sunday, 8 p.m. on January 7th 2018)

← Older revision		Revision as of 11:49, 8 January 2018
Line 73:		Line 73:
	Navigation:		Navigation:
	<div align="center">		<div align="center">
	[[Grammar_Writing\|'''Main Page''']]   [[Grammar_Writing:_Week_2\| '''Week 2''']]    [[Grammar_Writing:_Week_3\| '''Week 3''']]    [[Grammar_Writing:_Week_4\| '''Week 4''']]    [[Grammar_Writing:_Week_5\| '''Week 5''']]    [[Grammar_Writing:_Week_6\| '''Week 6''']]    [[Grammar_Writing:_Week_7\| '''Week 7''']]   [[Grammar_Writing:_Week_8\| '''Week 8''']]    [[Grammar_Writing:_Week_9\| '''Week 9''']]    '''Week 10'''		[[Grammar_Writing\|'''Main Page''']]   [[Grammar_Writing:_Week_2\| '''Week 2''']]    [[Grammar_Writing:_Week_3\| '''Week 3''']]    [[Grammar_Writing:_Week_4\| '''Week 4''']]    [[Grammar_Writing:_Week_5\| '''Week 5''']]    [[Grammar_Writing:_Week_6\| '''Week 6''']]    [[Grammar_Writing:_Week_7\| '''Week 7''']]   [[Grammar_Writing:_Week_8\| '''Week 8''']]    [[Grammar_Writing:_Week_9\| '''Week 9''']]    '''Week 10'''    [[Grammar_Writing:_Week_11\| '''Week 11''']]

Nikoschenk at 16:27, 2 January 2018

2018-01-02T16:27:49Z

← Older revision		Revision as of 16:27, 2 January 2018
Line 62:		Line 62:

	Your task:		Your task:
	Implement both rules and upload your grammar. This exercise will be graded.		Implement both rules and upload your grammar. This exercise will be graded. You should not attempt to upload other people's zip files (unless you know how to modify the meta data of the original files.. ;-))
	In case you're having trouble... nschenk@em.uni-frankfurt.de		In case you're having trouble... nschenk@em.uni-frankfurt.de

Nikoschenk: /* Homework (due date: Sunday, 8 p.m. on January 7th 2018) */

2017-12-23T23:44:51Z

Homework (due date: Sunday, 8 p.m. on January 7th 2018)

← Older revision		Revision as of 23:44, 23 December 2017
Line 31:		Line 31:
	= Homework (due date: Sunday, 8 p.m. on January 7th 2018) =		= Homework (due date: Sunday, 8 p.m. on January 7th 2018) =

	In this homework assignment, you are supposed to implement a very simple grammar. It should recognize the following ~~three~~ sentences.		In this homework assignment, you are supposed to implement a very simple grammar. It should recognize the following four sentences.


	----		----

			# trump defied bureaucracy.[https://www.nytimes.com/2017/12/23/us/politics/trump-immigration.html?rref=collection%2Ftimestopic%2FTrump%2C%20Donald%20J.]
	# trump likes putin.		# trump likes putin.
	# trump is happy.		# trump is happy.

Nikoschenk: /* Homework (due date: Sunday, 8 p.m. on January 7th 2018) */

2017-12-23T23:32:42Z

Homework (due date: Sunday, 8 p.m. on January 7th 2018)

← Older revision		Revision as of 23:32, 23 December 2017
Line 48:		Line 48:


	VP --> V, COMPS <NP> + NP trump likes putin <br>		VP --> V, COMPS <NP> + NP // trump likes putin <br>
	VP --> V, COMPS <AP> + AP // trump is happy <br>		VP --> V, COMPS <AP> + AP // trump is happy <br>
	VP --> V, COMPS <sentence> + sentence // putin believes trump is happy <br>		VP --> V, COMPS <sentence> + sentence // putin believes trump is happy <br>

	As an illustration, consider the following example.		As an illustration, consider the following example.

Nikoschenk: /* Homework (due date: January 8th 2018) */

2017-12-23T23:31:43Z

Homework (due date: January 8th 2018)

← Older revision		Revision as of 23:31, 23 December 2017
Line 29:		Line 29:
	<br>		<br>

	= Homework (due date: January ~~8th~~ 2018) =		= Homework (due date: Sunday, 8 p.m. on January 7th 2018) =

	In this homework assignment, you are supposed to implement a very simple grammar. It should recognize the following three sentences.		In this homework assignment, you are supposed to implement a very simple grammar. It should recognize the following three sentences.
Line 58:		Line 58:
	[[File:rule1.JPG]]		[[File:rule1.JPG]]

	The rule indicates identity relations between part of speech categories of the first daughter and the mother node, as well as shared information on the item in the complement list, which is structurally identical to the second daughter's SYNTAX information. Ideally, this rule should capture all above cases.		The rule indicates identity relations between part of speech categories of the first daughter and the mother node, as well as shared information on the item in the complement list, which is structurally identical to the second daughter's SYNTAX information. Ideally, this rule should capture all above cases (... in fact, it does -- I've tried it ;-)).

	Your task:		Your task:
	Implement both rules and upload your grammar.		Implement both rules and upload your grammar. This exercise will be graded.
			In case you're having trouble... nschenk@em.uni-frankfurt.de

Nikoschenk: /* Homework (due date: January 8th 2018) */

2017-12-23T23:28:15Z

Homework (due date: January 8th 2018)

← Older revision		Revision as of 23:28, 23 December 2017
Line 33:		Line 33:
	In this homework assignment, you are supposed to implement a very simple grammar. It should recognize the following three sentences.		In this homework assignment, you are supposed to implement a very simple grammar. It should recognize the following three sentences.

	- trump likes putin.
	- trump is happy.		----
	- putin believes trump is happy.
			# trump likes putin.
			# trump is happy.
			# putin believes trump is happy.

			----


Line 43:		Line 48:


	1. VP --> V, COMPS <NP> + NP trump likes putin <br>		VP --> V, COMPS <NP> + NP trump likes putin <br>
			VP --> V, COMPS <AP> + AP // trump is happy <br>
	3. VP --> V, COMPS <AP> + AP // trump is happy <br>		VP --> V, COMPS <sentence> + sentence // putin believes trump is happy <br>
	4. VP --> V, COMPS <sentence> + sentence // putin believes trump is happy <br>

	As an illustration, consider the following example.		As an illustration, consider the following example.
Line 54:		Line 58:
	[[File:rule1.JPG]]		[[File:rule1.JPG]]

			The rule indicates identity relations between part of speech categories of the first daughter and the mother node, as well as shared information on the item in the complement list, which is structurally identical to the second daughter's SYNTAX information. Ideally, this rule should capture all above cases.

			Your task:
			Implement both rules and upload your grammar.

Nikoschenk at 23:23, 23 December 2017

2017-12-23T23:23:48Z

← Older revision		Revision as of 23:23, 23 December 2017
Line 25:		Line 25:

	''A verb phrase can be formed from a V that is looking for a ©1 as its complement and one ©1.''		''A verb phrase can be formed from a V that is looking for a ©1 as its complement and one ©1.''


			<br>

			= Homework (due date: January 8th 2018) =

			In this homework assignment, you are supposed to implement a very simple grammar. It should recognize the following three sentences.

			- trump likes putin.
			- trump is happy.
			- putin believes trump is happy.


			Crucially, however, in this exercise you should use no more than '''two''' rules. Note that, previously, we had a classical sentence rule, plus one for a finite verb and its object, a rule for a finite verb which wants to combine with an adjective, one for sentential complement, etc.

			The classical sentence rule is still needed, but the new rule '''verb_rule''' should now match all of the following patterns (from above):


			1. VP --> V, COMPS <NP> + NP trump likes putin <br>

			3. VP --> V, COMPS <AP> + AP // trump is happy <br>
			4. VP --> V, COMPS <sentence> + sentence // putin believes trump is happy <br>

			As an illustration, consider the following example.



			[[File:rule1.JPG]]

Gert at 13:16, 18 December 2017

2017-12-18T13:16:53Z

← Older revision		Revision as of 13:16, 18 December 2017
Line 25:		Line 25:

	''A verb phrase can be formed from a V that is looking for a ©1 as its complement and one ©1.''		''A verb phrase can be formed from a V that is looking for a ©1 as its complement and one ©1.''


			<br>
			<br>
			Navigation:
			<div align="center">
			[[Grammar_Writing\|'''Main Page''']]   [[Grammar_Writing:_Week_2\| '''Week 2''']]    [[Grammar_Writing:_Week_3\| '''Week 3''']]    [[Grammar_Writing:_Week_4\| '''Week 4''']]    [[Grammar_Writing:_Week_5\| '''Week 5''']]    [[Grammar_Writing:_Week_6\| '''Week 6''']]    [[Grammar_Writing:_Week_7\| '''Week 7''']]   [[Grammar_Writing:_Week_8\| '''Week 8''']]    [[Grammar_Writing:_Week_9\| '''Week 9''']]    '''Week 10'''

Gert at 13:14, 18 December 2017

2017-12-18T13:14:53Z

← Older revision		Revision as of 13:14, 18 December 2017
Line 20:		Line 20:
	With the concept of feature structure identity and the notation above, we can now replace the 5 rules above by the one single rule below:		With the concept of feature structure identity and the notation above, we can now replace the 5 rules above by the one single rule below:

	5. VP --> V, COMPS <©1> + ©1		6. VP --> V, COMPS <©1> + ©1

			The effect of rule 6. can be stated informally as follows:

			''A verb phrase can be formed from a V that is looking for a ©1 as its complement and one ©1.''

Gert at 13:12, 18 December 2017

2017-12-18T13:12:57Z

← Older revision		Revision as of 13:12, 18 December 2017
Line 14:		Line 14:
	5. VP --> V, COMPS <VP> + VP		5. VP --> V, COMPS <VP> + VP

	What our current grammars are missing to express the generalization covered by the five rules above is the concept of '''identity'''. By identity, we mean that one larger feature structure contains a smaller feature structure twice, in different places. Or more simply, that the information at two places in a feature structure must be the same.		What our current grammars are missing to express the generalization covered by the five rules above is the concept of '''feature structure identity'''. By identity, we mean that one larger feature structure contains a smaller feature structure twice, in different places. Or more simply, that the information at two places in a feature structure must be the same.

	In order to signal such identity, we will use so-called boxed numbers, i.e. 1,2,3, ... with a box around it. Unfortunately, in this WIKI, we cannot represent such boxes. Therefore, we will use symbols like the following as identity markers: ©1, ©2, ©3, ...		In order to signal such identity, we will use so-called boxed numbers, i.e. 1,2,3, ... with a box around it. Unfortunately, in this WIKI, we cannot represent such boxes. Therefore, we will use symbols like the following as identity markers: ©1, ©2, ©3, ...

			With the concept of feature structure identity and the notation above, we can now replace the 5 rules above by the one single rule below:

			5. VP --> V, COMPS <©1> + ©1