| Both sides previous revision
Previous revision
Next revision
|
Previous revision
Next revision
Both sides next revision
|
courses:rg [2013/10/14 23:18]
ufal PJ's paper added |
courses:rg [2015/10/15 10:26]
popel |
| ~~NOTOC~~ | ~~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: | 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, | * presenting one paper, |
| * Select a term (write your name to the schedule below) before October 14. | * 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 October 21. 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. | * 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:50. | * 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, | * active participation in the discussions, which is conditioned by reading the papers in advance and attending the meetings, |
| ^ Contact | popel@ufal.mff.cuni.cz | | ^ Contact | popel@ufal.mff.cuni.cz | |
| ^ Mailing list | rg@ufal.mff.cuni.cz | | ^ Mailing list | rg@ufal.mff.cuni.cz | |
| ^ List Archive | [[http://ufal.mff.cuni.cz/mailman/listinfo/rg]] | | ^ Meetings | Mondays 16:00, S1 | |
| ^ Meetings | Mondays 15:50, room S1 | | |
| ^ Past meetings| [[courses:rg:past|courses:rg:past]] | | ^ Past meetings| [[courses:rg:past|courses:rg:past]] | |
| ^ Inspiration | [[courses:rg:wishlist|courses:rg:wishlist]] | | ^ Inspiration | [[courses:rg:wishlist|courses:rg:wishlist]] | |
| | ^ Other reading groups | [[https://github.com/ufal/rg/wiki|Machine Learning RG]] | |
| |
| === Autumn&Winter 2013/2014 === | === Autumn&Winter 2015/2016 (preliminary plan) === |
| ^ date | **speaker** | **paper** | | ^ date | **speaker** | **paper** | |
| ^ Oct 7 | | startup meeting | | ^ Oct 5 | | startup meeting | |
| ^ Oct 14 | Martin Popel | Joseph P. Simmons, Leif D. Nelson, Uri Simonsohn: [[http://people.psych.cornell.edu/~jec7/pcd%20pubs/simmonsetal11.pdf|False-Positive Psychology: Undisclosed Flexibility in Data Collection and Analysis Allows Presenting Anything as Significant]], Psychological Science, 2011. [[courses:rg:2013:false-positive-psychology|Questions]]| | ^ 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 21 | Rudolf Rosa | Marie-Catherine de Marneffe, Christopher D. Manning: [[http://www.aclweb.org/anthology/W08-1301.pdf|The Stanford typed dependencies representation]], Coling 2008. [[courses:rg:2013:stanford-dependencies|Questions]] | | ^ Oct 19 or Oct 20 | 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 28 | — | no RG, Independent Czechoslovak State Day | | ^ Oct 26 | Lukáš Žilka, Milan Straka | hands-on tutorial on using some neural network toolkit | |
| ^ Nov 4 | Jan Mašek | Google's Universal Dependency Treebanks (paper will be announced) | | ^ Nov 2 | | 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 11 | Ondřej Fiala | Xuchen Yao, Benjamin Van Durme, Chris Callison-Burch, Peter Clark: [[http://cs.jhu.edu/~xuchen/paper/yao-jacana-wordalign-acl2013.pdf|A Lightweight and High Performance Monolingual Word Aligner]], Proceedings of ACL, 2013. | | ^ Nov 9 | — | no RG, dean's day | |
| ^ Nov 18 | Shadi Saleh |Bhagwani, Sumit and Satapathy, Shrutiranjan and Karnick, Harish:[[http://aclweb.org/anthology/S/S12/S12-1085.pdf| Semantic textual similarity using maximal weighted bipartite graph matching]]| | ^ Nov 16 | | 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 25 | | | | ^ 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]] | |
| ^ Dec 2 | Petr Jankovský | Petrovic, Mathews: [[http://homepages.inf.ed.ac.uk/s0894589/petrovic13unsupervised.pdf | Unsupervised joke generation from big data ]] | | ^ Nov 30 | | | |
| ^ Dec 9 | | | | ^ Dec 7 | | | |
| ^ Dec 16 | | | | ^ Dec 14 | | | |
| ^ Jan 6 | | | | |
