| Both sides previous revision
Previous revision
Next revision
|
Previous revision
Next revision
Both sides next revision
|
courses:rg [2011/10/24 18:43]
popel |
courses:rg [2015/10/05 18:11]
popel |
| ~~NOTOC~~ | ~~NOTOC~~ |
| ===== 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. For inspiration see the [[courses:rg:wishlist|wishlist]]. Requirements for getting credits: presenting one paper, writing a report about another presented paper, and active participation in the discussions (which is conditioned by reading the papers in advance and attending the meetings). | |
| |
| ^ Contact | popel at ufal.mff.cuni.cz | | ===== Reading Group ===== |
| ^ Mailing list | rg at ufal.mff.cuni.cz | | 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: |
| ^ List Archive | [[http://ufal.mff.cuni.cz/mailman/listinfo/rg]] | | * presenting one paper, |
| ^ Meetings | Mondays 15:10, room S1 | | * Select a term (write your name to the schedule below) before October 13. |
| ^ Past meetings| [[courses::rg::past|courses::rg::past]] | | * 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. |
| |
| === Autumn&Winter 2011/2012 === | * active participation in the discussions, which is conditioned by reading the papers in advance and attending the meetings, |
| ^ date | **speaker** | **paper** | | * 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). |
| ^ Oct 3 | | startup meeting| | * In case of more than three missed meetings or deadlines, additional work (e.g. reports or answers to tricky questions) will be required. |
| ^ Oct 10 | | discussion about [[http://ufal.mff.cuni.cz/download/monday_joakim_nivre_woods.pdf|Joakim Nivre's talk]] If you haven't heard about transition-based parsing (MALT parser) read e.g. [[http://stp.ling.uu.se/~nivre/docs/GoTAL3.pdf|one of Nivre's presentations]] | | |
| ^ Oct 17 | Martin Popel | Stephen Tratz, Eduard Hovy: [[http://www.aclweb.org/anthology-new/D/D11/D11-1116.pdf|A Fast, Accurate, Non-Projective, Semantically-Enriched Parser | 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. |
| ]] | | |
| ^ Oct 24 | Martin Majliš | Valentin Spitkovsky, Hiyan Alshawi, Daniel Jurafsky:[[http://www.aclweb.org/anthology/N/N10/N10-1116.pdf|From Baby Steps to Leapfrog: How “Less is More” in Unsupervised Dependency Parsing]], [[courses:rg:From-Baby Steps-to-Leapfrog-How-Less-is-More-in-Unsupervised-Dependency-Parsing:majlis|MM notes]]| | ^ Contact | popel@ufal.mff.cuni.cz | |
| ^ Oct 31 | Michal Novák | Dipanjan Das, Slav Petrov: [[http://www.petrovi.de/data/acl11.pdf|Unsupervised Part-of-Speech Tagging with Bilingual Graph-Based Projections]] | | ^ Mailing list | rg@ufal.mff.cuni.cz | |
| ^ Nov 7 | Oldřich Krůza | ? | | ^ Meetings | Mondays 16:00, S1 | |
| ^ Nov 14 | Marie Konárová | ? | | ^ Past meetings| [[courses:rg:past|courses:rg:past]] | |
| ^ Nov 21 | Petr Jankovský | ? | | ^ Inspiration | [[courses:rg:wishlist|courses:rg:wishlist]] | |
| ^ Nov 28 | Jindřich Libovický | Philipp Koehn, Jean Senellart (2010): [[http://homepages.inf.ed.ac.uk/pkoehn/publications/tm-smt-amta2010.pdf|Convergence of Translation Memory and Statistical Machine Translation]] | | ^ Other reading groups | [[https://github.com/ufal/rg/wiki|Machine Learning RG]] | |
| ^ Dec 5 | Tomáš Kraut | ? | | |
| ^ Dec 12 | Petra Galuščáková | ? | | === Autumn&Winter 2015/2016 === |
| ^ Dec 19 | ? | ? | | ^ date | **speaker** | **paper** | |
| ^ Jan 9 | ? | ? | | ^ 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]] | |
| | ^ 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: Probabilistic Models for Segmenting and Labeling Sequence Data]], 2001. [[courses:rg:2014:crf|Questions]] | |
| | ^ Nov 30 | | | |
| | ^ Dec 7 | | | |
| | ^ Dec 14 | | | |
