[ 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 Both sides next revision
courses:rg [2015/11/04 10:59]
popel
courses:rg [2015/11/16 12:31]
popel
Line 32: Line 32:
 ^ Nov 16 |              | cont. from last RG | ^ Nov 16 |              | cont. from last RG |
 ^ Nov 23 | Milan, Lukáš | NN hackaton | ^ Nov 23 | Milan, Lukáš | NN hackaton |
-^ Nov 30 | Aneta        | 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 30 | Aneta        | 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:2014:memm|Questions]]|
 ^ Dec  7 |              | hackaton | ^ Dec  7 |              | hackaton |
 ^ Dec 14 |              | John Lafferty, Andrew McCallum, Fernando Pereira: [[http://www.cs.utah.edu/~piyush/teaching/crf.pdf|Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data]], 2001. [[courses:rg:2014:crf|Questions]] | ^ Dec 14 |              | John Lafferty, Andrew McCallum, Fernando Pereira: [[http://www.cs.utah.edu/~piyush/teaching/crf.pdf|Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data]], 2001. [[courses:rg:2014:crf|Questions]] |
  

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