|
Schedule
Note: The literature for each talk is a collection of material that
is relevant for this talk; many of the listed papers overlap with each
other and present the same material in different ways, and thus the
literature list probably looks scarier than it really is. We will
discuss with each student individually how to approach their
papers.
| Date |
Speaker |
Topic |
Literature |
Advisor |
| Mon 9-11 |
ST |
Montague Grammar |
|
|
| Mon 11-13 |
AK |
Classical approaches to scope ambiguity |
|
|
| Tue 9-11 |
Benjamin Roth |
Hole Semantics |
Bos (1996).
Predicate Logic Unplugged
Blackburn, Bos (2005).
Representation and Inference for Natural Language: A First Course in Computational Semantics
|
ST |
| Tue 11-13 |
Michael Wirth |
Minimal Recursion Semantics |
Copestake, Flickinger, Pollard, Sag.
Minimal Recursion Semantics: an Introduction
Copestake, Lascarides, Flickinger (2001).
An Algebra for Semantic Construction in Constraint-based Grammars
|
ST |
| Tue 14-16 |
ST |
Dominance graphs |
Koller (2005).
Constraint-Based And Graph-Based Resolution of Ambiguities in Natural Language
Egg, Niehren, Koller (2001).
The Constraint Language for Lambda Structures
Althaus, Duchier, Koller, Mehlhorn, Niehren, Thiel (2003)
An Efficient Graph Algorithm for Dominance Constraints
Koller, Mehlhorn, Niehren (2000)
A Polynomial-Time Fragment of Dominance Constraints
|
|
| Wed 9-11 |
Tobias Schild |
Solving dominance graphs |
Althaus, Duchier, Koller, Mehlhorn, Niehren, Thiel (2003).
An Efficient Graph Algorithm for Dominance Constraints
Bodirsky, Duchier, Miele, Niehren (2004).
A New Algorithm for Normal Dominance Constraints
Koller, Thater (2005).
The Evolution of Dominance Constraint Solvers
|
AK |
| Wed 11-13 |
Christian Schulz |
Translation of HS and MRS into DG |
Koller, Niehren, Thater (2003).
Hole semantics as dominance constraints
Niehren, Thater (2003).
Minimal Recursion Semantics as Dominance Constraints
Fuchss, Koller, Niehren, Thater (2004).
Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis
|
ST |
| Wed 14-16 |
AK |
Extensions of dominance graphs (CLLS) |
Egg, Koller, Niehren (2001)
The Constraint Language for Lambda Structures
Koller, Niehren, Striegnitz (2000).
Relaxing Underspecified Semantic Representations for Reinterpretation
Striegnitz (2000)
On Modelling Meaning Shitfs by Relaxing Underspecified Semantic Representations
|
AK |
| Thu 9-11 |
Thomas Eigner |
Direct deduction on USRs |
van Deemter (1995). Towards a logic of Ambiguous Expressions.
In
Semantic Ambiguity and Underspecification
Monz, de Rijke (1998)
A Tableaux Calculus for Ambiguous Quantification
|
AK |
| Thu 11-13 |
Steven Poggel |
Redundancy elimination |
Vestre (1991).
An algorithm for generating non-redundant quantifier scopings
Ebert (2003).
On the Expressive Completeness of Underspecified Representations
Koller, Thater (2006).
Towards a redundancy elimination algorithm for underspecified descriptions
|
|
|
