The Synthesis of Language Learners

Information and Computation

Volumn 152, Issue 1, 1999, Pages 16-43

  Baliga, Ganesh R ^a   Case, John ^b   Jain, Sanjay ^c  

^a The College of New Jersey   (United States)

^b UNIVERSITY OF DELAWARE   (United States)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345867476     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2782     Document Type: Article

References (84)

1. Ambainis, A. (1996), Probabilistic PFIN-type learning, in "Proceedings of the Ninth Annual Conference on Computational Learning Theory," pp. 157-168, Assoc. Comput. Mach., New York.
2. Angluin, D. (1980a), Finding patterns common to a set of strings, J. Comput. System Sci. 21, 46-62.
3. Angluin, D. (1980b), Inductive inference of formal languages from positive data, Inform. and Control 45, 117-135.
4. Angluin, D. (1982), Inference of reversible languages, J. Assoc. Comput. Mach. 29, 741-765.
5. Arikawa, S., Shinohara, T., and Yamamoto, A. (1992), Learning elementary formal systems, Theoret. Comput. Sci. 95, 97-113.
6. Arimura, H., and Shinohara, T. (1994), Inductive inference of Prolog programs with linear data dependency from positive data, in "Proc. Information Modelling and Knowledge Bases V" (H. Jaakkola, H. Kangassalo, T. Kitahashi, and A. Markus, Eds.), pp. 365-375, IOS Press, Burke, VA.
7. Baliga, G., and Case, J. (1993), Learnability: Admissible, co-finite and hypersimple languages, in "Proceedings of the 20th International Colloquium on Automata, Languages and Programming, Lund, Sweden" (A. Lingas, R. Karlsson, and S. Carlsson, Eds.), Lecture Notes in Computer Science, Vol. 700, pp. 289-300, Springer-Verlag, New York/Berlin.
8. Baliga, G., Case, J., and Jain, S. (1995), Language learning with some negative information, J. Comput. System Sci. 51(5), 273-285.
9. Baliga, G., Case, J., and Jain, S. (1996), Synthesizing enumeration techniques for language learning, in "Proceedings of the Ninth Annual Conference on Computational Learning Theory," pp. 169-180, Assoc. Comput. Mach., New York.
10. Bārzdiņš, J. (1974), Two theorems on the limiting synthesis of functions, in "Theory of Algorithms and Programs," Vol. 1, pp. 82-88, Latvian State University. [Russian]
11. Bārzdiņš, J., and Freivalds, R. (1972), On the prediction of general recursive functions, Soviet Math. Dokl. 13, 1224-1228.
12. Berwick, R. (1985), "The Acquisition of Syntactic Knowledge," MIT Press, Cambridge, MA.
13. Blum, L., and Blum, M. (1975), Toward a mathematical theory of inductive inference, Information and Control 28, 125-155.
14. Blum, M. (1967), A machine-independent theory of the complexity of recursive functions, J. Assoc. Comput. Mach. 14, 322-336.
15. Case, J. (1974), Periodicity in generations of automata, Math. Systems Theory 8, 15-32.
16. Case, J. (1986), Learning machines, in "Language Learning and Concept Acquisition" (W. Demopoulos and A. Marras, Eds.), Ablex, Norwood, NJ.
17. Case, J. (1998), The power of vacillation in language learning, SIAM J. Comput., to appear. [Preliminary version appeared in "COLT 88"]
18. Case, J., Jain, S., and Sharma, A. (1997), Synthesizing noise-tolerant language learners, in "Algorithmic Learning Theory: Eighth International Workshop (ALT '97)" (M. Li and A. Maruoka, Eds.), Lecture Notes in Artificial Intelligence, Vol. 1316, pp. 228-243,
19. Case, J., Jain, S., and Stephan, F. (1996), Vacillatory and BC learning on noisy data, in "Seventh International Workshop (ALT '96)" (S. Arikawa and A. Sharma, Eds.), Lecture Notes in Artificial Intelligence, Vol. 1160, pp. 285-298, Springer-Verlag, New York/Berlin.
20. Case, J., Kaufmann, S., Kinber, E., and Kummer, M. (1997), Learning recursive functions from approximations, J. Comput. System Sci. 55, 183-196. [Special issue for "EuroCOLT'95"]
21. Case, J., and Lynes, C. (1982), Machine inductive inference and language identification, in "Proceedings of the 9th International Colloquium on Automata, Languages and Programming" (M. Nielsen and E. M. Schmidt, Eds.), Lecture Notes in Computer Science, Vol. 140, pp. 107-115, Springer-Verlag, New York/Berlin.
22. Case, J., and Smith, C. (1983), Comparison of identification criteria for machine inductive inference, Theoret. Comput. Sci. 25, 193-220.
23. Daley, R. (1985), Inductive inference hierarchies: Probabilistic vs. pluralistic, in "Mathematical Methods of Specification and Synthesis of Software Systems, Wendisch-Rietz, GDR" (W. Bibel and K. Jantke, Eds.), Lecture Notes in Computer Science, Vol. 215, pp. 73-82, Springer-Verlag.
24. Daley, R. (1988), Transformation of probabilistic learning strategies into deterministic learning strategies, in "Proceedings of the Workshop on Computational Learning Theory" (D. Haussler and L. Pitt, Eds.), pp. 157-163, Morgan Kaufmann, San Mateo, CA.
25. Daley, R., Kalyanasundaram, B., and Velauthapillai, M. (1992), Breaking the probability 1/2 barrier in FIN-type learning, in "Proceedings of the Fifth Annual Workshop on Computational Learning Theor," pp. 203-217, Assoc. Comput. Mach., New York.
26. Daley, R., Pitt, L., Velauthapillai, M., and Will, T. (1991), Relations between probabilistic and team one-shot learners, in "Proceedings of the Fourth Annual Workshop on Computational Learning Theory" (L. Valiant and M. Warmuth, Eds.), pp. 228-239, Morgan Kaufmann, San Mateo, CA.
27. de Jongh, D., and Kanazawa, M. (1996), Angluin's thoerem for indexed families of r.e. sets and applications, in "Proceedings of the Ninth Annual Conference on Computational Learning Theory," pp. 193-204, Assoc. Comput. Mach., New York.
28. Freivalds, R. (1979a), Finite identification of general recursive functions by probabilistic strategies, in "Proceedings of the Conference on Fundamentals of Computation Theory," pp. 138-145, Akademie-Verlag, Berlin.
29. Freivalds, R. (1979b), On the principle capabilities of probabilistic algorithms in inductive inference, Semiotika Inform. 12, 137-140.
30. Freivalds, R. (1985), Recursiveness of the enumerating functions increases the inferrability of recursively enumerable sets, Bull. European Assoc. Theoret. Comput. Sci. 27, 35-40.
31. Fulk, M. (1985), "A Study of Inductive Inference Machines," Ph.D. thesis, SUNY/Buffalo.
32. Fulk, M. (1990a), Prudence and other conditions on formal language learning, Inform, and Comput. 85, 1-11.
33. Fulk, M. (1990b), Robust separations in inductive inference, in "31st Annual IEEE Symposium on Foundations of Computer Science," pp. 405-410, IEEE Comput. Soc. Press, New York.
34. Gleitman, L. (1986), Biological dispositions to learn language, in "Language Learning and Concept Acquisition" (W. Demopoulos and A. Marras, Eds.), Ablex, Norwood, NJ.
35. Gold, E. M. (1967), Language identification in the limit, Inform. and Control 10, 447-474.
36. Hopcroft, J., and Ullman, J. (1979), "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA.
37. Jantke, K. (1979), Automatic synthesis of programs and inductive inference of functions, in "Int. Conf. Fundamentals of Computations Theory," pp. 219-225, Akademie-Verlag, Berlin.
38. Kapur, S. (1991), "Computational Learning of Languages," Ph.D. thesis, Cornell University.
39. Kapur, S., and Bilardi, G. (1992), Language learning without overgeneralization, in "Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science" (A. Finkel and M. Jantzen, Eds.), Lecture Notes in Computer Science, Vol. 577, pp. 245-256, Springer-Verlag.
40. Kapur, S., Lust, B., Harbert, W., and Martohardjono, G. (1993), Universal grammar and learnability theory: The case of binding domains and the 'subset principle', in "Knowledge and Language, Volume I" (E. Reuland and W. Abraham, Eds.), pp. 185-216, Kluwer, Dordrecht.
41. Kearns, M. and Vazirani, U. (1994), "An Introduction to Computational Learning Theory," MIT Press, Cambridge, MA.
42. Kinber, E. and Zeugmann, T. (1991), One-sided error probabilistic inductive inference and reliable frequency identification, Inform, and Comput. 92, 253-284.
43. Kirsh, D. (1992), PDP learnability and innate knowledge of language, in "Connectionism: Theory and Practice" (S. Davis, Ed.), pp. 297-322, Oxford Univ. Press, New York.
44. Lange, S., and Zeugmann, T. (1992), Types of monotonic language learning and their characterization, in "Proceedings of the Fifth Annual Workshop on Computational Learning Theory," pp. 377-390, Assoc. Comput. Mach., New York.
45. Lange, S. and Zeugmann, T. (1993), Language learning in dependence on the space of hypotheses, in "Proceedings of the Sixth Annual Conference on Computational Learning Theory," pp. 127-136, Assoc. Comput. Mach., New York.
46. Lavarač, N., and Džeroski, S. (1994), "Inductive Logic Programming," Ellis Horwood, New York.
47. Machtey, M., and Young, P. (1978), "An Introduction to the General Theory of Algorithms," North Holland, New York.
48. Manzini, R., and Wexler, K. (1987), Parameters, binding theory and learnability, Linguistic Inquiry 18, 413-444.
49. Mitchell, T. (1997), "Machine Learning," McGraw-Hill, New York.
50. Muggleton, S., and Raedt, L. D. (1994), Inductive logic programming: Theory and methods, J. Logic Programm. 19/20, 669-679.
51. Mukouchi, Y. (1992), Characterization of finite identification, in "Analogical and Inductive Inference, Proceedings of the Third International Workshop" (K. Jantke, Ed.), pp. 260-267.
52. Nix, R. (1983), "Editing by Examples," Technical Report 280, Department of Computer Science, Yale University, New Haven, CT.
53. Osherson, D., Stob, M., and Weinstein, S. (1982), Ideal learning machines, Cognitive Science 6, 277-290.
54. Osherson, D., Stob, M., and Weinstein, S. (1984), Learning theory and natural language, Cognition 17, 1-28.
55. Osherson, D., Stob, M., and Weinstein, S. (1986b), An analysis of a learning paradigm, in "Language Learning and Concept Acquisition" (W. Demopoulos and A. Marras, Eds.), Ablex, Norwood, NJ.
56. Osherson, D., Stob, M., and Weinstein, S. (1986a), "Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists," MIT Press, Cambridge, MA.
57. Osherson, D., Stob, M., and Weinstein, S. (1988), Synthesising inductive expertise, Inform, and Comput. 77, 138-161.
58. Osherson, D., and Weinstein, S. (1982a), Criteria of language learning, Inform, and Control 52, 123-138.
59. Osherson, D., and Weinstein, S. (1982b), A note on formal learning theory, Cognition 11, 77-88.
60. Pinker, S. (1979), Formal models of language learning, Cognition 7, 217-283.
61. Pitt, L. (1984), A characterization of probabilistic inference, Ph.D. thesis, Yale University.
62. Pitt, L. (1989), Probabilistic inductive inference, J. Assoc. Comput. Mach. 36, 383-433.
63. Pitt, L., and Smith, C. (1988), Probability and plurality for aggregations of learning machines, Inform. and Comput. 77, 77-92.
64. Pour-El, M., and Howard, W. (1964), A structural criterion for recursive enumeration without repetition, Z. J. Math. Logik Grundl. Math. Bd. 10, 105-114.
65. Pour-El, M., and Putnam, H. (1965), Recursively enunumerable classes and their application to recursive sequences of formal theories, Arch. Math. Log. Grundl. 8, 104-121.
66. Rogers, H. (1958), Gödel numberings of partial recursive functions, J. Symbolic Logic 23, 331-341.
67. Rogers, H. (1967), "Theory of Recursive Functions and Effective Computability," McGraw-Hill, New York, [Reprinted, MIT Press, Cambridge, MA, 1987]
68. Royer, J. (1987), "A Connotational Theory of Program Structure," Lecture Notes in Computer Science, Vol. 273, Springer-Verlag, New York/Berlin.
69. Schapire, R. (1992), "The Design and Analysis of Efficient Learning Algorithms," MIT Press, Cambridge, MA.
70. Shapiro, N. (1971), Review of "Limiting recursion" by E. M. Gold and "Trial and error predicates and the solution to a problem of Mostowski" by H. Putnam, J. Symbolic Logic 36, 342.
71. Shimozono, S., Shinohara, A., Shinohara, T., Miyano, S., Kuhara, S., and Arikawa, S. (1994), Knowledge acquisition from amino acid sequences by machine learning system BONSAI, Trans. Inform. Process. Soc. Japan 35, 2009-2018.
72. Shinohara, T. (1983), Inferring unions of two pattern languages, Bull. Inform. Cybern. 20, 83-88.
73. Shinohara, T. (1991), Inductive inference of monotonic formal systems from positive data, New Generation Comput. 8, 371-384.
74. Shinohara, T., and Arikawa, A. (1995), Pattern inference, in "Algorithmic Learning for Knowledge-Based Systems" (K. P. Jantke and S. Lange, Eds.), Lecture Notes in Artificial Intelligence, Vol. 961, pp. 259-291, Springer-Verlag.
75. Stephan, F. (1995), Noisy inference and oracles, in "Algorithmic Learning Theory: Sixth International Workshop (ALT '95)" (K. Jantke, T. Shinohara, and T. Zeugmann, Eds.), Lecture Notes in Artificial Intelligence, Vol. 997, pp. 185-200, Springer-Verlag.
76. Valiant, L. (1984), A theory of the learnable, Comm. ACM 27, 1134-1142.
77. Viksna, J. (1991), Probabilistic inference of approximations, in "Proceedings of the Conference on Non-monotonic Logic and Inductive Inference" (G. Brewka, K. P. Jantke, and P. H. Schmitt, Eds.), Lecture Notes in Artificial Intelligence, Vol. 659, pp. 323-332, Springer-Verlag, Berlin.
78. Wexler, K. (1982), On extensional learnability, Cognition 11, 89-95.
79. Wexler, K. (1993), The subset principle is an intensional principle, in "Knowledge and Language, Volume I" (E. Reuland and W. Abraham, Eds.), pp. 217-239, Kluwer, Dordrecht.
80. Wexler, K., and Culicover, P. (1980), "Formal Principles of Language Acquisition," MIT Press, Cambridge, MA.
81. Wiehagen, R., Freivalds, R., and Kinber, E. (1984), On the power of probabilistic strategies in inductive inference, Theoret. Comput. Science 28, 111-133.
82. Wright, K. (1989), Identification of unions of languages drawn from an identifiable class, in "Proceedings of the Second Annual Workshop on Computational Learning Theory" (R. Rivest, D. Haussler, and M. Warmuth, Eds.), pp. 328-333, Morgan Kaufmann, San Mateo, CA.
83. Zeugmann, T., and Lange, S. (1995), A guided tour across the boundaries of learning recursive languages, in "Algorithmic Learning for Knowledge-Based Systems" (K. Jantke and S. Lange, Eds.), Lecture Notes in Artificial Intelligence, Vol. 961, pp. 190-258, Springer-Verlag, New York/Berlin.
84. Zeugmann, T., Lange, S., and Kapur, S. (1995), Characterizations of monotonic and dual monotonic language learning, Information and Computation 120, 155-173.