Differences

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

--- courses:rg [2007/04/03 15:12]
pecina
+++ courses:rg [2014/03/28 22:21]
popel
@@ Line 1: / Line 1: @@
 ~~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 February 24.
+    * 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 March 3. 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 15:45, room S1 |
+^ Past meetings| [[courses:rg:past|courses:rg:past]] |
+^ Inspiration  | [[courses:rg:wishlist|courses:rg:wishlist]] |
+=== Spring&Summer 2014 ===
+^ date   | **speaker** | **paper** |
-===== 2005/2006 =====
+^ Feb 24 |             | startup meeting, John Langford: [[http://hunch.net/?p=224|All Models of Learning have Flaws]], 2007 |
+^ Mar  3 | Vincent     | RExtractor – A Framework for Extracting Relations from Texts, 2014 |
-^ 19.10. | Kiril Ribarov | Non-projective Dependency Parsing using Spanning Tree Algorithms | |
+^ Mar 10 | Rudolf      | MLFix |
-^ 26.10. | Petr Podvesky | K. Crammer and Y. Singer. 2003. Ultraconservative on-line algorithms for multiclass problems. JMLR. | |
+^ Mar 17 | Petra       | paraphrases |
-^ 2.11. | Jiri Havelka | Leonidas Georgiadis: Arborescence optimization problems solvable by Edmonds’ algorithm. ||
+^ Mar 23 | Martin      | [[http://ufal.mff.cuni.cz/~popel/treex/sheet.pdf|Treex]]  |
-^ 9.11. | Bara Hladka | ||
+^ Mar 31 | Ivana       | Sun, Grishman, Sekine: [[http://aclweb.org/anthology/P/P11/P11-1053.pdf|Semi-supervised Relation Extraction with Large-scale Word Clustering]], ACL 2011 |
-^ 16.11. | Pavel Pecina | Bob Moor: Discriminative Framework for Bilingual Word Alignment, EMNLP, Vancouver, 2005 ||
+^ Apr  7 | Loganathan  | Multi-source Transfer of Delexicalized Dependency Parsers [[http://dl.acm.org/citation.cfm?id=2145440|pdf]] |
-^ 23.11. | Ota Smrz | Context-Based Morphological Disambiguation with Random Fields Noah A. Smith, David A. Smith, Roy W. Tromble ||
+^ Apr 14 |             | |
-^ 30.11. | Vaclav Novak | Jason Eisner and Damianos Karakos: Bootstrapping Without the Boot HLT/EMNLP, Vancouver, 2005 ||
+^ <del>Apr 21</del> | no RG       | Easter |
-^ 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. ||
+^ May  5 |             | |
-^ 14.12. | Dan Zeman | D. Zeman, Z. Zabokrstky: Improving Parsing Accuracy by Combining Diverse Dependecy Parsers, IWPT, Vancouver, 2005 ||
+^ May 12 |             | |
-^ 4.1. | Ondřej Bojar | Franz Och (2005): Tutorial at MT summit ||
+^ May 19 |             | 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 |

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

Institute of Formal and Applied Linguistics Wiki

Differences