Differences
This shows you the differences between two versions of the page.
| Both sides previous revision
Previous revision
|
Next revision
Both sides next revision
|
courses:rg [2015/11/16 12:31]
popel |
courses:rg [2015/11/28 21:25]
popel |
| ^ 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]] [[courses:rg:2014:memm|Questions]]| | ^ 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 | Adéla | Charles J. Fillmore: [[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.494.5064&rep=rep1&type=pdf|Border Conflicts: FrameNet Meets Construction Grammar]], 2008 | |
| ^ 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]] | |
| |
