Difference between revisions of "Class Meeting for 10-710 10-27-2011"
From Cohen Courses
Jump to navigationJump to search (Created page with 'This is one of the class meetings on the schedule for the course Structured Prediction 10-710 in Fall 2011. === We…') |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 11: | Line 11: | ||
=== Optional Readings === | === Optional Readings === | ||
| + | * [http://www.morganclaypool.com/doi/abs/10.2200/S00361ED1V01Y201105HLT013 Sections 5.1 and 5.2 <i>Linguistic Structure Prediction</i>, Smith 2011] | ||
| + | * [http://aclweb.org/anthology-new/D/D09/D09-1005.pdf First- and Second-Order Expectation Semirings with Applications to Minimum-Risk Training on Translation Forests], Z. Li and J. Eisner, EMNLP 2009 | ||
* [http://www.aclweb.org/anthology-new/D/D09/D09-1011.pdf Graphical Models over Multiple Strings], M. Dreyer and J. Eisner, EMNLP 2009 | * [http://www.aclweb.org/anthology-new/D/D09/D09-1011.pdf Graphical Models over Multiple Strings], M. Dreyer and J. Eisner, EMNLP 2009 | ||
* [http://www.cs.jhu.edu/~jason/papers/dreyer+al.emnlp08.pdf Latent-Variable Modeling of String Transductions with Finite-State Methods], M. Dreyer, J. Smith, and J. Eisner, EMNLP 2008 | * [http://www.cs.jhu.edu/~jason/papers/dreyer+al.emnlp08.pdf Latent-Variable Modeling of String Transductions with Finite-State Methods], M. Dreyer, J. Smith, and J. Eisner, EMNLP 2008 | ||
| + | * [http://www.isi.edu/natural-language/mt/mt-wfst.ps Translation with Finite-State Devices], Y. Al-Onaizan and K. Knight, AMTA 1998 | ||
| + | * [http://aclweb.org/anthology-new/J/J98/J98-4003.pdf Machine Transliteration], K. Knight and J. Graehl, CL 1998 | ||
| + | * [http://www.cis.upenn.edu/~pereira/papers/pereira+riley-97.ps Speech Recognition by Composition of Weighted Finite Automata], F. Pereira and M. Riley, 1997 | ||
* Papers on WFST algorithms are indexed [http://www.cs.nyu.edu/~mohri/transducer-algorithms.html here] | * Papers on WFST algorithms are indexed [http://www.cs.nyu.edu/~mohri/transducer-algorithms.html here] | ||
Latest revision as of 16:31, 27 October 2011
This is one of the class meetings on the schedule for the course Structured Prediction 10-710 in Fall 2011.
Contents
Weighted Finite-State Transducers
Required Readings
- Parameter Estimation for Probabilistic Finite-State Transducers, J. Eisner, ACL 2002
Optional Readings
- Sections 5.1 and 5.2 Linguistic Structure Prediction, Smith 2011
- First- and Second-Order Expectation Semirings with Applications to Minimum-Risk Training on Translation Forests, Z. Li and J. Eisner, EMNLP 2009
- Graphical Models over Multiple Strings, M. Dreyer and J. Eisner, EMNLP 2009
- Latent-Variable Modeling of String Transductions with Finite-State Methods, M. Dreyer, J. Smith, and J. Eisner, EMNLP 2008
- Translation with Finite-State Devices, Y. Al-Onaizan and K. Knight, AMTA 1998
- Machine Transliteration, K. Knight and J. Graehl, CL 1998
- Speech Recognition by Composition of Weighted Finite Automata, F. Pereira and M. Riley, 1997
- Papers on WFST algorithms are indexed here
Background Readings
- Learning FSA structure: Hidden Markov Model Induction by Bayesian Model Merging, A. Stolcke and S. Omohundro, NIPS 1993
- Connecting to linguistics: A Short History of Two-Level Morphology, L. Karttunen, 2001
