Difference between revisions of "Class Meeting for 10-710 11-10-2011"
From Cohen Courses
Jump to navigationJump to search| Line 13: | Line 13: | ||
* [http://aclweb.org/anthology-new/P/P05/P05-1022.pdf Coarse-to-Fine <i>n</i>-Best Parsing and MaxEnt Discriminative Reranking], Charniak and Johnson, 2005 | * [http://aclweb.org/anthology-new/P/P05/P05-1022.pdf Coarse-to-Fine <i>n</i>-Best Parsing and MaxEnt Discriminative Reranking], Charniak and Johnson, 2005 | ||
* [http://dl.acm.org/citation.cfm?id=1015330.1015337 Kernel Conditional Random Fields: Representation and Clique Selection], Lafferty, Zhu, and Liu, 2004 | * [http://dl.acm.org/citation.cfm?id=1015330.1015337 Kernel Conditional Random Fields: Representation and Clique Selection], Lafferty, Zhu, and Liu, 2004 | ||
| + | * [http://jmlr.csail.mit.edu/papers/volume5/cortes04a/cortes04a.pdf Rational Kernels: Theory and Algorithms], Cortes, Haffner, and Mohri, 2004 | ||
| + | * [http://books.nips.cc/papers/files/nips15/AA50.pdf Kernel Dependency Estimation], Weston, Chapelle, Elisseeff, Schoelkopf, and Vapnik, 2003 | ||
| + | |||
=== Background Readings === | === Background Readings === | ||
Revision as of 17:14, 9 November 2011
This is one of the class meetings on the schedule for the course Structured Prediction 10-710 in Fall 2011.
Kernels for Outputs
Required Readings
- New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron, Collins and Duffy, 2002
Optional Readings
- Coarse-to-Fine n-Best Parsing and MaxEnt Discriminative Reranking, Charniak and Johnson, 2005
- Kernel Conditional Random Fields: Representation and Clique Selection, Lafferty, Zhu, and Liu, 2004
- Rational Kernels: Theory and Algorithms, Cortes, Haffner, and Mohri, 2004
- Kernel Dependency Estimation, Weston, Chapelle, Elisseeff, Schoelkopf, and Vapnik, 2003
