Differences

This shows you the differences between two versions of the page.

--- courses:rg [2014/09/26 12:37]
popel
+++ courses:rg [2016/10/05 01:47]
ufal
@@ Line 1: / Line 1: @@
 ~~NOTOC~~
-===== Reading Group =====
+===== Reading Group =====
 Official name of this course is [[https://is.cuni.cz/studium/predmety/index.php?do=predmet&kod=NPFL095|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.
+    * Select a term (write your name to the schedule below) before October 13.
-    * If no paper is assigned to the term, suggest [[mailto:popel@ufal.mff.cuni.cz|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).
+    * If no paper is assigned to the term, suggest [[mailto:popel@ufal.mff.cuni.cz|me]] 2--3 papers you would like to present (with pdf links, and your preferences) before October 20. 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.
@@ Line 16: / Line 17: @@
 ^ Contact      | popel@ufal.mff.cuni.cz |
 ^ Mailing list | rg@ufal.mff.cuni.cz     |
-^ Meetings     | Mondays 16:00, room S1 |
+^ Meetings     | Tuesdays 15:40, S1 |
 ^ Past meetings| [[courses:rg:past|courses:rg:past]] |
 ^ Inspiration  | [[courses:rg:wishlist|courses:rg:wishlist]] |
 ^ Other reading groups  | [[https://github.com/ufal/rg/wiki|Machine Learning RG]] |
-=== Spring&Summer 2014 ===
-^ date   | **speaker** | **paper** |
+=== Autumn&Winter 2016/2017 ===
-^ Feb 24 |             | startup meeting, John Langford: [[http://hunch.net/?p=224|All Models of Learning have Flaws]], 2007 |
+^ date   | **speaker**               | **paper** |
-^ Mar  3 | Vincent     | RExtractor – A Framework for Extracting Relations from Texts, 2014 |
+^ Oct  4 |   | startup meeting |
-^ Mar 10 | Rudolf      | MLFix |
+^ Oct 11 | Martin Popel | Kevin Knight, Beáta Megyesi and Christiane Schaefer: [[http://www.isi.edu/natural-language/people/copiale-11.pdf|The Copiale Cipher]], BUCC 2011 |
-^ Mar 17 | Petra       | paraphrases |
+^ Oct 18 | Daniela Bodanská  | Kishore Papineni, Salim Roukos, Todd Ward, and Wei-Jing Zhu: [[http://aclweb.org/anthology-new/P/P02/P02-1040.pdf|BLEU: a Method for Automatic Evaluation of Machine Translation]], ACL 2002. [[courses:rg:2014:bleu|Questions]] |
-^ Mar 23 | Martin      | [[http://ufal.mff.cuni.cz/~popel/treex/sheet.pdf|Treex]]  |
+^ Oct 25 |  | Michael Collins: [[http://ucrel.lancs.ac.uk/acl/W/W02/W02-1001.pdf|Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms]], EMNLP 2002. [[courses:rg:2014:perceptron|Questions]]|
-^ Mar 31 | Ivana       | Sun, Grishman, Sekine: [[http://aclweb.org/anthology/P/P11/P11-1053.pdf|Semi-supervised Relation Extraction with Large-scale Word Clustering]], ACL 2011 |
+^ Nov 1  |  | Andrew McCallum, Dayne Freitag, Fernando Pereira: [[http://www.ai.mit.edu/courses/6.891-nlp/READINGS/maxent.pdf|Maximum Entropy Markov Models for Information Extraction and Segmentation]], Conference on Machine Learning 2000, [[http://courses.ischool.berkeley.edu/i290-dm/s11/SECURE/gidofalvi.pdf|slides]] [[courses:rg:2014:memm|Question]]|
-^ Apr  7 | Loganathan  | McDonald, Petrov, Hall: [[http://www.aclweb.org/anthology/D11-1006.pdf|Multi-source Transfer of Delexicalized Dependency Parsers]], EMNLP 2011 |
+^ <del>Nov 8</del> | --- | no RG (Dean's day)|
-^ Apr 14 | Vincent     | Keith Hall: [[http://aclweb.org/anthology-new/P/P07/P07-1050.pdf|k-best Spanning Tree Parsing]], ACL 2007 |
+^ Nov 15 |  | John Lafferty, Andrew McCallum, Fernando Pereira: [[http://www.cs.utah.edu/~piyush/teaching/crf.pdf|Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data]], 2001. [[courses:rg:2014:crf|Questions]] |
-^ <del>Apr 21</del> | no RG       | Easter |
+^ Nov 22 |  | Tomas Mikolov, Kai Chen, Greg Corrado, Jeffrey Dean: [[http://arxiv.org/pdf/1301.3781.pdf|Efficient Estimation of Word Representations in Vector Space]], ICLR 2013 |
-^ Apr 28 | Rudolf      | Goldberg, Elhadad: [[http://www.aclweb.org/anthology/N10-1115.pdf|An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing]], NAACL 2010 |
+^ Nov 29  |  | |
-^ May  5 | Petra  | Goldberg, Orwant: [[http://www.aclweb.org/anthology/S13-1035.pdf|A Dataset of Syntactic-Ngrams over Time from a Very Large Corpus of English Books]], 2013 |
+^ Dec 6  |  | |
-^ May 12 | Ivana  | short paper for LAW VIII |
+^ Dec 13 |  | |
-^ May 19 | Ruda, Petra | dry-run presentations for LREC |

[ Back to the navigation ] [ Back to the content ]

Institute of Formal and Applied Linguistics Wiki

Differences