[ Skip to the content ]

Institute of Formal and Applied Linguistics Wiki

[ Back to the navigation ]

You are here: start » courses » rg

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 [2014/10/13 20:22]
ebrahimian 		courses:rg [2014/10/13 22:38]
ufal
Line 25: Line 25:
 ^ Oct  6 |              | startup meeting | ^ Oct  6 |              | startup meeting |
 ^ Oct 13 | Jindřich Libovický | Peter F. Brown et all.: [[http://www.aclweb.org/anthology/J92-4003|Class-Based n-gram Models of Natural Language]], Computational Linguistics, 1992. See also [[http://statmt.blogspot.cz/2014/07/understanding-mkcls.html| notes about the mkcls implementation]] | ^ Oct 13 | Jindřich Libovický | Peter F. Brown et all.: [[http://www.aclweb.org/anthology/J92-4003|Class-Based n-gram Models of Natural Language]], Computational Linguistics, 1992. See also [[http://statmt.blogspot.cz/2014/07/understanding-mkcls.html| notes about the mkcls implementation]] |
-^ Oct 20 | Tomáš Kraut | 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.|+^ Oct 20 | Tomáš Kraut | 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:2014:perceptron|Questions]]|
 ^ Oct 27  | Roman Sudarikov | 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]] | ^ Oct 27  | Roman Sudarikov | 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]] |
 ^ Nov 3 | Dušan Variš | 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. | ^ Nov 3 | Dušan Variš | 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. |

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