[ Skip to the content ]

Institute of Formal and Applied Linguistics Wiki

[ Back to the navigation ]


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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Last revision Both sides next revision
courses:rg [2015/10/05 18:11]
courses:rg [2017/10/12 15:44]
Line 2: Line 2:
 ===== 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:  +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. 
-  * presenting one paper, + 
-    * Select a term (write your name to the schedule below) before October 13. +Since 2016, the wiki is moved to https://github.com/ufal/NPFL095/wiki and the mailing list to [[https://groups.google.com/forum/#!forum/npfl095|npfl095@googlegroups.com]]. 
-    * 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)+See also [[courses:rg:past|an overview of past meetings]], [[courses:rg:wishlist|an outdated wishlist]] and [[https://github.com/ufal/rg/wiki|Machine Learning RG (active in 2014)]].
-    * 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 paperto 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 16:00, 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]] | 
-=== Autumn&Winter 2015/2016 === 
-^ date   | **speaker**  | **paper** | 
-^ Oct  5 |              | startup meeting |  
-^ Oct 12 | Lukáš Žilka, Milan Straka | Programming hackaton, based on [[http://web.stanford.edu/class/cs168/|The Modern Algorithmic Toolbox]], read in advance lecture [[http://web.stanford.edu/class/cs168/l/l1.pdf|1]] and [[http://web.stanford.edu/class/cs168/l/l2.pdf|2]] | 
-^ Oct 19 | Martin Popel | Mark Johnson: [[http://cs.brown.edu/courses/cs195-5/fall2009/docs/lecture_10-27.pdf|A brief introduction to kernel classifiers]], 2009. You can also read [[http://ciml.info/dl/v0_9/ciml-v0_9-ch09.pdf|a chapter from ciml.info]]. [[courses:rg:2014:kernels|Questions]] | 
-^ Oct 26 |              | 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. | 
-^ Nov 2  |              | 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]] | 
-Probabilistic Models for Segmenting and Labeling Sequence Data]], 2001. [[courses:rg:2014:crf|Questions]] | 
-^ Nov  9 | —            | no RG, dean's day | 
-^ Nov 16 |              |  | 
-^ Nov 23 |              | John Lafferty, Andrew McCallum, Fernando Pereira: [[http://www.cs.utah.edu/~piyush/teaching/crf.pdf|Conditional Random Fields:  
-^ Nov 30 |              |  | 
-^ Dec  7 |              |  | 
-^ Dec 14 |              |  | 

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