SoSe22: Constraint-based Semantics 2 - Revision history

Manfred: /* INTERNAL-CONTENT (INC, INCONT, IN-CONT) */

2022-06-07T08:31:38Z

INTERNAL-CONTENT (INC, INCONT, IN-CONT)

← Older revision		Revision as of 08:31, 7 June 2022
Line 36:		Line 36:

	* For ``ordinary´´verbs: their predicate (i.e. their DR value) applied to their semantic arguments		* For ``ordinary´´verbs: their predicate (i.e. their DR value) applied to their semantic arguments
	* For modal auxliaries, such as ''can'', ''may'', ''must'', ...: Their INCONT value is identical with that of their VP complement.<br />In this class, we specify this directly in the lexical entry of the auxiliary.		* For modal auxliaries, such as ''can'', ''may'', ''must'', ...: <br />Their DR value is the modal operator '''Can''', '''May''', '''Must''', etc. Their INCONT value is identical with that of their VP complement.<br />In this class, we specify this directly in the lexical entry of the auxiliary.
	* For intensional verbs such as ''search'', ''look (for)'', ''be missing'', we assume a lexical decomposition into a lower predicate and a higher predicate. The DR value is identical with the higher predicate, and the INCONT with the lower predicate, applied to its arguments.<br />For example ''look (for)'' is decomposed into '''try'''(''x'',...'''find'''(''x'',''y'')...). The DR value is the predicate '''try''', the INCONT value is the expression '''find'''(''x'',''y'').		* For intensional verbs such as ''search'', ''look (for)'', ''be missing'', we assume a lexical decomposition into a lower predicate and a higher predicate. The DR value is identical with the higher predicate, and the INCONT with the lower predicate, applied to its arguments.<br />For example ''look (for)'' is decomposed into '''try'''(''x'',...'''find'''(''x'',''y'')...). The DR value is the predicate '''try''', the INCONT value is the expression '''find'''(''x'',''y'').

Manfred: /* INTERNAL-CONTENT (INC, INCONT, IN-CONT) */

2022-06-07T08:30:14Z

INTERNAL-CONTENT (INC, INCONT, IN-CONT)

← Older revision		Revision as of 08:30, 7 June 2022
Line 37:		Line 37:
	* For ``ordinary´´verbs: their predicate (i.e. their DR value) applied to their semantic arguments		* For ``ordinary´´verbs: their predicate (i.e. their DR value) applied to their semantic arguments
	* For modal auxliaries, such as ''can'', ''may'', ''must'', ...: Their INCONT value is identical with that of their VP complement.<br />In this class, we specify this directly in the lexical entry of the auxiliary.		* For modal auxliaries, such as ''can'', ''may'', ''must'', ...: Their INCONT value is identical with that of their VP complement.<br />In this class, we specify this directly in the lexical entry of the auxiliary.
	* For intensional verbs such as ''search'', ''look (for)'', ''be missing'', we assume a lexical decomposition into a lower predicate and a higher predicate. The DR value is identical with the higher predicate, and the INCONT with the lower predicate, applied to its arguments.<br />For example ''look (for)'' is decomposed into '''try'''(''x'',...'''find'''(''x'',''y'')...)		* For intensional verbs such as ''search'', ''look (for)'', ''be missing'', we assume a lexical decomposition into a lower predicate and a higher predicate. The DR value is identical with the higher predicate, and the INCONT with the lower predicate, applied to its arguments.<br />For example ''look (for)'' is decomposed into '''try'''(''x'',...'''find'''(''x'',''y'')...). The DR value is the predicate '''try''', the INCONT value is the expression '''find'''(''x'',''y'').

	* For determiners: the quantified formula consisting of the logical determiner contributed by the word, binding the determiner's DR value		* For determiners: the quantified formula consisting of the logical determiner contributed by the word, binding the determiner's DR value

Manfred: /* INTERNAL-CONTENT (INC, INCONT, IN-CONT) */

2022-06-07T08:29:31Z

INTERNAL-CONTENT (INC, INCONT, IN-CONT)

← Older revision		Revision as of 08:29, 7 June 2022
Line 36:		Line 36:

	* For ``ordinary´´verbs: their predicate (i.e. their DR value) applied to their semantic arguments		* For ``ordinary´´verbs: their predicate (i.e. their DR value) applied to their semantic arguments
			* For modal auxliaries, such as ''can'', ''may'', ''must'', ...: Their INCONT value is identical with that of their VP complement.<br />In this class, we specify this directly in the lexical entry of the auxiliary.
			* For intensional verbs such as ''search'', ''look (for)'', ''be missing'', we assume a lexical decomposition into a lower predicate and a higher predicate. The DR value is identical with the higher predicate, and the INCONT with the lower predicate, applied to its arguments.<br />For example ''look (for)'' is decomposed into '''try'''(''x'',...'''find'''(''x'',''y'')...)

	* For determiners: the quantified formula consisting of the logical determiner contributed by the word, binding the determiner's DR value		* For determiners: the quantified formula consisting of the logical determiner contributed by the word, binding the determiner's DR value

Manfred: /* Content Principle */

2022-05-31T09:22:12Z

Content Principle

← Older revision		Revision as of 09:22, 31 May 2022
Line 52:		Line 52:

	In any headed phrase,<br>		In any headed phrase,<br>
	the DR value of the mother and the head daughter are identical.		the DR value of the mother and the head daughter are identical.

			(Note: This differs from the textbook version, as we only have the feature DR and no feature MAIN in this class.)

	=== LRS Projection Principle ===		=== LRS Projection Principle ===

Manfred: /* Conventions for the LRS-specific features */

2022-05-31T09:21:09Z

Conventions for the LRS-specific features

@@ Line 5: / Line 5: @@
 === DR: Discourse referent ===
 === EXTERNAL-CONTENT (EXC, EXCONT, EX-CONT) ===
 === INTERNAL-CONTENT (INC, INCONT, IN-CONT) ===
 === PARTS ===
 == LRS Principles ==

Manfred: /* Principles assumed in the course */

2022-05-31T09:10:55Z

Principles assumed in the course

@@ Line 1: / Line 1: @@
-= Principles assumed in the course =
+= LRS as assumed in the course =
 For a list of ``official LRS principles´´see the appendix of the textbook: https://www.lexical-resource-semantics.de/wiki/index.php/Appendix_LRS_Principles
 === LRS Projection Principle ===
@@ Line 23: / Line 44: @@
 # In every phrase, the EXTERNAL-CONTENT value of a non head daughter is an element of its PARTS list.
 # In every utterance, every subexpression of the EXTERNAL-CONTENT value of the utterance is an element of its PARTS list, and every element of the utterance's PARTS list is a subexpression of its EXTERNAL-CONTENT value.
 = Meeting 02: Introduction =

Manfred: /* Principles assumed in the course */

2022-05-31T09:07:20Z

Principles assumed in the course

← Older revision		Revision as of 09:07, 31 May 2022
Line 18:		Line 18:
	# If the nonhead is a determiner with an INCONT of the form Qx(φ:ψ), then the INCONT of the head is a component of φ and the head and the nonhead have identical EXCONT values.		# If the nonhead is a determiner with an INCONT of the form Qx(φ:ψ), then the INCONT of the head is a component of φ and the head and the nonhead have identical EXCONT values.
	# For each nonhead that is a quantified NP with an EXCONT value of the form Qx(φ:ψ), the INCONT of the head is a component of ψ.		# For each nonhead that is a quantified NP with an EXCONT value of the form Qx(φ:ψ), the INCONT of the head is a component of ψ.

			=== External Content Principle ===

			# In every phrase, the EXTERNAL-CONTENT value of a non head daughter is an element of its PARTS list.
			# In every utterance, every subexpression of the EXTERNAL-CONTENT value of the utterance is an element of its PARTS list, and every element of the utterance's PARTS list is a subexpression of its EXTERNAL-CONTENT value.

	=== General principle ===		=== General principle ===

Manfred: /* Principles assumed in the course */

2022-05-31T09:06:09Z

Principles assumed in the course

← Older revision		Revision as of 09:06, 31 May 2022
Line 3:		Line 3:
	For a list of ``official LRS principles´´see the appendix of the textbook: https://www.lexical-resource-semantics.de/wiki/index.php/Appendix_LRS_Principles		For a list of ``official LRS principles´´see the appendix of the textbook: https://www.lexical-resource-semantics.de/wiki/index.php/Appendix_LRS_Principles

			=== LRS Projection Principle ===

			(final version going back to Penn and Richter (2004)):

			In every headed phrase,
			# The EXTERNAL-CONTENT value of the mother and the head daughter are identical.
			# The INTERNAL-CONTENT value of the mother and the head daughter are identical.
			# The PARTS list of a phrase is the concatenation of the PARTS lists of its daughters.


			=== Semantics Principle ===

			In every headed phrase,
			# If the nonhead is a determiner with an INCONT of the form Qx(φ:ψ), then the INCONT of the head is a component of φ and the head and the nonhead have identical EXCONT values.
			# For each nonhead that is a quantified NP with an EXCONT value of the form Qx(φ:ψ), the INCONT of the head is a component of ψ.

			=== General principle ===
			In every headed phrase, the EXCONT of the nonhead daughter is an element of its PARTS list.

	= Meeting 02: Introduction =		= Meeting 02: Introduction =

Manfred at 09:04, 31 May 2022

2022-05-31T09:04:13Z

← Older revision		Revision as of 09:04, 31 May 2022
Line 1:		Line 1:
			= Principles assumed in the course =

			For a list of ``official LRS principles´´see the appendix of the textbook: https://www.lexical-resource-semantics.de/wiki/index.php/Appendix_LRS_Principles



	= Meeting 02: Introduction =		= Meeting 02: Introduction =

Manfred: /* Meeting 02: Introduction */

2022-04-19T01:08:20Z

Meeting 02: Introduction

← Older revision		Revision as of 01:08, 19 April 2022
Line 2:		Line 2:

	'''Note: The meeting takes place asynchronically!'''		'''Note: The meeting takes place asynchronically!'''

			Please watch the video for this meeting:

			<embedvideo service="youtube" dimensions="400">https://youtu.be/BC3b_tNAOMA</embedvideo>


	== Definition of a model ==		== Definition of a model ==