Recent advances of grammatical inference

Theoretical Computer Science

Volumn 185, Issue 1, 1997, Pages 15-45

  Sakakibara, Yasubumi ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; FINITE AUTOMATA; LEARNING SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS; NEURAL NETWORKS;

GRAMMATICAL INFERENCE;

INFERENCE ENGINES;

EID: 0031249196     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00014-5     Document Type: Article

References (69)

1. N. Abe, H. Mamitsuka, A new method for predicting protein secondary structures based on stochastic tree grammars, in: Proc. 11th Internat. Conf. on Machine Learning, Morgan Kaufmann, Los Altos, CA, 1994, pp. 3-11.
2. N. Abe, M.K. Warmuth, On the computational complexity of approximating distributions by probabilistic automata, Machine Learning 9 (1992) 205-260.
3. D.W. Aha, D. Kíbler, M.K. Albert, Instance-based learning algorithms, Machine Learning 6 (1991) 37-66.
4. A.V. Aho, J.D. Ullman, The Theory of Parsing, Translation and Compiling, vol. I: Parsing, Prentice-Hall, Englewood Cliffs, NJ, 1972.
5. D. Angluin, Finding patterns common to a set of strings, J. Comput. System Sci. 21 (1980) 46-62.
6. D. Angluin, Inductive inference of formal languages from positive data, Inform. Control 45 (1980) 117-135.
7. D. Angluin, A note on the number of queries needed to identify regular languages, Inform. Control 51 (1981) 76-87.
8. D. Angluin, Inference of reversible languages, J. ACM 29 (1982) 741-765.
9. D. Angluin, Learning regular sets from queries and counter-examples, Inform. Comput. 75 (1987) 87-106.
10. D. Angluin, Queries and concept learning, Machine Learning 2 (1988) 319-342.
11. D. Angluin, Negative results for equivalence queries, Machine Learning 5 (1990) 121-150.
12. D. Angluin, Computational learning theory: survey and selected bibliography, in: Proc. 24th Ann. ACM Symp. on Theory of Computing, ACM Press, New York, 1992, pp. 351-369.
13. D. Angluin, M. Kharitonov, When won't membership queries help? in: Proc. 23rd Ann. ACM Symp. on Theory of Computing, ACM Press, New York, 1991, pp. 444-454.
14. D. Angluin, C.H. Smith, Inductive inference: theory and methods, ACM Comput. Surveys 15(3) (1983) 237-269.
15. S. Arikawa, T. Shinohara, A. Yamamoto, Elementary formal systems as a unifying framework for language learning, in: Proc. 2nd Workshop on Computational Learning Theory, Morgan Kaufmann, 1989, pp. 312-327.
16. J.K. Baker, Trainable grammars for speech recognition, Speech Communication Papers for the 97th Meeting of the Acoustical Society of America, 1979, pp. 547-550.
17. A. Brāzma, K. Čerāns, Efficient learning of regular expressions from good examples, in: Proc. 4th Internat. Workshop on Analogical and Inductive Inference (AII'94), Lecture Notes in Artificial Intelligence, Vol. 872, Springer, Berlin, 1994, pp. 76-90.
18. A. Burago, Learning structurally reversible context-free grammars from queries and counterexamples in polynomial time, in: Proc. 7th Workshop on Computational Learning Theory (COLT'93), ACM Press, New York, 1994, pp. 140-146.
19. R.C. Carrasco, J. Oncina (Eds.) Proc. Internat. Coll. on Grammatical Inference (ICGI-94), Lecture Notes in Artificial Intelligence, Vol. 862, Springer, Berlin, 1994.
20. S. Crespi-Reghizzi, An effective model for grammar inference, in: B. Gilchrist (Ed.), Information Processing 71, Elsevier, Amsterdam, 1972, pp. 524-529.
21. P. Dupon, Regular grammatical inference from positive and negative samples by genetic search: the GIG method, in: Proc. 2nd Internat. Coll. on Grammatical Inference (ICGI-94), Lecture Notes in Artificial Intelligence, Vol. 862, Springer, Berlin, 1994, pp. 236-245.
22. J.L. Elman, Distributed representations, simple recurrent networks, and grammatical structure, Machine Learning 7 (1991) 195-225.
23. A.F. Fahmy, A.W. Biermann, Synthesis of real time acceptors, J. Symbolic Comput. 15 (1993) 807-842.
24. C.L. Giles, G.Z. Sun, H.H. Chen, Y.C. Lee, D. Chen, Higher order recurrent networks & grammatical inference, in: Advances in Neural Information Processing Systems, Vol. 2, Morgan Kaufmann, Los Altos, CA, 1990, pp. 380-387.
25. C. Globig, K.P. Jantke, S. Lange, Y. Sakakibara, On case-based learnability of languages, New Generation Comput. 15 (1997) 59-83.
26. C. Globig, S. Lange, On case-based representability and learnability of languages, in: Proc. 4th Workshop on Analogical and Inductive Inference (AII'94), Lecture Notes in Artificial Intelligence Vol. 872, Springer, Berlin, 1994, pp. 106-120.
27. E.M. Gold, Language identification in the limit, Inform. Control 10 (1967) 447-474.
28. E.M. Gold, Complexity of automaton identification from given data, Inform. Control 37 (1978) 302-320.
29. M. Golea, M. Matsuoka, Y. Sakakibara, Simple recurrent neural networks as probability models, in: Proc. 4th Internat. Symp. on Artificial Intelligence and Mathematics (AI/MATH-96), 1996, pp. 68-71.
30. J. Hertz, A. Krogh, R.G. Palmer, Introduction to the Theory of Neural Computation, Addison-Wesley, Reading, MA, 1991.
31. L. Hunter, Artificial Intelligence and Molecular Biology, AAAI Press/MIT Press, New York, 1993.
32. H. Ishizaka, Polynomial time learnability of simple deterministic languages, Machine Learning 5 (1990) 151-164.
33. K.P. Jantke, S. Lange, Case-based representation and learning of pattern languages, Theoret. Comput. Sci. 137 (1995) 25-51.
34. T. Koshiba, Typed pattern languages and their learnability, in: Proc. 2nd European Conf. on Computational Learning Theory (EuroCOLT'95), Lecture Notes in Artificial Intelligence, Vol. 904, Springer, Berlin, 1995, pp. 367-379.
35. A. Krogh, M. Brown, I.S. Mian, K. Sjölander, D. Haussler, Hidden Markov models in computational biology: Applications to protein modeling, J. Molecular Biol. 235 (1994) 1501-1531.
36. P.D. Laird, A survey of computational learning theory, in: R.B. Banerji (Ed.), Formal Techniques in Artificial Intelligence - A Sourcebook, Elsevier, Amsterdam, 1990, pp. 173-215.
37. K. Lari, S.J. Young, The estimation of stochastic context-free grammars using the inside-outside algorithm, Comput. Speech Language 4 (1990) 35-56.
38. L.S. Levy, A.K. Joshi, Skeletal structural descriptions, Inform. Control 39 (1978) 192-211.
39. E. Makinen, On the structural grammatical inference problem for some classes of context-free grammars, Inform. Process. Lett. 42 (1992) 193-199.
40. L. Miclet, Grammatical inference, in: H. Bunke, A. Sanfeliu (Eds.), Syntactic and Structural Pattern Recognition - Theory and Applications, World Scientific, Singapore, 1986, pp. 237-290.
41. L. Miclet, C. de la Higuera (Eds.), Proc. 3rd Internat. Coll. on Grammatical Inference (ICGI-96), Lecture Notes in Artificial Intelligence, Vol. 1147, Springer, Berlin, 1996.
42. S. Miyano, A. Shinohara, T. Shinohara, Which classes of elementary formal systems are polynomial-time learnable? in: Proc. 2nd Workshop on Algorithmic Learning Theory (ALT'91), Japanese Society for Artificial Intelligence, Ohmsha, 1991, pp. 139-150.
43. J. Oncina, P. Garcia, E. Vidal, Learning subsequential transducers for pattern recognition interpretation tasks, IEEE Trans. Pattern Anal. Machine Intelligence 15 (1993) 448-458.
44. F. Pereira, Y. Schabes, Inside-outside reestimation for partially bracketed corpora, in: Proc. 30th Ann. Meeting of the Association for Computational Linguistics, 1992, pp. 128-135.
45. L. Pitt, Inductive inference, DFAs, and computational complexity, in: Proc. AII-89 Workshop on Analogical and Inductive Inference, Lecture Notes in Computer Science, Vol. 397, Springer, Berlin, 1989, pp. 18-44.
46. L. Pitt, M.K. Warmuth, The minimum consistent DFA problem cannot be approximated within any polynomial, in: Proc. 21st Ann. ACM Symp. on Theory of Computing, ACM Press, New York, 1989.
47. L.R. Rabiner, A tutorial on hidden Markov models and selected applications in speech recognition, Proc IEEE 77(2) (1989) 257-286.
48. R.L. Rivest, Learning decision lists, Machine Learning 2 (1987) 229-246.
49. D. Ron, R. Rubinfeld, Learning fallible deterministic finite automata, Machine Learning 18 (1995) 149-185.
50. Y. Sakakibara, Learning context-free grammars from structural data in polynomial time, Theoret. Comput. Sci. 76 (1990) 223-242.
51. Y. Sakakibara, On learning from queries and counterexamples in the presence of noise, Inform. Processing Lett. 37 (1991) 279-284.
52. Y. Sakakibara, Efficient learning of context-free grammars from positive structural examples, Inform. Comput. 97 (1992) 23-60.
53. Y. Sakakibara, M. Brown, R. Hughey, I.S. Mian, K. Sjolander, R.C. Underwood, D. Haussler, Stochastic context-free grammars for tRNA modeling, Nucleic Acids Res. 22 (1994) 5112-5120.
54. Y. Sakakibara, M. Golea, Simple recurrent networks as generalized hidden markov models with distributed representations, in: Proc. IEEE Internat. Conf. on Neural Networks (ICNN'95), IEEE Computer Society Press, New York, 1995, pp. 979-984.
55. Y. Sakakibara, K.P. Jantke, S. Lange, Learning languages by collecting cases and tuning parameters, in: Proc. 5th Internat. Workshop on Algorithmic Learning Theory (ALT'94), Lecture Notes in Artificial Intelligence, Vol. 872, Springer, Berlin, 1994, pp. 532-546.
56. Y. Sakakibara, R. Siromoney, A noise model on learning sets of strings, in: Proc. 5th Workshop on Computational Learning Theory (COLT'92), ACM Press, New York, 1992, pp. 295-302.
57. D.B. Searls, The linguistics of DNA, Amer. Scientist 80 (1992) 579-591.
58. T. Shinohara, Rich classes inferable from positive data: length-bounded elementary formal systems, Inform. Comput. 108 (1994) 175-186.
59. A. Stolcke, S. Omohundro, Inducing probabilistic grammars by bayesian model merging, in Proc. 2nd Internat. Coll. on Grammatical Inference (ICGI-94) Lecture Notes in Artificial Intelligence, Vol. 862, Springer, Berlin, 1994, pp. 106-118.
60. Y. Takada, Grammatical inference for even linear languages based on control sets, Inform. Processing Lett. 28 (1988) 193-199.
61. Y. Takada, A hierarchy of language families learnable by regular language learners, Inform. Comput. 123 (1995) 138-145.
62. B.A. Trakhtenbrot, J. Barzdin, Finite Automata - Behavior and Synthesisa, Fundamental Studies in Computer Science, North-Holland, Amsterdam, 1973.
63. L.G. Valiant, A theory of the learnable, Comm ACM 27 (1984) 1134-1142.
64. M.S. Waterman, Sequence alignments, in: M.S. Waterman (Ed.), Mathematical Methods for DNA Sequences, CRC Press, Boca Raton, FL, 1989.
65. R. Wiehagen, From inductive inference to algorithmic learning theory, New Generation Comput. 12 (1994) 321-335.
66. T. Yokomori, Polynomial-time learning of very simple grammars from positive data, in: Proc. 4th Workshop on Computational Learning Theory (COLT'91), Morgan Kaufmann, Los Altos, CA, 1991, pp. 213-227.
67. T. Yokomori, Learning nondeterministic finite automata from queries and counterexamples, in: Furukawa, Michie, Muggleton (Eds.), Machine Intelligence 13, Oxford Univ. Press, Oxford, 1994, pp. 169-189.
68. T. Yokomori, On polynomial-time learnability in the limit of strictly deterministic automata, Machine Learning 19 (1995) 153-179.
69. T. Zeugmann, S. Lange, A guided tour across the boundaries of learning recursive languages, in: K.P. Jantke, S. Lange (Eds.), Algorithmic Learning for Knowledge-Based Systems, Lecture Notes in Artificial Intelligence, Vol. 961, Springer, Berlin, 1995, pp. 193-262.