CSC 2517 -- Discrete Mathematical Models of Sentence Structure

Winter 2020


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 1-3, HA 410
Back to the index

Presented Readings

 

Who
When
What
Where
Gerald Penn 8 January Super-CF formalisms and Supertagging
Gerald Penn 15 January Proof Nets Electronic Notes in Theoretical Computer Science 53, 2004,  pp. 274-295
Kayman Brusse 29 January
Improved CCG Parsing with Semi-supervised Supertagging
Simple Robust Grammar Induction with Combinatory Categorial Grammars
TACL  2,  pp. 327-338, 2014
Proc. 26th AAAI,  pp. 1643-1649, 2012
Aditya Bhargava 29 January
- 5 February
Supertagging With LSTMs
Semi-Supervised Sequence Modeling with Cross-View Training
Aditya's draft
Proc. ACL,  pp. 232-237,  2016
Proc. EMNLP,  pp. 1914-1925, 2018
in progress
Yibin Zhao 12 February
Weakly-supervised Grammar-informed Bayesian CCG Parser Learning
An HDP Model for Inducing Combinatory Categorial Grammars
Proc. 29th AAAI,  pp. 2246-2252, 2015
TACL  1,  pp. 75-88, 2013
Xiaohui Zeng 26 February Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoders Proc. NAACL,  pp. 1129-1141,  2019
Devin Singh 4 March Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks Proc. ICLR,  2019
Ming Wan 4 March
Unsupervised Dependency Parsing without Training
Corpus-Based Induction of Syntactic Structure: Models of Dependency and Constituency
JNLE 18(2),  pp. 187-203,  2012.
Proc. ACL,  pp. 478-485,  2004
Gerald Penn 11 March Neural Language Modeling by Jointly Learning Syntax and Lexicon ICLR 2018
Jinman Zhao 1 April
A Critical Analysis of Biased Parsers in Unsupervised Parsing
An Imitation Learning Approach to Unsupervised Parsing
arXiv:1909.09428 [cs.CL]
Proc. ACL,  pp. 3485-3492,  2019

Additional Readings for the Lectures


Title Author Publication Details
Speech and Language Processing D. Jurafsky & J. Martin 3rd ed., draft
Probabilistic Automata M. O. Rabin Information and Control 6(3), pp. 230-245.
A Context-free Language which is not Acceptable by a Probabilistic Automaton M. Nasu and N. Honda Information and Control 18(3), pp. 233-236.

Back to the index


Tentative course outline

Back to the index

Calendar of important course-related events


Date Event
Wed, 8 January First meeting
Mon, 20 January Last day to add course
Wed, 19 February Reading week: no meeting
Mon, 24 February Last day to drop course
Wed, 1 April Last meeting
Fri, 1 May 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, 25 March, 2020
This web-page was adapted from the web-page for another course, created by Vassos Hadzilacos.