| Both sides previous revision
Previous revision
Next revision
|
Previous revision
Next revision
Both sides next revision
|
courses:rg [2011/11/28 14:25]
kraut |
courses:rg [2013/12/19 14:52]
popel mailman does not work any more, there is no substitute |
| ~~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. 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). | 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 14. |
| | * 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). |
| | * 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. |
| |
| ^ Contact | popel at ufal.mff.cuni.cz | | * active participation in the discussions, which is conditioned by reading the papers in advance and attending the meetings, |
| ^ Mailing list | rg at ufal.mff.cuni.cz | | * 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). |
| ^ List Archive | [[http://ufal.mff.cuni.cz/mailman/listinfo/rg]] | | * In case of more than three missed meetings or deadlines, additional work (e.g. reports or answers to tricky questions) will be required. |
| ^ Meetings | Mondays 15:10, room S1 | | |
| ^ Past meetings| [[courses::rg::past|courses::rg::past]] | | |
| |
| === Autumn&Winter 2011/2012 === | 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. |
| ^ date | **speaker** | **paper** | | |
| ^ Oct 3 | | startup meeting| | ^ Contact | popel@ufal.mff.cuni.cz | |
| ^ 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]] | | ^ Mailing list | rg@ufal.mff.cuni.cz | |
| ^ 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]], EMNLP 2011, report by Michal Novák | | ^ Meetings | Mondays 15:50, room S1 | |
| ^ 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]], HLT/NAACL 2010, [[courses:rg:From-Baby Steps-to-Leapfrog-How-Less-is-More-in-Unsupervised-Dependency-Parsing:majlis|MM notes]], [[courses:rg:2011-report-baby-steps|report Oldřich Krůza]]| | ^ Past meetings| [[courses:rg:past|courses:rg:past]] | |
| ^ 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]], ACL 2011, [[courses:rg:unsupervised_pos_tagging|report by Marie Konárová]] | | ^ Inspiration | [[courses:rg:wishlist|courses:rg:wishlist]] | |
| ^ Nov 7 | Oldřich Krůza | Oldřich Krůza and Vladislav Kuboň: [[http://commondatastorage.googleapis.com/sixtease/junk/a2clauses.pdf|Automatic Extraction of Clause Relationships from a Treebank]], CICLing 2009, report by Petr Jankovský | | |
| ^ Nov 14 | Marie Konárová | Majid Yazdani and Andrei Popescu-Belis: [[http://www.aclweb.org/anthology-new/W/W11/W11-1105.pdf|Using a Wikipedia-based Semantic Relatedness Measure for Document Clustering]], TextGraphs Workshop 2011, report by [[courses:rg:Using a Wikipedia-based Semantic Relatedness Measure for Document Clustering|Martin Majliš]] | | === Autumn&Winter 2013/2014 === |
| ^ Nov 21 | Petr Jankovský | 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, report by Petra Galuščáková | | ^ date | **speaker** | **paper** | |
| ^ Nov 28 | Jindřich Libovický | Philipp Koehn, Jean Senellart: [[http://homepages.inf.ed.ac.uk/pkoehn/publications/tm-smt-amta2010.pdf|Convergence of Translation Memory and Statistical Machine Translation]], AMTA 2010 | | ^ Oct 7 | | startup meeting | |
| ^ Dec 5 | Tomáš Kraut | Sujith Ravi and Kevin Knight: [[http://aclweb.org/anthology/P/P11/P11-1002.pdf | Deciphering Foreign Language]], ACL 2011 | | ^ 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]]| |
| ^ Dec 12 | Petra Galuščáková | Maja Popović, Aljoscha Burchardt: [[http://www.mt-archive.info/EAMT-2011-Popovic.pdf| From Human to Automatic Error Classification for Machine Translation Output]], EAMT 2011 | | ^ 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 and Answers]] | |
| ^ Dec 19 | ? | ? | | ^ Oct 28 | — | no RG, Independent Czechoslovak State Day | |
| ^ Jan 9 | ? | ? | | ^ Nov 4 | Jan Mašek | Slav Petrov, Dipanjan Das, Ryan McDonald: [[http://www.petrovi.de/data/universal.pdf|A Universal Part-of-Speech Tagset]] and McDonald et al.: [[http://ryanmcd.com/papers/treebanksACL2013.pdf|Universal Multilingual Annotation for Dependency Parsing]] [[courses:rg:2013:ut-and-udt|Questions]]| |
| | ^ 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. [[courses:rg:2013:jacana-align|Questions]]| |
| | ^ 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]] [[courses:rg:2013:semantic-textual-similarity|Questions]]|| |
| | ^ Nov 25 | Matous Machacek | Satanjeev Banerjee , Alon Lavie [[http://www.aclweb.org/anthology/W05-0909|METEOR: An Automatic Metric for MT Evaluation with |
| | Improved Correlation with Human Judgments]] [[courses:rg:2013:meteor|Questions]]| |
| | ^ Dec 2 | Petr Jankovský | Petrovic, Mathews: [[http://homepages.inf.ed.ac.uk/s0894589/petrovic13unsupervised.pdf | Unsupervised joke generation from big data ]] [[courses:rg:2013:jokes|Questions]] \\ <html><font color="red">there will be a double Monday seminar in S1 before RG, I hope we will start not much later than at 16:00</font></html> | |
| | ^ Dec 9 | Anna Vernerová | T. Berg-Kirkpatrick, D. Burkett, D. Klein: [[http://www.aclweb.org/anthology/D/D12/D12-1091.pdf|An Empirical Investigation of Statistical Significance in NLP]] [[courses:rg:2013:significance-bootstrap|Questions]] | |
| | ^ Dec 16 | Petra Barančíková | Bill Dolan, Chris Quirk, and Chris Brockett: [[http://research.microsoft.com/pubs/68974/para_coling2004.pdf|Unsupervised Construction of Large Paraphrase Corpora: Exploiting Massively Parallel News Sources ]] [[courses:rg:2013:paraphrase-corpora|Questions]] | |
| | ^ Jan 6 | | | |
