| Both sides previous revision
Previous revision
Next revision
|
Previous revision
Next revision
Both sides next revision
|
courses:rg [2007/04/03 15:12]
pecina |
courses:rg [2014/11/01 01:46]
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. Requirements for getting credits: |
| | * presenting one paper, |
| | * 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 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. |
| |
| ====== Reading Group ====== | * 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. |
| |
| Contact | pecina at ufal.mff.cuni.cz | | 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. |
| Meetings | Wednesdays 9:30 | | |
| |
| ===== Program ===== | ^ Contact | popel@ufal.mff.cuni.cz | |
| | ^ Mailing list | rg@ufal.mff.cuni.cz | |
| | ^ Meetings | Mondays 16:00, room 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 2014/2015 === |
| | ^ date | **speaker** | **paper** | |
| ===== 2005/2006 ===== | ^ Oct 6 | | startup meeting | |
| | ^ Oct 13 | Jindřich Libovický | Peter F. Brown et all.: [[http://www.aclweb.org/anthology/J92-4003|Class-Based n-gram Models of Natural Language]], Computational Linguistics, 1992. See also [[http://statmt.blogspot.cz/2014/07/understanding-mkcls.html| notes about the mkcls implementation]] | |
| ^ 19.10. | Kiril Ribarov | Non-projective Dependency Parsing using Spanning Tree Algorithms | | | ^ Oct 20 | Tomáš Kraut | 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]]| |
| ^ 26.10. | Petr Podvesky | K. Crammer and Y. Singer. 2003. Ultraconservative on-line algorithms for multiclass problems. JMLR. | | | ^ Oct 27 | Roman Sudarikov | 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]]| |
| ^ 2.11. | Jiri Havelka | Leonidas Georgiadis: Arborescence optimization problems solvable by Edmonds’ algorithm. || | ^ Nov 3 | Dušan Variš | 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]] | |
| ^ 9.11. | Bara Hladka | || | ^ Nov 10 | Duc Tam Hoang | Joseph Turian, Lev Ratinov, Yoshua Bengio: [[http://anthology.aclweb.org//P/P10/P10-1040.pdf|Word representations: A simple and general method for semi-supervised learning]], ACL 2010. | |
| ^ 16.11. | Pavel Pecina | Bob Moor: Discriminative Framework for Bilingual Word Alignment, EMNLP, Vancouver, 2005 || | ^ <del>Nov 17</del> | --- | no RG (Struggle for Freedom and Democracy Day) | |
| ^ 23.11. | Ota Smrz | Context-Based Morphological Disambiguation with Random Fields Noah A. Smith, David A. Smith, Roy W. Tromble || | ^ Nov 24 | Vendula Michlíková | 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 | |
| ^ 30.11. | Vaclav Novak | Jason Eisner and Damianos Karakos: Bootstrapping Without the Boot HLT/EMNLP, Vancouver, 2005 || | ^ Dec 1 | Richard Ejem | Marco Pennacchiotti, Patrick Pantel: [[http://www.aclweb.org/anthology/D09-1025|Entity Extraction via Ensemble Semantics]], ACL 2009. | |
| ^ 7.12. | Pavel Schlesinger | Max-Margin Parsing, B. Taskar, D. Klein, M. Collins, D. Koller and C. Manning. Empirical Methods in Natural Language Processing (EMNLP04), Barcelona, Spain, July 2004. || | ^ Dec 8 | Nguyen Tien Dat| reserved | |
| ^ 14.12. | Dan Zeman | D. Zeman, Z. Zabokrstky: Improving Parsing Accuracy by Combining Diverse Dependecy Parsers, IWPT, Vancouver, 2005 || | ^ Dec 15 |Ahmad Aghaebrahimian |Yoav Goldberg, Michael Elhadad: [[http://aclweb.org/anthology/P/P08/P08-2060.pdf|splitSVM: Fast, Space Efficient, non-Heuristic, Polynomial Kernel Computation for NLP Applications]] ACL 2008| |
| ^ 4.1. | Ondřej Bojar | Franz Och (2005): Tutorial at MT summit || | ^ Jan 5 | | last RG | |
| ^ 11.1. | Jiří Semecký | Marine Carpuat and Dekai Wu: Word Sense Disambiguation vs. Statistical Machine Translation. || | |
| ^ 1.3. | Ondřej Bojar | David Chiang (2005): A Hierarchical Phrase-Based Model for Statistical Machine Translation In proceedings of ACL'05. USA, Michigan, Ann Arbor. || | |
| ^ 8.3. | Zdeněk Žabokrtský | Sylvain Kahan: The Meaning-Text Theory || | |
| ^ 15.3. | Pavel Schlesinger | Noah A. Smith and Jason Eisner (2005): Contrastive Estimation: Training Log-Linear Models on Unlabeled Data. In Proceedings of the Association for Computational Linguistics (ACL 2005), Ann Arbor, Michigan || | |
| ^ 22.3. | Pavel Pecina | Deepak Ravichandran; Patrick Pantel; Eduard Hovy (2005) Randomized Algorithms and NLP: Using Locality Sensitive Hash Functions | |
| for High Speed Noun Clustering, ACL, Ann Arbor || | |
| ^ 29.3. | All | diskuse nad budocnosti RG || | |
| ^ 5.4. | Pavel Stranak | Keh-Jiann Chen, Chi-Ching Luo, Ming-Chung Chang, Feng-Yi Chen, Chao-Jan Chen, Chu-Ren Huang: Sinica Treebank: Design criteria, representational issues and implementation || | |
| ^ 12.4. | Zdenek Zabokrtsky | Sgall, Petr (1995). "Prague School Typology". In: Masayoshi Shibatani and Theodora Bynon (eds), Approaches to Language Typology. Clarendon Press, Oxford United Kingdom. || | |
| ^ 19.4. | Bara Hladka | B. Scholkopf, A.J. Smola: A Short Introduction to Learning Method with Kernels. || | |
| ^ 26.4. | | || | |
| ^ 3.5. | Ota Smrz | || | |
| ^ 10.5. | Bara Hladka | B. Scholkopf, A.J. Smola: A Short Introduction to Learning Method with Kernels. | cont'd | | |
| |
