Difference between revisions of "Class Meeting for 10-710 10-20-2011"
From Cohen Courses
Jump to navigationJump to search| Line 6: | Line 6: | ||
* [http://www.cs.cmu.edu/~wcohen/10-710/10-18-editDistances.pdf PDF] | * [http://www.cs.cmu.edu/~wcohen/10-710/10-18-editDistances.pdf PDF] | ||
| − | We'll pick up where we left off Tuesday with these slides, and discuss the | + | We'll pick up where we left off Tuesday with these slides, and discuss the McCallum, Bellare & Pereira paper, and also discuss the math behind EM in a little more detail. |
=== Required Readings === | === Required Readings === | ||
Revision as of 14:36, 17 October 2011
This is one of the class meetings on the schedule for the course Syllabus for Structured Prediction 10-210 in Fall 2011.
Learning Edit Distances: 2
We'll pick up where we left off Tuesday with these slides, and discuss the McCallum, Bellare & Pereira paper, and also discuss the math behind EM in a little more detail.
Required Readings
- A Conditional Random Field for Discriminatively-trained Finite-state String Edit Distance. Andrew McCallum, Kedar Bellare and Fernando Pereira, Conference on Uncertainty in AI (UAI'05), 2005.
Optional Readings
- Generalized Expectation Criteria for Bootstrapping Extractors using Record-Text Alignment. Kedar Bellare and Andrew McCallum. Empirical Methods in NLP (EMNLP) 2009, Singapore (EMNLP'09), 2009.
Background
- Expectation-maximization: A short tutorial. Sean Borman. The material on EM is mostly taken from this tutorial.
