A spectral learning algorithm for finite state transducers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6911 LNAI, Issue PART 1, 2011, Pages 156-171

  Balle, Borja ^a   Quattoni, Ariadna ^a   Carreras, Xavier ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE STATE TRANSDUCERS; GRADIENT BASED; INPUT-OUTPUT; LARGE DATASETS; LOCAL OPTIMA; OPERATOR MODEL; REAL-WORLD PROBLEM; SPECTRAL ALGORITHM; SPECTRAL LEARNING ALGORITHMS; SPECTRAL METHODS; SYNTHETIC AND REAL DATA; TRAINING ALGORITHMS; HIDDEN MARKOV MODELS (HMMS); OBSERVABLE OPERATOR MODELS;

FINITE AUTOMATA; HIDDEN MARKOV MODELS; LEARNING SYSTEMS; MATHEMATICAL OPERATORS; SPECTROSCOPY; TRANSDUCERS; DATA MINING; MACHINE LEARNING;

LEARNING ALGORITHMS;

EID: 80052400030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23780-5_20     Document Type: Conference Paper

References (23)

1. Abe, N., Takeuchi, J., Warmuth, M.: Polynomial Learnability of Stochastic Rules with Respect to the KL-Divergence and Quadratic Distance. IEICE Transactions on Information and Systems 84(3), 299-316 (2001)
2. Bailly, R., Denis, F., Ralaivola, L.: Grammatical inference as a principal component analysis problem. In: Proc. ICML (2009)
3. Bernard, M., Janodet, J.-C., Sebban, M.: A discriminative model of stochastic edit distance in the form of a conditional transducer. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 240-252. Springer, Heidelberg (2006)
4. Carlyle, J.W., Paz, A.: Realization by stochastic finite automaton. Journal of Computer and System Sciences 5, 26-40 (1971)
5. Casacuberta, F.: Inference of finite-state transducers by using regular grammars and morphisms. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS (LNAI), vol. 1891, pp. 1-14. Springer, Heidelberg (2000)
6. Chang, J.T.: Full reconstruction of markov models on evolutionary trees: Identifiability and consistency. Mathematical Biosciences 137, 51-73 (1996)
7. Chen, S., Goodman, J.: An empirical study of smoothing techniques for language modeling. In: Proc. of ACL, pp. 310-318 (1996)
8. Clark, A.: Partially supervised learning of morphology with stochastic transducers. In: Proc. of NLPRS, pp. 341-348 (2001)
9. Clark, A., Costa Florêncio, C., Watkins, C.: Languages as hyperplanes: Grammatical inference with string kernels. Machine Learning, 1-23 (2010)
10. Eisner, J.: Parameter estimation for probabilistic finite-state transducers. In: Proc. of ACL, pp. 1-8 (2002)
11. Fliess, M.: Matrices de Hankel. Journal de Mathematiques Pures et Appliquees 53, 197-222 (1974)
12. Haardt, M., Nossek, J.A.: Simultaneous schur decomposition of several nonsymmetric matrices to achieve automatic pairing in multidimensional harmonic retrieval problems. IEEE Transactions on Signal Processing 46(1) (1998)
13. Hsu, D., Kakade, S.M., Zhang, T.: A spectral algorithm for learning hidden markov models. In: Proc. of COLT (2009)
14. Jaeger, H.: Observable operator models for discrete stochastic time series. Neural Computation 12, 1371-1398 (2000)
15. Jelinek, F.: Statistical Methods for Speech Recognition (Language, Speech, and Communication). MIT Press, Cambridge (1998)
16. Knight, K., Graehl, J.: Machine transliteration. Computational Linguistics 24(4), 599-612 (1998)
17. Li, H., Kumaran, A., Pervouchine, V., Zhang, M.: Report of news 2009 machine transliteration shared task. In: Proc. Named Entities Workshop (2009)
18. Mossel, E., Roch, S.: Learning nonsingular phylogenies and hidden markov models. In: Proc. of STOC (2005)
19. Neuts, M.F.: Matrix-geometric solutions in stochastic models: an algorithmic approach. Johns Hopkins University Press, Baltimore (1981)
20. Ng, A., Jordan, M.: On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes. In: NIPS (2002)
21. Ron, D., Singer, Y., Tishby, N.: On the learnability and usage of acyclic probabilistic finite automata. In: Proc. of COLT, pp. 31-40 (1995)
22. Schützenberger, M.: On the definition of a family of automata. Information and Control 4, 245-270 (1961)
23. Siddiqi, S.M., Boots, B., Gordon, G.J.: Reduced-Rank Hidden Markov Models. In: Proc. AISTATS, pp. 741-748 (2010)