This is an old revision of the document!
Reading Group
Official name of this course is NPFL095 Modern Methods in Computational Linguistics. It is a continuation of informal Reading Group (RG) meetings. Requirements for getting credits:
- presenting one paper,
- Select a term (write your name to the schedule below) before February 24.
- If no paper is assigned to the term, suggest me 2–3 papers you would like to present (with pdf links, and your preferences) before March 3. Ideally, make a group of 2–4 students presenting papers on a common topic (starting from basics to more advance papers).
- Prepare your presentation and 3–5 quiz questions. At least 3 of the questions should ask for a specific answer, e.g. “write an equation for…”, “given training set X=([dog,N],[cat,Y]), what is the number…” (Not “what do you think about…”). The first question should be quite easy to answer for those who have read the whole paper. The last question may be a tricky one. Send me the questions two weeks before your presentation. We may discuss the paper and refine the questions.
- One week before the presentation, write the questions to a dedicated wiki page here. Send a reminder (questions and a link to the pdf of the paper) to rg@ufal.mff.cuni.cz by Monday 15:45.
- active participation in the discussions, which is conditioned by reading the papers in advance and attending the meetings,
- sending your answers to me and the presenter by Saturday 23:59 (so the presenter can go through all answers before the presentation and focus more on problematic parts).
- In case of more than three missed meetings or deadlines, additional work (e.g. reports or answers to tricky questions) will be required.
All questions, reports and presented papers must be in English. The presentations are in English by default, but if all present people agree it may be in Czech.
Contact | popel@ufal.mff.cuni.cz |
---|---|
Mailing list | rg@ufal.mff.cuni.cz |
Meetings | Mondays 15:45, room S1 |
Past meetings | courses:rg:past |
Inspiration | courses:rg:wishlist |
Spring&Summer 2014
date | speaker | paper |
---|---|---|
Feb 24 | startup meeting, John Langford: All Models of Learning have Flaws, 2007 | |
Mar 3 | Vincent | RExtractor – A Framework for Extracting Relations from Texts, 2014 |
Mar 10 | Rudolf | MLFix |
Mar 17 | Petra | paraphrases |
Mar 23 | Martin | Treex |
Mar 31 | Ivana | Sun, Grishman, Sekine: Semi-supervised Relation Extraction with Large-scale Word Clustering, ACL 2011 |
Apr 7 | Loganathan | McDonald, Petrov, Hall: Multi-source Transfer of Delexicalized Dependency Parsers, EMNLP 2011 |
Apr 14 | Vincent | Keith Hall: k-best Spanning Tree Parsing, ACL 2007 |
| no RG | Easter |
May 5 | Rudolf | Goldberg, Elhadad: An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing, NAACL 2010 |
May 12 | Petra | |
May 19 | Ivana | last RG |