CSC 2517 -- Discrete Mathematical Models of Sentence Structure

Fall 2009

Index of this document

Contact information

Instructor: Gerald Penn
Office: PT 396B (St. George campus)
Tel: 978-7390
Email: gpenn@cs.utoronto.ca
Back to the index

Meeting times

Lectures: W 2-4, BA 4010
Back to the index

Presented Readings

 

Who
When
What
Where
Gerald Penn 9 September Control Strategies for Parsing with Freer Word-Order Languages part of this appears in an ACL-06 workshop paper
Julian Brooke 23 September
Towards Abstract Categorial Grammars, P. de Groote
Tree-Adjoining Grammars as Abstract Categorial Grammars, P. de Groote
ACL-01
TAG+6, 2002
Eric Corlett 30 September
Mildly Context-Sensitive Dependency Languages, M.  Kuhlmann and M. Moehl
The String-Generative Capacity of Regular Dependency Languages, M. Kuhlmann and M. Moehl
ACL-07
FG-07
Jackie Cheung 7 October
Non-projective Dependency Parsing using Spanning Tree Algorithms, R. McDonald, F. Pereira, K. Ribarov and J. Hajic
Graph-based [Dependency] Parsing, S. Kuebler, R. McDonald, and J. Nivre
HLT/EMNLP 2005
Chapter 4 of Dependency Parsing, Synthesis Lectures
Serguei Zinine 21 October A Processing Model for Free Word-Order Languages, O. Rambow and A. Joshi Perspectives on Sentence Processing, C. Clifton, Jr., L. Frazier and K. Rayner, eds., Lawrence Erlbaum & Assoc., 1994, pp. 267-301.
Timothy Fowler 28 October
Building Deep DependencyStructures with a Wide-Coverage CCG Parser, S. Clark, J. Hockenmaier and M. Steedman
Dependency Trees and the Strong Generative Capacity of CCG, A. Koller and M. Kuhlmann
ACL-02
EACL-09
Julian Brooke 11 November Complexity of Scrambling: A New Twist to the Competence-Performance Distinction, A. Joshi, T. Becker and O. Rambow TAG+3, 1994
Eric Corlett 18 November Non-local Scrambling: the Equivalence of TAG and CCG Revisited, J. Hockenmaier and P. Young TAG+9, 2008
Jackie Cheung 18 November Creating a CCGbank and a Wide-coverage CCG Lexicon for German, J. Hockenmaier ACL-06
Timothy Fowler ?? Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees, S. Pogodalla TAG+7, 2004
Julian Brooke ??
Radical Non-configurationality without Shuffle Operators, E. M. Bender
Domains in Warlpiri, C. Donohue and I. A. Sag
HPSG-08
HPSG-99
Serguei Zinine ?? Arabic Treebank Annotation, S. Zinine in progress
Gerald Penn ??
On the Complexity of Higher-Order Matching in the Linear Lambda-Calculus, S. Salvati and P. de Groote
Higher-Order Matching in the Linear Lambda-Calculus with Pairing, P. de Groote and S. Salvati
Proc. RTA-03, R. Nieuwenhuis ed., LNCS 2706, Springer, 2003
Proc. CSL-04, J. Marcinkowski and A. Tarlecki eds., LNCS 3210, Springer, 2004 

Additional Readings for the Lectures


Title Author Publication Details
Foundational Issues in Natural Language Processing P. Sells, S. Shieber and T. Wasow MIT Press, 1991
The Equivalence of Four Extensions of Context-Free Grammars K. Vijay-Shanker and D. J. Weir Mathematical Systems Theory 27, pp. 511-546, 1994

Back to the index

Tentative course outline

Back to the index

Calendar of important course-related events
Date Event
Wed, 9 September First lecture
Wed, 7 October Last day to add course
Wed, 4 November Last day to drop course
Wed, 2 December Last lecture
Fri, 18 December Term papers/projects due

Back to the index

Evaluation

Your final mark will be determined by a term paper/project, and a presentation of a paper in class.  The relative weights of these components towards the final mark are shown in the table below:
 

Class presentation 20%
Term paper/project 80%

Back to the index

Announcements

In this space, you will find announcements related to the course. Please check this space at least weekly. Back to the index

Gerald Penn, 18 November, 2009
This web-page was adapted from the web-page for another course, created by Vassos Hadzilacos.