Semantics 1, SoSe 2016 (Sailer): Difference between revisions

From Lexical Resource Semantics
Jump to navigation Jump to search
 
(23 intermediate revisions by the same user not shown)
Line 1: Line 1:
= Assignment sheets =
* First assignments sheet:
:: Download the file: [[File:SoSe16-assignment-logic.pdf]]
:: [[Semantics 1, SoSe 2016 (Sailer): Assignment Sheet 1|Example solution]]
* Second assignment sheet: [[File:SoSe16-assignment-lrs.pdf]]
= Mock exam =
Mock exam: [[File:SoSe16-mockexam.pdf]]
Follow the link to an [[Semantics 1, SoSe 2016 (Sailer): Mock Exam|online version of the mock exam and example solutions]].
= Additional material for week 10 =
A syntactic fragment:
https://www.english-linguistics.de/syn1/30/
The login information can be found on the slides.
== Basic combinatorics: Canonical examples ==
(the following exercises are adapted from the textbook material to [[https://www.lexical-resource-semantics.de/wiki/index.php/Exercise-ch5#Basic_combinatorics:_Canonical_examples  Chapter 5]].
<quiz display=simple>
{Sentence: ''Pat snored.''<br />Logical form: '''snore'''('''pat''')<br />
Which parts of the logical form are contributed by which word?
|type="[]"}
|'''pat''' &brvbar; | '''snore''' &brvbar;| '''snore'''('''pat''')
+-- ''Pat''
-++ ''snored''
{Sentence: ''Pat likes Chris.''<br />Logical form: '''like'''('''pat''','''chris''')<br />
Which parts of the logical form are contributed by which word?
|type="[]"}
|'''pat''' &brvbar;| '''chris''' &brvbar;| '''like''' &brvbar;| '''like'''('''pat''','''chris''')
+--- ''Pat''
--++ ''likes''
-+-- ''Chris''
</quiz>
== Possible EX-CONT values ==
Given the following PARTS lists, what are possible EX-CONT values (if we do not assume other restrictions)
1. PARTS < '''pat''', '''alex''','''like''', '''like'''(__,__) >
<div class="toccolours mw-collapsible mw-collapsed" style="width:800px">
Check your answer
<div class="mw-collapsible-content">
'''like'''('''pat''','''alex''')<br>
'''like'''('''alex''','''pat''')
</div></div>
2. PARTS < '''alex''','''snore''', '''snore'''(__), &not;(__) >
<div class="toccolours mw-collapsible mw-collapsed" style="width:800px">
Check your answer
<div class="mw-collapsible-content">
&not;('''snore'''('''alex'''))
</div></div>
3. PARTS < '''alex''','''alex''','''snore''' >
<div class="toccolours mw-collapsible mw-collapsed" style="width:800px">
Check your answer
<div class="mw-collapsible-content">
There is no possible EX-CONT value because the three elements on the PARTS list cannot be combined.
</div></div>
3. PARTS < '''alex''','''alex''','''snore''', '''snore'''(__) >
<div class="toccolours mw-collapsible mw-collapsed" style="width:800px">
Check your answer
<div class="mw-collapsible-content">
'''snore'''('''alex''')
</div></div>
4. PARTS < '''alex''','''alex''','''snore''', '''snore'''(__), __ &and; __ >
<div class="toccolours mw-collapsible mw-collapsed" style="width:800px">
Check your answer
<div class="mw-collapsible-content">
'''snore'''('''alex''') &and; '''snore'''('''alex''')
</div></div>


<!--
= Additional material for week 9 =
= Additional material for week 9 =


Line 97: Line 186:
SUBJ < { - _3 } >{{TenSpaces}} &nbsp;&nbsp; SUBJ < { [1] _3 } > {{TenSpaces}} &nbsp;&nbsp;&nbsp; SUBJ < { - _3 } > {{TenSpaces}} &nbsp;&nbsp; SUBJ < { - _3 } >
SUBJ < { - _3 } >{{TenSpaces}} &nbsp;&nbsp; SUBJ < { [1] _3 } > {{TenSpaces}} &nbsp;&nbsp;&nbsp; SUBJ < { - _3 } > {{TenSpaces}} &nbsp;&nbsp; SUBJ < { - _3 } >
SPR &nbsp; < { - _3 } >{{TenSpaces}} &nbsp;&nbsp; SPR < { - _3 } > {{TenSpaces}} &nbsp;&nbsp;&nbsp;&nbsp;  SPR < { - _3 } > {{TenSpaces}}&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; SPR < { [3] _3 } >
SPR &nbsp; < { - _3 } >{{TenSpaces}} &nbsp;&nbsp; SPR < { - _3 } > {{TenSpaces}} &nbsp;&nbsp;&nbsp;&nbsp;  SPR < { - _3 } > {{TenSpaces}}&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; SPR < { [3] _3 } >
COMPS < { - _3 } >{{TenSpaces}}COMPS < { - _3 } > {{TenSpaces}}COMPS < { [5] _3 } > {{TenSpaces}} COMPS < { - _3 } >
COMPS < { - _3 } >{{TenSpaces}}COMPS < { [5] _3 } > {{TenSpaces}}COMPS < { - _3 } > {{TenSpaces}} COMPS < { - _3 } >




Line 142: Line 231:


{{FeedbackExercises}}
{{FeedbackExercises}}
-->


= Additional material for week 8 =
= Additional material for week 8 =


== Basic syntactic notions ==
Additional material for week 8 can be found [[Semantics 1, SoSe 2016 (Sailer): Week 8|here]].
 
The following exercises are copied from the wiki page for [[Exercise-ch3|exercises to chapter 3]].
 
<quiz display=simple>
{Determine the part of speech of the words in the sentences.<br />Use the following part of speech labels: A, Adv, Det, N, P, V
|type="{}"}
 
a. Alex/{ N _3 } talked/{ V _3 } to/{ P _3 } my/{ Det _3 } best/{ A _3 } friend/{ N _3 }.<br />
b. You/{ N _3 } might/{ V _3 } suspect/{ V _3 } that/Comp Pat/{ N _3 } is/{ V _3 } a/{ Det _3 } genius/{ N _3}.<br />
c. The/{ Det _3} title/{ N _3 } of/{ P _3 } a/{ Det _3 } book/{ N _3 } largely/{ Adv _3 } determines/{ V _3 } whether/Comp it/{ N _3 } will/{ V _3 } be/{ V _3 } successful/{ A _3 } or/{ Conj _5 } a/{ Det _3 } flop/{ N _3 }.
 
</quiz>
 
{{FeedbackExercises}}
 
 
 
<quiz display=simple>
{Determine the syntactic categories of the following groups of words in the sentences.<br />Use the following labels: AdvP, AP, NP, PP, S, VP. <!-- Write "-" if the group of words does not form a constitutent. --><br />
''Example:'' ['''S''': Pat ['''VP''': will ['''VP''': wait ['''PP''': for Alex]]]]
|type="{}"}
 
a. [{ S _2}: Alex [{ VP _3 }: talked [{ PP _3 }: to [{ NP _3 }: my best friend]]]]
b. [{ S _2 }: [{ NP _3 }: The president] [{ VP _3}: announced ['''CP''': that [{ S _2 }: there [{ VP _3 }: will [{ VP _3 }: be [{ NP _3 }: no further taxes]]]]]]].
 
</quiz>
 
{{FeedbackExercises}}
 
 
== Six steps in a syntactic analysis ==
 
There is an old video on the 6 steps in syntactic analysis. The final analysis of the example sentence looks slightly different from what we assume in our class.
 
<embedvideo service="youtube" dimensions="400">https://www.youtube.com/watch?v=EDbaCAVgHUI</embedvideo>
 
The tree we would draw in this class looks like this:
 
[[File:PatWillTalk.jpeg|500px]]
 
What are the differences?


= Additional material for weeks 6 and 7=
= Additional material for weeks 6 and 7=


== Quantifiers ==
Additional material for weeks 6 and 7 can be found [[Semantics 1, SoSe 2016 (Sailer): Weeks 6 and 7|here]].
 
Video introducing determiners into our logical language. (The video is based on the scenario of ''Romeo and Juliett''.)
 
<embedvideo service="youtube" dimensions="400">http://youtu.be/5PRL23XcaFY</embedvideo>
<!-- old video with less optimal audio: http://youtu.be/b0iLejXP9C8 -->
 
(copied from [[Wiki-ch2#Logical_determiners.2Fquantifiers]])
 
== Exercises ==
 
After having watched the video, work on the following tasks.
 
'''Task 1''' Identify the determiners in the following sentence.
 
(a) Juliet talked to some stranger at the party.
 
(b) Every Capulet is an enemy to some Montague.
 
(c) Many people in Verona are not happy about the Capulet-Montague feud.
 
<div class="toccolours mw-collapsible mw-collapsed" style="width:800px">
Check your solutions here:
<div class="mw-collapsible-content">
(a) ''some''
 
(b) ''every'', ''some''
 
(c) ''many''</div>
</div>
 
 
 
'''Task 2''' Identify the formula that corresponds to the translation of the sentence.
 
<quiz display=simple>
 
{''Some Montague who was at the party fell in love with Juliet.''
|type="()"}
- &exist;''x'' ('''montague<sub>1</sub>'''(''x'') : ('''at-party<sub>1</sub>'''(''x'') &and; '''fall-in-love-with<sub>2</sub>'''(''x'','''juliet''')))
|| In restricted quantifier notation, the "complete" semantic representation of the noun phrase (NP) appears in the restrictor (-> square brackets).
+ &exist;''x'' (('''montague<sub>1</sub>'''(''x'') &and; '''at-party<sub>1</sub>'''(''x'')) : '''fall-in-love-with<sub>2</sub>'''(''x'','''juliet'''))
- &exist;''x'' ('''montague<sub>1</sub>'''(''x'') : ('''at-party<sub>1</sub>'''(''x'') &and; '''fall-in-love-with<sub>2</sub>'''(''x'','''juliet'''))
|| In restricted quantifier notation, the semantic representation of the noun phrase (NP) appears in the restrictor.
- &exist;''x'' (('''montague<sub>1</sub>'''(''x'') &and; '''fall-in-love-with<sub>2</sub>'''(''x'','''juliet''')) : '''at-party<sub>1</sub>'''(''x''))
|| In restricted quantifier notation, the semantic representation of the noun phrase (NP) appears in the restrictor, that of the VP in the scope.
 
</quiz>
 
'''Task 3''' The sentence: ''Some Tybalt loved some Montague.'' is translated into the formula<br>&exist; y ('''montague<sub>1</sub>'''(''y'') : '''love<sub>2</sub>'''('''tybalt''',''y'').
 
<quiz display=simple>
{Mark all the cells in the table that stand for a true statement.
|type="[]"}
| '''montague<sub>1</sub>'''(''y'') <span style="color:white">zwisch</span>| '''love<sub>2</sub>'''('''tybalt''',''y'')<span style="color:white">zwisch</span>
+- ''Romeo''
+- ''Mercutio''
-- ''Juliet''
-- ''Tybalt''
-- ''Laurence''
-- ''Paris''
</quiz>
 
Given this table, is the overall formula true or false? (Give a reason for your answer.)
<div class="toccolours mw-collapsible mw-collapsed" style="width:800px">
Check your solutions here:
<div class="mw-collapsible-content">
The formula is false, because there is no individual in our model for which both the restrictor and the scope are true.
</div>
</div>
 
 
 
'''Task 4''' Variable assignment function<br>
Start with the following variable assigment function ''g'':
''g(u) = Romeo, g(v) = Juliet, g(w) = Romeo, g(x) = Laurence, g(y) = Mercutio, g(z) = Juliet''
 
Provide the changed variable assignment function ''g''[''v/Paris''].
 
<div class="toccolours mw-collapsible mw-collapsed" style="width:800px">
Check your solutions here:
<div class="mw-collapsible-content">
''g''[''v/Paris'']''(u)'' = ''g(u)'' = ''Romeo''<br>''g''[''v/Paris'']''(v)'' = ''Paris''<br>''g''[''v/Paris'']''(w)'' = ''g(w)'' = ''Romeo''<br>''g''[''v/Paris'']''(x)'' = ''g(x)'' = ''Laurence''<br>''g''[''v/Paris'']''(y)'' = ''g(y)'' = ''Mercutio''<br>''g''[''v/Paris'']''(z)'' = ''g(z)'' = ''Juliet''
</div>
</div>


= Additional material for week 5=
= Additional material for week 5=


Additional material for week 5 can be found [[Semantics 1 (Sailer), Week 5|here]].
Additional material for week 5 can be found [[Semantics 1 (Sailer): Week 5|here]].
 
== Formulae with more than one connective ==
 
The video shows how the truth value of a more complex formula can be computed. The example contains two connectives:
 
'''kill(malcom,lady-macbeth) &or; &not;thane(macbeth)'''
 
The video shows two different methods: top down and bottom up.
 
<embedvideo service="youtube" dimensions="400">http://youtu.be/C1rjU104R54</embedvideo>
 
== Truth tables ==
 
(The following exercises have been copied here from the page on [[Exercise_Truth_Tables|exercises for truth tables]].)
 
<quiz display="simple">
{Click on the boxes for which the truth value would be ''true''.
|type="[]"}
| '''p''' | '''q''' | <span style="color:white">zwisch</span>('''p ''' &and; '''q''')<span style="color:white">zwisch</span> | <span style="color:white">zwisch</span> &not;('''p ''' &and; '''q''')<span style="color:white">zwisch</span>|<span style="color:white">zwisch</span>('''q''' &sup; &not; ('''p &and; q'''))<span style="color:white">zwisch</span>
+++-- (both '''p''' and '''q''' are true)
+--++ ('''p''' is true, but not '''q''')
-+-++ ('''p''' is false, but '''q''' is true)
---++ (both '''p''' and '''q''' are false)
</quiz>
 
<quiz display="simple">
{Click on the boxes for which the truth value would be ''true''.
|type="[]"}
| '''p''' | '''q''' | '''r''' |<span style="color:white">zwisch</span>&not; r<span style="color:white">zwisch</span> | <span style="color:white">zwisch</span> ('''p ''' &or; '''q''')<span style="color:white">zwisch</span>|<span style="color:white">zwisch</span>(('''p &or; q''') &sup; &not;r)<span style="color:white">zwisch</span>
+++-+- ('''p''', '''q''', and '''r''' are true)
++-+++ ('''p''' and '''q''' are true, '''r''' is false)
+-+-+- ('''p''' and '''r''' are true, '''q''' is false)
+--+++ ('''p''' is true, '''q''' and '''r''' are false)
-++-+- ('''p''' is false, '''q''' and '''r''' are true)
-+-+-+ ('''p''' and '''r''' are false, '''q''' is true)
--+--+ ('''p''' and '''q''' are false, '''r''' is true)
---+-+ ('''p''', '''q''', and '''r''' are false)
</quiz>
 
== Truth tables for complex formulae ==
 
Truth tables are also useful to compute the truth value of complex formulae.
This is shown in the following podcast, created by [[User:Lisa|Lisa Günthner]].
 
<embedvideo service="youtube" dimensions="400">http://www.youtube.com/watch?v=ZWdltj5Mqdc</embedvideo>
 
== Preparation for week 5 ==
* Read Levine et al (in prep.), Chapter 2, section 2.
* Using your model from last week,
:* Give 1 formula with ⊃.
:* Give 1 formule with 2 different connectives (both distinct from ⊃)
* Provide the step-by-step computation of the truth of your 2 
formulae.


= Additional material for week 4=
= Additional material for week 4=

Latest revision as of 22:24, 4 July 2016

Assignment sheets

  • First assignments sheet:
Download the file: File:SoSe16-assignment-logic.pdf
Example solution

Mock exam

Mock exam: File:SoSe16-mockexam.pdf

Follow the link to an online version of the mock exam and example solutions.

Additional material for week 10

A syntactic fragment:

https://www.english-linguistics.de/syn1/30/

The login information can be found on the slides.


Basic combinatorics: Canonical examples

(the following exercises are adapted from the textbook material to [Chapter 5].

1 Sentence: Pat snored.
Logical form: snore(pat)
Which parts of the logical form are contributed by which word?

pat ¦ snore ¦ snore(pat)
Pat
snored

2 Sentence: Pat likes Chris.
Logical form: like(pat,chris)
Which parts of the logical form are contributed by which word?

pat ¦ chris ¦ like ¦ like(pat,chris)
Pat
likes
Chris


Possible EX-CONT values

Given the following PARTS lists, what are possible EX-CONT values (if we do not assume other restrictions)

1. PARTS < pat, alex,like, like(__,__) >

Check your answer

like(pat,alex)
like(alex,pat)


2. PARTS < alex,snore, snore(__), ¬(__) >

Check your answer

¬(snore(alex))


3. PARTS < alex,alex,snore >

Check your answer

There is no possible EX-CONT value because the three elements on the PARTS list cannot be combined.


3. PARTS < alex,alex,snore, snore(__) >

Check your answer

snore(alex)

4. PARTS < alex,alex,snore, snore(__), __ ∧ __ >

Check your answer

snore(alex) ∧ snore(alex)

Additional material for week 9

A syntactic fragment:

https://www.english-linguistics.de/syn1/30/

The login information can be found on the slides.

Lexical entries as Attribute-Value Matrix

The following exercises are copied from the wiki page for exercises to chapter 3.

Provide the required information on the lexical properties of the underlined words in the following sentences.
Note:

  • Put a minus ("-") if a slot should not receive any filling
  • Use det, noun, prep or verb for the HEAD values.

1 Alex read a book yesterday.

PHON


SYNSEM | LOCAL | CAT | HEAD


SYNSEM | LOCAL | CAT | VAL | SUBJ <

>
SYNSEM | LOCAL | CAT | VAL | SPR <

>
SYNSEM | LOCAL | CAT | VAL | COMPS <

>

2 Alex talked to a friend.

PHON


SYNSEM | LOCAL | CAT | HEAD


SYNSEM | LOCAL | CAT | VAL | SUBJ <

>
SYNSEM | LOCAL | CAT | VAL | SPR <

>
SYNSEM | LOCAL | CAT | VAL | COMPS <

>

3 Pat liked this new documentary on African wild life.

PHON


SYNSEM | LOCAL | CAT | HEAD


SYNSEM | LOCAL | CAT | VAL | SUBJ <

>
SYNSEM | LOCAL | CAT | VAL | SPR <

>
SYNSEM | LOCAL | CAT | VAL | COMPS <

>

4 Alex talked to a friend.

PHON


SYNSEM | LOCAL | CAT | HEAD


SYNSEM | LOCAL | CAT | VAL | SUBJ <

>
SYNSEM | LOCAL | CAT | VAL | SPR <

>
SYNSEM | LOCAL | CAT | VAL | COMPS <

>


Feel free to send feedback on this exercise to Manfred Sailer.

Analysis of simple sentences

The following exercises are copied from the wiki page for exercises to chapter 3.

Indicate the missing values of the VAL and the HEAD features using tags ([1], ...) or "-" for empty lists.

Alex snored.
syntactic structure: Tree-AlexSnored.jpeg
Words:                                                                                                   Phrase:
Alex                                                             snored                                    S: Alex snored.
HEAD [4]noun                                  HEAD [5]verb                                    HEAD

SUBJ <

>                                  SUBJ <

>                                    SUBJ <

>
SPR   <

>                                  SPR <

>                                     SPR <

>
COMPS <

>                              COMPS <

>                               COMPS <

>


Indicate the missing values of the VAL and the HEAD features using tags ([1], ...) or "-" for empty lists.

Fido chased a mouse.
syntactic structure: Tree-FidoChasedAMouse.jpeg
Words:
Fido                                                             chased                                    a                                                              mouse
HEAD [8]noun                                  HEAD [9]verb                                    HEAD [10] det                                   HEAD [11] noun
SUBJ <

>                                  SUBJ <

>                                    SUBJ <

>                                   SUBJ <

>
SPR   <

>                                  SPR <

>                                     SPR <

>                                     SPR <

>
COMPS <

>                              COMPS <

>                               COMPS <

>                                COMPS <

>
Phrases:                                                                                                  
NP: a mouse                               VP: chased a mouse                                S: Fido chased a mouse.
HEAD

                                     HEAD

                                       HEAD

                              
SUBJ <

>                                  SUBJ <

>                                    SUBJ <

>
SPR   <

>                                  SPR <

>                                     SPR <

>
COMPS <

>                              COMPS <

>                               COMPS <

>


Indicate the missing values of the VAL and the HEAD features using tags ([1], ...) or "-" for empty lists. Don't use spaces.

Pat gave Alex a ride.
syntactic structure: Tree-PatGaveAlexARide.jpeg
Words:
Pat                                                             gave                                         Alex                                                              a                                      ride
HEAD [9]noun                                  HEAD [10]verb                                   HEAD [11] noun                                HEAD [12] det                                HEAD [13] noun
SUBJ <

>                                  SUBJ <

>                                    SUBJ <

>                                   SUBJ <

>                                 SUBJ <

>
SPR   <

>                                  SPR <

>                                     SPR <

>                                     SPR <

>                                   SPR <

>
COMPS <

>                              COMPS <

>                        COMPS <

>                                COMPS <

>                            COMPS <

>
Phrases:                                                                                                  
NP: a ride                               VP: gave Alex a ride                                S: Pat gave Alex a ride.
HEAD

                                     HEAD

                                       HEAD

                              
SUBJ <

>                                  SUBJ <

>                                    SUBJ <

>
SPR   <

>                                  SPR <

>                                     SPR <

>
COMPS <

>                              COMPS <

>                               COMPS <

>


Feel free to send feedback on this exercise to Manfred Sailer.

Additional material for week 8

Additional material for week 8 can be found here.

Additional material for weeks 6 and 7

Additional material for weeks 6 and 7 can be found here.

Additional material for week 5

Additional material for week 5 can be found here.

Additional material for week 4

The material can be found on the page Semantics 1, SoSe 2016 (Sailer): Week 4


Additional material for week 3

The material for week 3 can be accessed here


Retrieved from "http:///wiki/index.php?title=Semantics_1,_SoSe_2016_(Sailer)&oldid=6870"