Kernel methods for learning languages

Theoretical Computer Science

Volumn 405, Issue 3, 2008, Pages 223-236

  Cortes, Corinna ^b   Mohri, Mehryar ^b,c  

^a Aryeh)   (Israel)

^b GOOGLE INC   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Finite automata; Kernels; Learning automata; Margin theory; Piecewise testable languages; Support vector machines

Indexed keywords

BANACH SPACES; CONFORMAL MAPPING; FORMAL LANGUAGES; HILBERT SPACES; LEARNING SYSTEMS; SUPPORT VECTOR MACHINES; TRANSLATION (LANGUAGES); TURBULENT FLOW;

FINITE AUTOMATA; KERNELS; LEARNING AUTOMATA; MARGIN THEORY; PIECEWISE-TESTABLE LANGUAGES;

LINGUISTICS;

EID: 51049103186     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.06.037     Document Type: Article

References (32)

1. Cyril Allauzen, Mehryar Mohri, N-way composition of weighted finite-state transducers, Technical Report TR2007-902, Courant Institute of Mathematical Sciences, New York University, August 2007
2. Angluin D. On the complexity of minimum inference of regular sets. Information and Control 3 39 (1978) 337-350
3. Angluin D. Inference of reversible languages. Journal of the ACM, JACM 3 29 (1982) 741-765
4. Martin Anthony, Threshold functions, decision lists, and the representation of Boolean functions, Neurocolt Technical Report Series NC-TR-96-028, Royal Holloway, University of London, 1996
5. Bartlett P., and Shawe-Taylor J. Generalization performance of support vector machines and other pattern classifiers. Advances in kernel Methods: Support Vector Learning (1999), MIT Press, Cambridge, MA, USA 43-54
6. Boser B.E., Guyon I., and Vapnik V.N. A training algorithm for optimal margin classifiers. Proceedings of the Fifth Annual Workshop of Computational Learning Theory vol. 5 (1992), ACM, Pittsburg 144-152
7. Cortes C., Haffner P., and Mohri M. Rational kernels: Theory and algorithms. Journal of Machine Learning Research, JMLR 5 (2004) 1035-1062
8. Cortes C., Kontorovich L., and Mohri M. Learning languages with rational kernels. Proceedings of The 20th Annual Conference on Learning Theory. COLT 2007, San Diego, California, June 2007. Lecture Notes in Computer Science vol. 4539 (2007), Springer, Heidelberg, Germany 349-364
9. Cortes C., and Vapnik V.N. Support-vector networks. Machine Learning 20 3 (1995) 273-297
10. Jonathan Derryberry, Private communication, 2004
11. Freund Y., Kearns M., Ron D., Rubinfeld R., Schapire R.E., and Sellie L. Efficient learning of typical finite automata from random walks. Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing. STOC '93 (1993), ACM Press, New York, NY, USA 315-324
12. García P., and Ruiz J. Learning k-testable and k-piecewise testable languages from positive data. Grammars 7 (2004) 125-140
13. Mark Gold E. Language identification in the limit. Information and Control 50 10 (1967) 447-474
14. Mark Gold E. Complexity of automaton identification from given data. Information and Control 3 37 (1978) 302-420
15. Haines L.H. On free monoids partially ordered by embedding. Journal of Combinatorial Theory 6 (1969) 35-40
16. Haussler D., Littlestone N., and Warmuth M.K. Predicting {0, 1}-functions on randomly drawn points. Proceedings of the First Annual Workshop on Computational Learning Theory. COLT 1988 (1988), Morgan Kaufmann Publishers Inc., San Francisco, CA, USA 280-296
17. Higman G. Odering by divisibility in abstract algebras. Proceedings of The London Mathematical Society 2 (1952) 326-336
18. Kearns M., and Vazirani U. An Introduction to Computational Learning Theory (1997), The MIT Press
19. Leonid Kontorovich, A universal kernel for learning regular languages, in: The 5th International Workshop on Mining and Learning with Graphs, MLG 2007, Florence, Italy, 2007
20. Kontorovich L., Cortes C., and Mohri M. Learning linearly separable languages. Proceedings of The 17th International Conference on Algorithmic Learning Theory. ALT 2006, Barcelona, Spain, October 2006. Lecture Notes in Computer Science vol. 4264 (2006), Springer, Heidelberg, Germany 288-303
21. Kuich W., and Salomaa A. Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science vol. 5 (1986), Springer-Verlag
22. Lodhi H., Shawe-Taylor J., Cristianini N., and Watkins C. Text classification using string kernels. In: Leen T.K., Dietterich T.G., and Tresp V. (Eds). NIPS 2000 (2001), MIT Press 563-569
23. Lothaire M. Combinatorics on Words. Encyclopedia of Mathematics and Its Applications vol. 17 (1983), Addison-Wesley
24. Mateescu A., and Salomaa A. Formal languages: An introduction and a synopsis. Handbook of Formal Languages, Volume 1: Word, Language, Grammar (1997), Springer-Verlag New York, Inc., New York, NY, USA 1-39
25. Mohri M. Generic epsilon-removal and input epsilon-normalization algorithms for weighted transducers. International Journal of Foundations of Computer Science 13 1 (2002) 129-143
26. Oncina J., García P., and Vidal E. Learning subsequential transducers for pattern recognition interpretation tasks. IEEE Transactions on Pattern Analysis and Machine Intelligence 15 5 (1993) 448-458
27. Perrin D. Finite automata. In: Van Leuwen J. (Ed). Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (1990), Elsevier, Amsterdam 1-57
28. Pitt L., and Warmuth M. The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the Association for Computing Machinery 40 1 (1993) 95-142
29. Ron D., Singer Y., and Tishby N. On the learnability and usage of acyclic probabilistic finite automata. Journal of Computer and System Sciences 56 2 (1998) 133-152
30. Simon I. Piecewise testable events. Automata Theory and Formal Languages (1975) pp. 214-222
31. Trakhtenbrot B.A., and Barzdin J.M. Finite Automata: Behavior and Synthesis. Fundamental Studies in Computer Science vol. 1 (1973), North-Holland, Amsterdam
32. Vapnik V.N. Statistical Learning Theory (1998), John Wiley & Sons