A bibliographical study of grammatical inference

Pattern Recognition

Volumn 38, Issue 9, 2005, Pages 1332-1348

  De La Higuera, Colin ^a  

^a UNIVERSITÉ JEAN MONNET   (France)

Author keywords

Grammar induction; Grammatical inference

Indexed keywords

DATA MINING; FINITE AUTOMATA; FORMAL LANGUAGES; INTELLIGENT AGENTS; LEARNING ALGORITHMS; LEARNING SYSTEMS; PATTERN RECOGNITION; SPEECH RECOGNITION; XML;

ALGORITHMIC LEARNING THEORY (ALT); FORMAL LANGUAGE THEORY; GRAMMAR INDUCTION; GRAMMATICAL INFERENCE;

COMPUTATIONAL GRAMMARS;

EID: 19944393257     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2005.01.003     Document Type: Article

References (196)

1. R.C. Carrasco, J. Oncina (Eds.), Grammatical Inference and Applications, Proceedings of ICGI '94, Lecture Notes in Artificial Intelligence, vol. 862, Springer, Berlin, Heidelberg, 1994.
2. L. Miclet, C. de la Higuera (Eds.), Proceedings of ICGI '96, Lecture Notes in Artificial Intelligence, vol. 1147, Springer, Berlin, Heidelberg, 1996.
3. V. Honavar, G. Slutski (Eds.), Grammatical Inference, Proceedings of ICGI '98, Lecture Notes in Artificial Intelligence, vol. 1433, Springer, Berlin, Heidelberg, 1998.
4. A. de Oliveira (Ed.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 1891, Springer, Berlin, Heidelberg, 2000.
5. P. Adriaans, H. Fernau, M. van Zaannen (Eds.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 2484, Springer, Berlin, Heidelberg, 2002.
6. M. van Zaanen, The grammatical inference homepage, 2003. URL http://eurise.univ-st-etienne.fr/gi/gi.html.
7. S.S. Kwerk, Colt: Computational learning theory, 1999. URL http://www.learningtheory.org.
8. T. Zeugmann, Alt series home page, 1999. URL http://www.tcs.mu-luebeck. de/pages/thomas/WALT/waltn.jhtml.
9. K.S. Fu Syntactic Methods in Pattern Recognition 1974 Academic Press New York
10. K.S. Fu, and T.L. Booth Grammatical inference: Introduction and survey. Part I and II IEEE Trans. Syst. Man. Cybernet. 5 1975 59 72 and 409-423
11. L. Miclet Structural Methods in Pattern Recognition 1986 Chapman & Hall New York
12. H. Bunke, A. Sanfeliu (Eds.), Syntactic and Structural Pattern Recognition, Theory and Applications, Series in Computer Science, vol. 7, World Scientific, Singapore, New Jersey, London, Hong Kong, 1990.
13. L. Miclet Grammatical inference Syntactic and Structural Pattern Recognition, Theory and Applications 1990 World Scientific Singapore 237 290
14. S. Lee, Learning of context-free languages: a survey of the literature, Technical Report TR-12-96, Center for Research in Computing Technology, Harvard University, Cambridge, MA, 1996.
15. Y. Sakakibara Recent advances of grammatical inference Theoret. Comput. Sci. 185 1997 15 45
16. V. Honavar, and C. de la Higuera Introduction Mach. Learning J. 44 1 2001 5 7
17. C. de la Higuera, Current trends in grammatical inference, in: F.J. Ferri, et al. (Eds.), Advances in Pattern Recognition, Joint IAPR International Workshops SSPR+SPR 2000, Lecture Notes in Computer Science, vol. 1876, Springer, Berlin, 2000, pp. 28-31.
18. M.H. Harrison Introduction to Formal Language Theory 1978 Addison-Wesley Publishing Company, Inc. Reading, MA
19. J.E. Hopcroft, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation 1979 Addison-Wesley Reading, MA
20. A. Aho, and J.D. Ullman The Theory of Parsing, Translation and Compiling, Parsing vol. 1 1972 Prentice-Hall Englewood Cliffs, NJ
21. T.M. Mitchell Machine Learning 1997 McGraw-Hill New York
22. B.L. Natarajan Machine Learning: a Theoretical Approach 1991 Morgan Kauffman Pub. San Mateo, CA
23. M. Kearns, and U. Vazirani An Introduction to Computational Learning Theory 1994 MIT Press Cambridge, MA
24. R. Gonzalez, and M. Thomason Syntactic Pattern Recognition: an Introduction 1978 Addison-Wesley Reading, MA
25. B. Trakhtenbrot, and Y. Barzdin Finite Automata: Behavior and Synthesis 1973 North-Holland Amsterdam
26. K. Lang, B.A. Pearlmutter, The Abbadingo one DFA learning competition, 1997, URL http://abbadingo.cs.unm.edu/.
27. K.J. Lang, B.A. Pearlmutter, R.A. Price, Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm, in: Honavar and Slutski (Eds.), Grammatical Inference, Proceedings of ICGI '98, Lecture Notes in Artificial Intelligence, vol. 1433, Springer, Berlin, Heidelberg, 1998, pp. 1-12.
28. D. Angluin Learning regular sets from queries and counterexamples Inform. and Control 39 1987 337 350
29. D. Angluin, Queries revisited, in: Abe, et al. (Eds.), Proceedings of ALT 2001, Lecture Notes in Computer Science, vol. 2225, Springer, Berlin, Heidelberg, 2001, pp. 12-31.
30. C. de la Higuera Characteristic sets for polynomial grammatical inference Mach. Learning J. 27 1997 125 138
31. R. Solomonoff A formal theory of inductive inference Inform. and Control 7 1964 224 254
32. E.M. Gold Language identification in the limit Inform. and Control 10 5 1967 447 474
33. E.M. Gold Complexity of automaton identification from given data Inform. and Control 37 1978 302 320
34. D. Angluin Inductive inference of formal languages from positive data Inform. and Control 45 1980 117 135
35. K. Wright Identification of unions of languages drawn from an identifiable class Proceedings of Workshop on Computational Learning Theory 1989 Morgan Kaufmann Publishers Los Altos, CA 328 333
36. S. Lange, T. Zeugmann, Monotonic versus non-monotonic language learning, in: Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic, Lecture Notes in Artificial Intelligence, vol. 659, Springer, Berlin, 1993, pp. 254-269.
37. R.M. Wharton Approximate language identification Inform. and Control 26 1974 236 255
38. D. Angluin, and C. Smith Inductive inference: theory and methods ACM Comput. Surveys 15 3 1983 237 269
39. L. Pitt, Inductive inference, DFA's, and computational complexity, in: Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence, vol. 397, Springer, Berlin, Heidelberg, 1989, pp. 18-44.
40. D. Angluin On the complexity of minimum inference of regular sets Inform. and Control 39 1978 337 350
41. L. Pitt, and M. Warmuth The minimum consistent DFA problem cannot be approximated within any polynomial J. Assoc. Comput. Mach. 40 1 1993 95 142
42. D. Angluin Queries and concept learning Mach. Learning J. 2 1987 319 342
43. D. Angluin Negative results for equivalence queries Mach. Learning J. 5 1990 121 150
44. R. Gavaldà, On the power of equivalence queries, in: Proceedings of the First European Conference on Computational Learning Theory, The Institute of Mathematics and its Applications Conference Series, New Series, vol. 53, Oxford University Press, Oxford, 1993, pp. 193-203.
45. L. Pitt, M. Warmuth, Reductions among prediction problems: on the difficulty of predicting automata, in: Third Conference on Structure in Complexity Theory, 1988, pp. 60-69.
46. M. Warmuth, Towards representation independence in pac-learning, in: K.P. Jantke (Ed.), Proceedings of AII'89, Lecture Notes in Artificial Intelligence, vol. 397, Springer, Berlin, 1989, pp. 78-103.
47. N. Littlestone Learning quickly when irrelevant attributes abound: a new linear threshold Mach. Learning J. 2 1987 285 318
48. S.A. Goldman, and M. Kearns On the complexity of teaching J. Comput. Syst. Sci. 50 1 1995 20 31
49. S.A. Goldman, and H. Mathias Teaching a smarter learner J. Comput. Syst. Sci. 52 2 1996 255 267
50. D. Angluin A note on the number of queries needed to identify regular languages Inform. and Control 51 1981 76 87
51. D. Angluin, Identifying languages from stochastic examples, Technical Report YALEU/DCS/RR-614, Yale University, March 1988.
52. J.L. Balcazar, J. Diaz, R. Gavaldà, and O. Watanabe The query complexity of learning DFA New Generat. Comput. 12 1994 337 358
53. D. Angluin, and M. Kharitonov When won't membership queries help? Proceedings of 24th ACM Symposium on Theory of Computing 1991 ACM Press New York 444 454
54. Y. Sakakibara Learning context-free grammars from structural data in polynomial time Theoret. Comput. Sci. 76 1990 223 242
55. A. Birkendorf, A. Boeker, and H.U. Simon Learning deterministic finite automata from smallest counterexamples SIAM J. Discrete Math. 13 4 2000 465 491
56. N.H. Bshouty, R. Cleve, R. Gavaldà, S. Kannan, and C. Tamon Oracles and queries that are sufficient for exact learning J. Comput. Syst. Sci. 52 1996 421 433
57. Y. Sakakibara, Inferring parsers of context-free languages from structural examples, Technical Report 81, Fujitsu Limited, International Institute for Advanced Study of Social Information Science, Numazu, Japan, 1987.
58. T. Yokomori, Learning two-tape automata from queries and counterexamples, Math. Syst. Theory (1996) 259-270.
59. T. Yokomori Learning non-deterministic finite automata from queries and counterexamples Mach. Intell. 13 1994 169 189
60. J.M. Vilar, Query learning of subsequential transducers, in: L. Miclet, C. de la Higuera (Eds.), Proceedings of ICGI '96, Lecture Notes in Artificial Intelligence, vol. 1147, Springer, Berlin, Heidelberg, 1996, pp. 72-83.
61. O. Maler, A. Pnueli, On the learnability of infinitary regular sets, in: Proceedings of COLT, Morgan-Kauffman, San Mateo, 1991, pp. 128-136.
62. L.G. Valiant A theory of the learnable Commun. Assoc. Comput. Mach. 27 11 1984 1134 1142
63. Y. Ishigami, and S. Tani VC-dimensions of finite automata and commutative finite automata with k letters and n states Discrete Appl. Math. 74 1997 123 134
64. P. Bhattacharyya, G. Nagaraja, Learning a class of regular languages in the probably approximately correct learnability framework of Valiant, in: Grammatical Inference: Theory, Applications and Alternatives, First Colloquium on Grammatical Inference, Essex, U.K., IEE Digest no. 1993/092, London, IEE, Essex, UK, 1993.
65. D. Ron, Y. Singer, and N. Tishby Learning probabilistic automata with variable memory length Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory 1994 ACM Press New Brunswick, NJ 35 46
66. M. Kearns, L. Valiant, Cryptographic limitations on learning boolean formulae and finite automata, in: 21st ACM Symposium on Theory of Computing, 1989, pp. 433-444.
67. M. Li, and P. Vitanyi An Introduction to Kolmogorov Complexity and its Applications 1993 Springer Berlin
68. M. Li, and P. Vitanyi Learning simple concepts under simple distributions SIAM J. Comput. 20 1991 911 935
69. R.J. Parekh, V. Honavar, Learning DFA from simple examples, in: Workshop on Automata Induction, Grammatical Inference, and Language Acquisition, ICML-97, 1997.
70. P. Dupont, L. Miclet, E. Vidal, What is the search space of the regular inference?, in: R.C. Carrasco, J. Oncina, (Eds.), Grammatical Inference and Applications, Proceedings of ICGI '94, Lecture Notes in Artificial Intelligence, vol. 862, Springer, Berlin, Heidelberg, 1994, pp. 25-37.
71. K. Lang, Random DFA's can be approximately learned from sparse uniform examples, in: Proceedings of COLT 1992, 1992, pp. 45-52.
72. C. de la Higuera, J. Oncina, E. Vidal, Identification of DFA: data-dependent versus data-independent algorithm, in: L. Miclet, C. de la Higuera (Eds.), Proceedings of ICGI '96, Lecture Notes in Artificial Intelligence, vol. 1147, Springer, Berlin, Heidelberg, 1996, pp. 313-325.
73. J.Y. Giordano, Grammatical inference using tabu search, in: L. Miclet, C. de la Higuera (Eds.), Proceedings of ICGI '96, Lecture Notes in Artificial Intelligence, vol. 1147, Springer, Berlin, Heidelberg, 1996, pp. 292-300.
74. P. Dupont, Regular grammatical inference from positive and negative samples by genetic search: the GIG method, in: R.C. Carrasco, J. Oncina (Eds.), Grammatical Inference and Applications, Proceedings of ICGI '94, Lecture Notes in Artificial Intelligence, vol. 862, Springer, Berlin, Heidelberg, 1994, pp. 236-245.
75. F. Denis, A. Lemay, A. Terlutte, Learning regular languages using RFSA, in: N. Abe, et al. (Eds.), Proceedings of ALT 2001, Lecture Notes in Computer Science, vol. 2225, Springer, Berlin, Heidelberg, 2001, pp. 348-363.
76. A.L. de Oliveira, and J.P.M. Silva Efficient algorithms for the inference of minimum size DFAs Mach. Learning J. 44 1 2001 93 119
77. K. Lang, Faster algorithms for finding minimal consistent DFAs, Technical Report, NEC Research Institute, 1999.
78. J.L. Balcazar, J. Diaz, R. Gavaldà, and O. Watanabe An optimal parallel algorithm for learning DFA Proceedings of the Seventh COLT 1994 ACM Press New York 208 217
79. A. Biermann, A grammatical inference program for linear languages, in: Fourth Hawaii International Conference on System Sciences, 1971, pp. 121-123.
80. Y. Takada Grammatical inference for even linear languages based on control sets Inform. Process. Lett. 28 4 1988 193 199
81. J.M. Sempere, P. García, A characterisation of even linear languages and its application to the learning problem, in: R.C. Carrasco, J. Oncina (Eds.), Grammatical Inference and Applications, Proceedings of ICGI '94, Lectures Notes in Artificial Intelligence, vol. 862, Springer, Berlin, Heidelberg, 1994, pp. 38-44.
82. E. Mäkinen A note on the grammatical inference problem for even linear languages Fundam. Inf. 25 2 1996 175 182
83. Y. Takada, A hierarchy of language families learnable by regular language learners, in: R.C. Carrasco, J. Oncina (Eds.), Grammatical Inference and Applications, Proceedings of ICGI '94, Lectures Notes in Artificial Intelligence, vol. 862, Springer, Berlin, Heidelberg, 1994, pp. 16-24.
84. T. Koshiba, E. Mäkinen, and Y. Takada Learning deterministic even linear languages from positive examples Theoret. Comput. Sci. 185 1 1997 63 79
85. J.M. Sempere, G. Nagaraja, Learning a subclass of linear languages from positive structural information, in: V. Honavar, G. Slutski (Eds.), Grammatical Inference, Proceedings of ICGI '98, Lectures Notes in Artificial Intelligence, vol. 1433, Springer, Berlin, Heidelberg, 1998, pp. 162-174.
86. T. Yokomori, Learning context-free languages efficiently: a report on recent results in Japan, in: K.P. Jantke (Ed.), Analogical and Inductive Inference: Proceedings of the International Workshop AII'89, Springer, Berlin, Heidelberg, 1989, pp. 104-123.
87. C. de la Higuera, J. Oncina, Learning deterministic linear languages, in: J. Kivinen, R.H. Sloan (Eds.), Proceedings of COLT 2002, Lectures Notes in Artificial Intelligence, vol. 2375, Springer, Berlin, Heidelberg, 2002, pp. 185-200.
88. C. de la Higuera, J. Oncina, On sufficient conditions to identify in the limit classes of grammars from polynomial time and data, in: P. Adriaans, et al. (Eds.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lectures Notes in Artificial Intelligence, vol. 2484, Springer, Berlin, Heidelberg, 2002, pp. 134-148.
89. J.Y. Giordano, Inference of context-free grammars by enumeration: structural containment as an ordering bias, in: R.C. Carrasco, J. Oncina (Eds.), Grammatical Inference and Applications, Proceedings of ICGI '94, Lectures Notes in Artificial Intelligence, vol. 862, Springer, Berlin, Heidelberg, 1994, pp. 212-221.
90. Y. Sakakibara Efficient learning of context-free grammars from positive structural examples Inform. and Comput. 97 1992 23 60
91. Y. Sakakibara, M. Kondo, Ga-based learning of context-free grammars using tabular representations, in: Proceedings of 16th International Conference on Machine Learning (ICML-99), 1999, pp. 354-360.
92. Y. Sakakibara, H. Muramatsu, Learning context-free grammars from partially structured examples, in: A. de Oliveira (Ed.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lectures Notes in Artificial Intelligence, vol. 1891, Springer, Berlin, Heidelberg, 2000, pp. 229-240.
93. I. Ishizaka, Learning simple deterministic languages, in: Proceedings of COLT 89, 1989.
94. C. Nevill-Manning, and I. Witten Identifying hierarchical structure in sequences: a linear-time algorithm J. Artif. Intell. Res. 7 1997 67 82
95. P. García, J. Oncina, Inference of recognizable tree sets, Technical Report DSIC-II/47/93, Departamento de Lenguajes y Sistemas Informáticos, Universidad Politécnica de Valencia, Spain, 1993.
96. R.C. Carrasco, J. Oncina, and J. Calera-Rubio Stochastic inference of regular tree languages Mach. Learning J. 44 1 2001 185 197
97. T. Knuutila, and M. Steinby Inference of tree languages from a finite sample: an algebraic approach Theoret. Comput. Sci. 129 1994 337 367
98. H. Fernau, Learning tree languages from text, in: J. Kivinen, R.H. Sloan (Eds.), Proceedings of COLT 2002, Lectures Notes in Artificial Intelligence, vol. 2375, Springer, Berlin, Heidelberg, 2002, pp. 153-168.
99. K. Vanlehn, and W. Ball A version space approach to learning context-free grammars Mach. Learning J. 2 1987 39 74
100. P. Langley, S. Stromsten, Learning context-free grammars with a simplicity bias, in: Proceedings of ECML 2000, 11th European Conference on Machine Learning, Lecture Notes in Computer Science, vol. 1810, Springer, Berlin, 2000, pp. 220-228.
101. T. Yokomori, S. Kobayashi, Inductive learning of regular sets from examples: a rough set approach, in: Proceedings of International Workshop on Rough Sets and Soft Computing, 1994.
102. T. Knuutila, Inductive inference from positive data: from heuristic to characterising methods, in: L. Miclet, C. de la Higuera (Eds.), Proceedings of ICGI '96, Lectures Notes in Artificial Intelligence, vol. 1147, Springer, Berlin, Heidelberg, 1996, pp. 22-47.
103. D. Angluin Inference of reversible languages J. Assoc. Comput. Mach. 29 3 1982 741 765
104. P. García, and E. Vidal Inference of K-testable languages in the strict sense and applications to syntactic pattern recognition IEEE Trans. Pattern Anal. Mach. Intell. 12 9 1990 920 925
105. F. Denis, A. Lemay, A. Terlutte, Some classes of regular languages identifiable in the limit from positive data, in: Adriaans, et al. (Eds.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lectures Notes on Artificial Intelligence, vol. 2484, Springer, Berlin, Heidelberg, 2002, pp. 63-76.
106. H. Fernau, Identification of function distinguishable languages, in: H. Arimura, S. Jain, A. Sharma (Eds.), Proceedings of the 11th International Conference on Algorithmic Learning Theory (ALT 2000), Lecture Notes in Computer Science, vol. 1968, Springer, Berlin, Heidelberg, 2000, pp. 116-130.
107. M.O. Rabin Probabilistic automata Inform. and Control 6 1966 230 245
108. A. Paz Introduction to Probabilistic Automata 1971 Academic Press New York
109. G.D. Forney, The Viterbi algorithm, in: IEEE Proceedings, vol. 3, 1973, pp. 268-278.
110. F. Casacuberta, C. de la Higuera, Computational complexity of problems on probabilistic grammars and transducers, in: A. de Oliveira (Ed.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lectures Notes in Artificial Intelligence, vol. 1891, Springer, Berlin, Heidelberg, 2000, pp. 15-24.
111. L.E. Baum An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes Inequalities 3 1972 1 8
112. F. Casacuberta Some relations among stochastic finite state networks used in automatic speech recognition IEEE Trans. Pattern Anal. Mach. Intell. 12 7 1990 691 695
113. N. Abe, and M. Warmuth On the computational complexity of approximating distributions by probabilistic automata Mach. Learning J. 9 1992 205 260
114. M.J. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R.E. Schapire, and L. Sellie On the learnability of discrete distributions Proceedings of the 25th Annual ACM Symposium on Theory of Computing 1994 273 282
115. R.C. Carrasco, J. Oncina, Learning stochastic regular grammars by means of a state merging method, in: R.C. Carrasco, J. Oncina, ICGI'94 (Eds.), Grammatical Inference and Applications, Proceedings of ICGI '94, Lecture Notes in Artificial Intelligence, vol. 862, Springer, Berlin, Heidelberg, 1994, pp. 139-150.
116. D. Ron, Y. Singer, and N. Tishby On the learnability and usage of acyclic probabilistic finite automata Proceedings of COLT 1995 1995 31 40
117. A. Stolcke, S. Omohundro, Inducing probabilistic grammars by bayesian model merging, in: R.C. Carrasco, J. Oncina, (Eds.), Grammatical Inference and Applications, Proceedings of ICGI '94, Lecture Notes in Artificial Intelligence, vol. 862, Springer, Berlin, Heidelberg, 1994, pp. 106-118.
118. M. Young-Lai, and F.W. Tompa Stochastic grammatical inference of text database structure Mach. Learning J. 40 2 2000 111 137
119. T. Goan, N. Benson, and O. Etzioni A grammar inference algorithm for the world wide web Proceedings of AAAI Spring Symposium on Machine Learning in Information Access 1996 AAAI Press Stanford, CA
120. R.C. Carrasco Accurate computation of the relative entropy between stochastic regular grammars RAIRO, Theoret. Informatics Appl. 31 5 1997 437 444
121. F. Thollard, P. Dupont, and C. de la Higuera Probabilistic DFA inference using kullback-leibler divergence and minimality Proceedings of the 17th International Conference on Machine Learning 2000 Morgan Kaufmann San Francisco, CA 975 982
122. F. Thollard Improving probabilistic grammatical inference core algorithms with post-processing techniques Eighth International Conference on Machine Learning 2001 Morgan Kauffman Los Altos, CA 561 568
123. R.C. Carrasco, M. Forcada, L. Santamaria, Inferring stochastic regular grammars with recurrent neural networks, in: L. Miclet, C. de la Higuera (Eds.), Proceedings of ICGI '96, Lecture Notes in Artificial Intelligence, vol. 1147, Springer, Berlin, Heidelberg, 1996, pp. 274-281.
124. R.C. Carrasco, and J. Oncina Learning deterministic regular grammars from stochastic samples in polynomial time RAIRO, Theoret. Informatics Appl. 33 1 1999 1 20
125. C. de la Higuera, F. Thollard, Identification in the limit with probability one of stochastic deterministic finite automata, in: A. de Oliveira (Ed.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 1891, Springer, Berlin, Heidelberg, 2000, pp. 15-24.
126. C. de la Higuera, Learning stochastic finite automata from experts, in: V. Honavar, G. Slutski (Eds.), Grammatical Inference, Proceedings of ICGI '98, Lecture Notes in Artificial Intelligence, vol. 1433, Springer, Berlin, Heidelberg, 1998, pp. 79-89.
127. I.H. Witten, and T.C. Bell The zero frequency problem: Estimating the probabilities of novel events in adaptive test compression IEEE Trans. IT-37 4 1991 1085 1094
128. P. Dupont, J.-C. Amengual, Smoothing probabilistic automata: an error-correcting approach, in: A. de Oliveira (Ed.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 1891, Springer, Berlin, Heidelberg, 2000, pp. 51-62.
129. Y. Wang, and A. Acero Evaluation of spoken language grammar learning in the ATIS domain Proceedings of the International Conference on Acoustics, Speech, and Signal Processing 2002
130. Y. Sakakibara, M. Brown, R. Hughley, I. Mian, K. Sjolander, R. Underwood, and D. Haussler Stochastic context-free grammars for tRNA modeling Nucleic Acids Res. 22 1994 5112 5120
131. T.L. Booth, and R.A. Thompson Applying probability measures to abstract languages IEEE Trans. Comput. C-22 5 1973 442 450
132. J.A. Sánchez, and J.M. Benedí Consistency of stochastic context-free grammars from probabilistic estimation based on growth transformation IEEE Trans. Pattern Anal. Mach. Intell. 19 9 1997 1052 1055
133. A. Stolcke An efficient probabilistic context-free parsing algorithm that computes prefix probabilities Comput. Linguist. 21 2 1995 165 201
134. J.K. Baker Trainable grammars for speech recognition D.H. Klatt J.J. Wolf Speech Communication Papers for the 97th Meeting of the Acoustical Society of America 1979 547 550
135. K. Lari, and S.J. Young The estimation of stochastic context free grammars using the inside-outside algorithm Comput. Speech Lang. 4 1990 35 56
136. D.-Y. Ra, and G.C. Stockman A new one pass algorithm for estimating stochastic context-free grammars Inf. Process. Lett. 72 1999 37 45
137. J.R. Rico-Juan, J. Calera-Rubio, R.C. Carrasco, Stochastic k-testable tree languages and applications, in: P. Adriaans, et al. (Eds.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 2484, Springer, Berlin, Heidelberg, 2002, pp. 199-212.
138. T. Kammeyer, and R.K. Belew Stochastic context-free grammar induction with a genetic algorithm using local search R.K. Belew M. Vose Foundations of Genetic Algorithms IV 1996 Morgan Kaufmann University of San Diego, CA, USA
139. D. Angluin Finding patterns common to a set of strings Conference Record of the 11th Annual ACM Symposium on Theory of Computing 1979 ACM Press New York, NY, USA 130 141
140. S.A. Goldman, S.S. Kwek, On learning unions of pattern languages and tree patterns, in: O. Watanabe, T. Yokomori (Eds.), Proceedings of the 10th International Conference on Algorithmic Learning Theory (ALT 1999), Lecture Notes in Computer Science, vol. 1720, Springer, Berlin, 1999, pp. 347-363.
141. A. Mitchell, T. Scheffer, A. Sharma, F. Stephan, The VC-dimension of subclasses of pattern languages, in: O. Watanabe, T. Yokomori (Eds.), Proceedings of the 10th International Conference on Algorithmic Learning Theory (ALT 1999), Lecture Notes in Computer Science, vol. 1720, Springer, Berlin, 1999, pp. 93-105.
142. T. Koshiba Typed pattern languages and their learnability Proceedings of Euro COLT '95, Lecture Notes in Artificial Intelligence vol. 904 1995 Springer Berlin 367 379
143. T. Erlebach, P. Rossmanith, H. Stadtherr, A. Steger, and T. Zeugmann Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries M. Li A. Maruoka Proceedings of ALT '97, Lecture Notes in Computer Science vol. 1316 1997 Springer Berlin, Heidelberg 260 276
144. K.P. Jantke, and S. Lange Case-based representation and learning of pattern languages Theoret. Comput. Sci. 137 1 1995 25 51
145. P. Rossmanith, and T. Zeugmann Stochastic finite learning of the pattern languages Mach. Learning J. 44 1 2001 67 91
146. M. Kanazawa Learnable Classes of Categorial Grammars 1998 CSLI Publications Stanford, CA
147. I. Tellier Meaning helps learning syntax V. Honavar G. Slutski Grammatical Inference, Proceedings of ICGI '98, Lecture Notes in Artificial Intelligence vol. 1433 1998 Springer Berlin, Heidelberg 25 36
148. A. Foret, Y.L. Nir, On limit points for some variants of rigid Lambek grammars, in: P. Adriaans, et al. (Eds.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 2484, Springer, Berlin, Heidelberg, 2002, pp. 106-119.
149. C.C Florêncio, Consistent identification in the limit of rigid grammars from strings is NP-hard, in: P. Adriaans, et al. (Eds.), Grammatical Inference: Algorithms and Applications Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 2484, Springer, Berlin, Heidelberg, 2002, pp. 49-62.
150. T. Dean, K. Basye, L. Kaelbling, E. Kokkevis, O. Maron, D. Angluin, and S. Engelson Inferring finite automata with stochastic output functions and an application to map learning W. Swartout Proceedings of the 10th National Conference on Artificial Intelligence 1992 MIT Press San Jose, CA 208 214
151. R.L. Rivest, and R.E. Schapire Inference of finite automata using homing sequences Inform. and Comput. 103 1993 299 347
152. A. Rieger Inferring probabilistic automata from sensor data for robot navigation M. Kaiser Proceedings of the MLnet Familiarization Workshop and Third European Workshop on Learning Robots 1995 65 74
153. D. Luzeaux Machine learning applied to the control of complex systems Proceedings of the Eighth International Conference on Artificial Intelligence and Expert Systems Applications 1996 Paris France
154. S. Lucas, E. Vidal, A. Amari, S. Hanlon, and J.C. Amengual A comparison of syntactic and statistical techniques for off-line OCR R.C. Carrasco J. Oncina Grammatical Inference and Applications, Proceedings of ICGI '94, Lecture Notes in Artificial Intelligence vol. 862 1994 Springer Berlin, Heidelberg 168 179
155. H. Ney Stochastic grammars and pattern recognition P. Laface R.D. Mori Proceedings of the NATO Advanced Study Institute 1992 Springer Berlin 313 344
156. P. Adriaans, Language learning from a categorical perspective, Ph.D. Thesis, Universiteit van Amsterdam, 1992.
157. P. Adriaans, M. Vervoort, The EMILE 4.1 grammar induction toolbox, in: P. Adriaans, et al. (Eds.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 2484, Springer, Berlin, Heidelberg, 2002, pp. 293-295.
158. M. Mohri Finite-state transducers in language and speech processing Comput. Linguist. 23 3 1997 269 311
159. M. Mohri, F.C.N. Pereira, and M. Riley The design principles of a weighted finite-state transducer library Theoret. Comput. Sci. 231 1 2000 17 32
160. F. Jelinek Statistical Methods for Speech Recognition 1998 The MIT Press Cambridge, MA
161. N. Morgan, H. Bourlard, Continuous speech recognition: an introduction to the hybrid HMM/connectionnist approach, IEEE Signal Process. Mag. 12.
162. P. García, E. Segarra, E. Vidal, and I. Galiano On the use of the morphic generator grammatical inference (mggi) methodology in automatic speech recognition Int. J. Pattern Recogn. Artif. Intell. 4 1994 667 685
163. J.-C. Amengual, A. Sanchis, E. Vidal, and J.-M. Benedí Language simplification through error-correcting and grammatical inference techniques Mach. Learning J. 44 1 2001 143 159
164. Y. Wang, and A. Acero Grammar learning for spoken language understanding Proceedings of the IEEE Workshop on Automatic Speech Recognition and Understanding 2001 Madonna di Campiglio
165. J. Oncina, P. García, and E. Vidal Learning subsequential transducers for pattern recognition interpretation tasks IEEE Trans. Pattern Anal. Mach. Intell. 15 5 1993 448 458
166. J. Oncina, and M.A. Varó Using domain information during the learning of a subsequential transducer L. Miclet C. de la Higuera Proceedings of ICGI '96, Lecture Notes in Artificial Intelligence vol. 1147 1996 Springer Berlin, Heidelberg 301 312
167. J. Oncina The data driven approach applied to the OSTIA algorithm V. Honavar G. Slutski Grammatical Inference, Proceedings of ICGI '98, Lecture Notes in Artificial Intelligence vol. 1433 1998 Springer Berlin, Heidelberg 50 56
168. J.M. Vilar Improve the learning of subsequential transducers by using alignments and dictionaries A. de Oliveira Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence vol. 1891 2000 Springer Berlin, Heidelberg 298 312
169. J.C. Amengual, J.M. Benedí, F. Casacuberta, A. Castaño, A. Castellanos, V.M. Jiménez, D. Llorens, A. Marzal, M. Pastor, F. Prat, E. Vidal, and J.M. Vilar The EuTrans-I speech translation system Mach. Translation 15 1 2001 75 103
170. A. Brazma, I. Jonassen, J. Vilo, and E. Ukkonen Pattern discovery in biosequences V. Honavar G. Slutski Grammatical Inference, Proceedings of ICGI '98, Lecture Notes in Artificial Intelligence vol. 1433 1998 Springer Berlin, Heidelberg 257 270
171. J.T.-L. Wang, S. Rozen, B.A. Shapiro, D. Shasha, Z. Wang, and M. Yin New techniques for DNA sequence classification J. Comput. Biol. 6 2 1999 209 218
172. N. Abe, and H. Mamitsuka Predicting protein secondary structure using stochastic tree grammars Mach. Learning J. 29 1997 275 301
173. I. Salvador, and J.-M. Benedí RNA modeling by combining stochastic context-free grammars and n -gram models Int. J. Pattern Recogn. Artif. Intell. 16 3 2002 309 316
174. R.B. Lyngsø, C.N.S. Pedersen, and H. Nielsen Metrics and similarity measures for hidden Markov models Proceedings of ISMB'99 1999 178 186
175. R.B. Lyngsø, C.N.S. Pedersen, Complexity of comparing hidden Markov models, in: Proceedings of ISAAC '01, Lecture Notes in Computer Science, vol. 2223, Springer, Berlin, Heidelberg, 2001, pp. 416-428.
176. A. Jagota, R. B. Lyngsø, C.N.S. Pedersen, Comparing a hidden Markov model and a stochastic context-free grammar, in: Proceedings of WABI '01, Lecture Notes in Computer Science, vol. 2149, Springer, Berlin, Heidelberg, 2001, pp. 69-74.
177. S. Muggleton Inductive Logic Programming The MIT Encyclopedia of the Cognitive Sciences (MITECS) 1999 MIT Press Cambridge, MA
178. H. Boström Theory-guided induction of logic programs by inference of regular languages 13th International Conference on Machine Learning 1996 Morgan Kaufmann Los Altos, CA
179. H. Boström Predicate invention and learning from positive examples only C. Nédellec C. Rouveirol 10th European Conference on Machine Learning, Lecture Notes in Artificial Intelligence vol. 1398 1998 Springer Berlin 226 237
180. M. Bernard, and C. de la Higuera Apprentissage de programmes logiques par inférence grammaticale Rev. d'Intell. Artif. 14 3 2001 375 396
181. A. Habrard, M. Bernard, F. Jacquenet, Generalized stochastic tree automata for multi-relational data mining, in: P. Adriaans, et al., (Eds.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 2484, Springer, Berlin, Heidelberg, 2002, pp. 120-133.
182. H. Ahonen, H. Mannila, and E. Nikunen Forming grammars for structured documents: An application of grammatical inference R.C. Carrasco J. Oncina Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '94,
183. H. Fernau Learning XML grammars P. Perner Machine Learning and Data Mining in Pattern Recognition MLDM'01, Lecture Notes in Computer Science vol. 2123 2001 Springer Berlin 73 87
184. B. Chidlovskii, Schema extraction from xml: A grammatical inference approach, in: M. Lenzerini, D. Nardi, W. Nutt, D. Suciu (Eds.), Proceedings of the Eighth International Workshop on Knowledge Representation meets Databases (KRDB 2001), vol. 45 CEUR Workshop Proceedings, 2001.
185. H. Arimura, H. Sakamoto, S. Arikawa, Efficient learning of semi-structured data from queries, in: N. Abe, et al. (Eds.), Proceedings of ALT 2001, Lecture Notes in Computer Science, vol. 2225, Springer, Berlin, Heidelberg, 2001, pp. 315-331.
186. D. Carmel, and S. Markovitch Model-based learning of interaction strategies in multi-agent systems J. Exp. Theoret. Artif. Intell. 10 3 1998 309 332
187. D. Carmel, and S. Markovitch Exploration strategies for model-based learning in multiagent systems Auton. Agents Multi-agent Syst. 2 2 1999 141 172
188. C.L. Giles, S. Lawrence, and A. Tsoi Noisy time series prediction using recurrent neural networks and grammatical inference Mach. Learning J. 44 1 2001 161 183
189. J. Borges, and M. Levene Data mining of user navigation patterns B. Masand M. Spiliopoulou Web Usage Mining and User Profiling, Lecture Notes in Computer Science vol. 1836 2000 Springer Berlin 92 111
190. B. Chidlovskii, J. Ragetli, M. de Rijke, Wrapper generation via grammar induction, in: Machine Learning: ECML 2000, 11th European Conference on Machine Learning, vol. 1810, Springer, Berlin, 2000, pp. 96-108.
191. B. Chidlovskii Wrapper generation by k -reversible grammar induction Proceedings of the Workshop on Machine Learning and Information Extraction 2000
192. P. Cruz, and E. Vidal Learning regular grammars to model musical style: Comparing different coding schemes V. Honavar G. Slutski Grammatical Inference, Proceedings of ICGI '98, Lecture Notes in Artificial Intelligence vol. 1433 1998 Springer Berlin, Heidelberg 211 222
193. M. Sebban, and J.-C. Janodet On state merging in grammatical inference: a statistical approach for dealing with noisy data Proceedings of ICML 2003
194. C. Kermorvant, C. de la Higuera, Learning languages with help, in: P. Adriaans, et al. (Eds.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 2484, Springer, Berlin, Heidelberg, 2002, pp. 161-173.
195. A. Cano, J. Ruiz, P. García, Inferring subclasses of regular languages faster using RPNI and forbidden configurations, in: P. Adriaans, et al. (Eds.), Grammatical Inference: Algorithms and Applications, Proceedings of ICGI '00, Lecture Notes in Artificial Intelligence, vol. 2484, Springer, Berlin, Heidelberg, 2002, pp. 28-36.
196. D. McAllester, R. Schapire, Learning theory and language modeling, Exploring Artificial Intelligence in the New Millenium, Morgan Kaufmann, Los Altos, CA, 2002.