[ Skip to the content ]

Institute of Formal and Applied Linguistics Wiki


[ Back to the navigation ]

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
courses:rg:past [2014/02/17 10:36]
popel archived Autumn&Winter 2013/2014
courses:rg:past [2014/10/12 15:06]
popel
Line 2: Line 2:
  
 (For the current semester see [[courses::rg|the main RG page]]) (For the current semester see [[courses::rg|the main RG page]])
 +
 +=== Spring&Summer 2014 ===
 +^ date   | **speaker** | **paper** |
 +^ 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 |
 +^ Mar 10 | Rudolf      | MLFix |
 +^ Mar 17 | Petra       | paraphrases |
 +^ Mar 23 | Martin      | [[http://ufal.mff.cuni.cz/~popel/treex/sheet.pdf|Treex]]  |
 +^ 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 |
 +^ Apr  7 | Loganathan  | McDonald, Petrov, Hall: [[http://www.aclweb.org/anthology/D11-1006.pdf|Multi-source Transfer of Delexicalized Dependency Parsers]], EMNLP 2011 |
 +^ Apr 14 | Vincent     | Keith Hall: [[http://aclweb.org/anthology-new/P/P07/P07-1050.pdf|k-best Spanning Tree Parsing]], ACL 2007 |
 +^ <del>Apr 21</del> | no RG       | Easter |
 +^ Apr 28 | Rudolf      | Goldberg, Elhadad: [[http://www.aclweb.org/anthology/N10-1115.pdf|An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing]], NAACL 2010 |
 +^ May  5 | Petra  | Goldberg, Orwant: [[http://www.aclweb.org/anthology/S13-1035.pdf|A Dataset of Syntactic-Ngrams over Time from a Very Large Corpus of English Books]], 2013 |
 +^ May 12 | Ivana  | short paper for LAW VIII |
 +^ May 19 | Ruda, Petra | dry-run presentations for LREC |
 +
 === Autumn&Winter 2013/2014 === === Autumn&Winter 2013/2014 ===
 ^ date   | **speaker**  | **paper** | ^ date   | **speaker**  | **paper** |
Line 25: Line 42:
 ^ Mar 11 | Ondřej Košarko   | Aron Culotta, Jeffrey Sorensen: [[http://www.newdesign.aclweb.org/anthology-new/P/P04/P04-1054.pdf|Dependency Tree Kernels for Relation Extraction]], ACL 2004. [[courses:rg:2013:dep-tree-kernels|Questions]] | ^ Mar 11 | Ondřej Košarko   | Aron Culotta, Jeffrey Sorensen: [[http://www.newdesign.aclweb.org/anthology-new/P/P04/P04-1054.pdf|Dependency Tree Kernels for Relation Extraction]], ACL 2004. [[courses:rg:2013:dep-tree-kernels|Questions]] |
 ^ Mar 18 |Jindřich Helcl  | 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:2013:hmm-perc-experiments|Questions]] | ^ Mar 18 |Jindřich Helcl  | 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:2013:hmm-perc-experiments|Questions]] |
-^ Mar 25 | Sara van de Moosdijk | 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:2013:memm|Questions & Answers]] |+^ Mar 25 | Sara van de Moosdijk | 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:2013:memm|Questions]] |
 ^ Apr 1  |--- | no RG, Easter (and April Fool's Day) | ^ Apr 1  |--- | no RG, Easter (and April Fool's Day) |
 ^ Apr 8  | Vincent Kríž | John Lafferty, Andrew McCallum, Fernando Pereira: [[http://www.cis.upenn.edu/~pereira/papers/crf.pdf|Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data]], 2001 [[courses:rg:2013:crf|Questions]] | ^ Apr 8  | Vincent Kríž | John Lafferty, Andrew McCallum, Fernando Pereira: [[http://www.cis.upenn.edu/~pereira/papers/crf.pdf|Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data]], 2001 [[courses:rg:2013:crf|Questions]] |

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