Parameter estimation for probabilistic finite-state transducers?

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 2002-July, Issue , 2002, Pages 1-8

  Eisner, Jason ^a  

^a Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; PARAMETER ESTIMATION;

A-TRAIN; FINITE STATE TRANSDUCERS; FINITE-STATE; MINIMISATION; PARAMETERIZED; PARAMETERS ESTIMATION; PROBABILISTICS; SEMI-RING; TRAINING ALGORITHMS; WEIGHTED FINITE-STATE TRANSDUCERS;

TRANSDUCERS;

EID: 85149140805     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. L. E. Baum. 1972. An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process. Inequalities, 3.
2. Jean Berstel and Christophe Reutenauer. 1988. Rational Series and their Languages. Springer-Verlag.
3. Stanley F. Chen and Ronald Rosenfeld. 1999. A Gaussian prior for smoothing maximum entropy models. Technical Report CMU-CS-99-108, Carnegie Mellon.
4. S. Della Pietra, V. Della Pietra, and J. Lafferty. 1997. Inducing features of random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(4).
5. A. P. Dempster, N. M. Laird, and D. B. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Statist. Soc. Ser. B, 39(1):1-38.
6. Jason Eisner. 2001a. Expectation semirings: Flexible EM for finite-state transducers. In G. van Noord, ed., Proc. of the ESSLLIWorkshop on Finite-State Methods in Natural Language Processing. Extended abstract.
7. Jason Eisner. 2001b. Smoothing a Probabilistic Lexicon via Syntactic Transformations. Ph.D. thesis, University of Pennsylvania.
8. D. Gerdemann and G. van Noord. 1999. Transducers from rewrite rules with backreferences. Proc. of EACL.
9. Anne Greenbaum. 1997. Iterative Methods for Solving Linear Systems. Soc. for Industrial and Applied Math.
10. Kevin Knight and Yaser Al-Onaizan. 1998. Translation with finite-state devices. In Proc. of AMTA.
11. Kevin Knight and Jonathan Graehl. 1998. Machine transliteration. Computational Linguistics, 24(4).
12. J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. Proc. of ICML.
13. D. J. Lehmann. 1977. Algebraic structures for transitive closure. Theoretical Computer Science, 4(1):59-76.
14. A. McCallum, D. Freitag, and F. Pereira. 2000. Maximum entropy Markov models for information extraction and segmentation. Proc. of ICML, 591-598.
15. M. Mohri and M.-J. Nederhof. 2001. Regular approximation of context-free grammars through transformation. In J.-C. Junqua and G. van Noord, eds., Robustness in Language and Speech Technology. Kluwer.
16. Mehryar Mohri and Richard Sproat. 1996. An efficient compiler for weighted rewrite rules. In Proc. of ACL.
17. M. Mohri, F. Pereira, and M. Riley. 1998. A rational design for a weighted finite-state transducer library. Lecture Notes in Computer Science, 1436.
18. M. Mohri. 2002. Generic epsilon-removal and input epsilon-normalization algorithms for weighted transducers. Int. J. of Foundations of Comp. Sci., 1(13).
19. Mark-Jan Nederhof. 2000. Practical experiments with regular approximation of context-free languages. Computational Linguistics, 26(1).
20. Fernando C. N. Pereira and Michael Riley. 1997. Speech recognition by composition of weighted finite automata. In E. Roche and Y. Schabes, eds., Finite-State Language Processing. MIT Press, Cambridge, MA.
21. A. Rao and K. Rose. 2001 Deterministically annealed design of hidden Markov movel speech recognizers. In IEEE Trans. on Speech and Audio Processing, 9(2).
22. Stefan Riezler. 1999. Probabilistic Constraint Logic Programming. Ph.D. thesis, Universität Tübingen.
23. E. Ristad and P. Yianilos. 1996. Learning string edit distance. Tech. Report CS-TR-532-96, Princeton.
24. E. Ristad. 1998. Hidden Markov models with finite state supervision. In A. Kornai, ed., Extended Finite State Models of Language. Cambridge University Press.
25. Emmanuel Roche and Yves Schabes, editors. 1997. Finite-State Language Processing. MIT Press.
26. Günter Rote. 1985. A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion). Computing, 34(3):191-219.
27. Richard Sproat and Michael Riley. 1996. Compilation of weighted finite-state transducers from decision trees. In Proceedings of the 34th Annual Meeting of the ACL.
28. Andreas Stolcke and Stephen M. Omohundro. 1994. Best-first model merging for hidden Markov model induction. Tech. Report ICSI TR-94-003, Berkeley, CA.
29. Robert Endre Tarjan. 1981a. A unified approach to path problems. Journal of the ACM, 28(3):577-593, July.
30. Robert Endre Tarjan. 1981b. Fast algorithms for solving path problems. J. of the ACM, 28(3):594-614, July.
31. G. van Noord and D. Gerdemann. 2001. An extendible regular expression compiler for finite-state approaches in natural language processing. In Automata Implementation, no. 22 in Springer Lecture Notes in CS.