[ Skip to the content ]

Institute of Formal and Applied Linguistics Wiki

[ Back to the navigation ]

You are here: start » courses » rg » past

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 Both sides next revision
courses:rg:past [2014/09/26 12:41]
popel 		courses:rg:past [2014/10/12 15:06]
popel
Line 42: 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 ]