| 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 [2016/05/03 18:45]
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: |
| | * 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. |
| |
| Contact | pecina at ufal.mff.cuni.cz | | * active participation in the discussions, which is conditioned by reading the papers in advance and attending the meetings, |
| Meetings | Wednesdays 9:30 | | * 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. |
| |
| ===== Program ===== | 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 17:20, S6 | |
| | ^ 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 2016 === |
| ===== 2005/2006 ===== | ^ date | **speaker** | **paper** | |
| | ^ Feb 22 | Martin Popel | W Ammar, G Mulcaire, M Ballesteros, C Dyer, NA Smith: [[http://arxiv.org/pdf/1602.01595.pdf|One Parser, Many Languages]] 2016 | |
| ^ 19.10. | Kiril Ribarov | Non-projective Dependency Parsing using Spanning Tree Algorithms | | | ^ Feb 29 | | cont. | |
| ^ 26.10. | Petr Podvesky | K. Crammer and Y. Singer. 2003. Ultraconservative on-line algorithms for multiclass problems. JMLR. | | | ^ Mar 7 | Jindřich Libovický | Marc'Aurelio Ranzato, Sumit Chopra, Michael Auli, Wojciech Zaremba: [[http://arxiv.org/abs/1511.06732|Sequence Level Training with Recurrent Neural Networks]], 2016 | |
| ^ 2.11. | Jiri Havelka | Leonidas Georgiadis: Arborescence optimization problems solvable by Edmonds’ algorithm. || | ^ Mar 14 | Jindřich Libovický | cont. | |
| ^ 9.11. | Bara Hladka | || | ^ May 21 | Jindřich Helcl | Debanjan Ghosh, Weiwei Guo, Smaranda Muresan: [[http://www.aclweb.org/anthology/D15-1116|Sarcastic or Not: Word Embeddings to Predict the Literal or Sarcastic Meaning of Words]] EMNLP 2015 | |
| ^ 16.11. | Pavel Pecina | Bob Moor: Discriminative Framework for Bilingual Word Alignment, EMNLP, Vancouver, 2005 || | ^ Mar 28 | no RG | Easter Monday | |
| ^ 23.11. | Ota Smrz | Context-Based Morphological Disambiguation with Random Fields Noah A. Smith, David A. Smith, Roy W. Tromble || | ^ Apr 4 | Milan Straka | Stack LSTM http://arxiv.org/abs/1505.08075 | |
| ^ 30.11. | Vaclav Novak | Jason Eisner and Damianos Karakos: Bootstrapping Without the Boot HLT/EMNLP, Vancouver, 2005 || | ^ Apr 11 | Milan Straka | [[http://arxiv.org/abs/1603.06270|Multi-Task Cross-Lingual Sequence Tagging from Scratch]] and eventually also [[http://arxiv.org/abs/1603.01360|Network Architectures for NER]] | |
| ^ 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. || | ^ Apr 18 | Rudolf Rosa | Rico Sennrich, Barry Haddow, Alexandra Birch: [[http://arxiv.org/pdf/1508.07909v3.pdf|Neural Machine Translation of Rare Words with Subword Units]], 2016| |
| ^ 14.12. | Dan Zeman | D. Zeman, Z. Zabokrstky: Improving Parsing Accuracy by Combining Diverse Dependecy Parsers, IWPT, Vancouver, 2005 || | ^ Apr 25 | Tom Kocmi | Jiwei Li, Michel Galley, Chris Brockett, Jianfeng Gao, Bill Dolan: [[https://arxiv.org/abs/1603.06155|A Persona-Based Neural Conversation Model]], 2016| |
| ^ 4.1. | Ondřej Bojar | Franz Och (2005): Tutorial at MT summit || | ^ May 2 | Pasky | Petr Baudiš, Jan Šedivý: [[http://pasky.or.cz/sps.pdf|Sentence Pair Scoring: Towards Unified Framework for Text Comprehension]], 2016 | |
| ^ 11.1. | Jiří Semecký | Marine Carpuat and Dekai Wu: Word Sense Disambiguation vs. Statistical Machine Translation. || | ^ May 9 | Martin Popel | Zhaopeng Tu, Zhengdong Lu, Yang Liu, Xiaohua Liu, Hang Li: [[https://arxiv.org/pdf/1601.04811v3.pdf|Modeling Coverage for Neural Machine Translation]], 2016 | |
| ^ 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. || | ^ May 16 | Shadi Saleh | | |
| ^ 8.3. | Zdeněk Žabokrtský | Sylvain Kahan: The Meaning-Text Theory || | ^ May 23 | special last RG | travelling to LREC | |
| ^ 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 | | |
| |
