Iterative learning of simple external contextual languages

Theoretical Computer Science

Volumn 411, Issue 29-30, 2010, Pages 2741-2756

  Becerra Bonache, Leonor ^a   Case, John ^b   Jain, Sanjay ^c   Stephan, Frank ^c  

^a Yale University   (United States)

^b University of Delaware   (United States)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Grammatical inference; Iterative learning; Mildly sontext sensitive languages; Simple external contextual grammars

Indexed keywords

EXTERNAL CONTEXTUAL GRAMMARS; GRAMMATICAL INFERENCES; HYPOTHESIS SPACE; ITERATIVE LEARNING; LONG TERM MEMORY; POLYNOMIAL TIME LEARNABILITY; POLYNOMIAL-TIME;

CONTEXT FREE GRAMMARS; LINGUISTICS; POLYNOMIAL APPROXIMATION;

LEARNING SYSTEMS;

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

References (42)

1. Angluin D. Inductive inference of formal languages from positive data. Information and Control 45 (1980) 117-135
2. Leonor Becerra-Bonache, On the learnability of mildly context-sensitive languages using positive data and correction queries. Ph.D. Thesis, Rovira i Virgili University, 2006.
3. Becerra-Bonache L., and Yokomori T. Learning mild context-sensitiveness: toward understanding children's language learning. Grammatical Inference: Algorithms and Applications, Seventh International Colloquium, ICGI 2004. LNCS vol. 3264 (2004), Springer 53-64
4. Janis Bārzdiņš, Two theorems on the limiting synthesis of functions, in: Theory of Algorithms and Programs, volume 1, Latvian State University, Riga, 210, 1974, pp. 82-88.
5. Blum L., and Blum M. Toward a mathematical theory of inductive inference. Information and Control 28 (1975) 125-155
6. Bresnan J., Kaplan R.M., Peters S., and Zaenen A. Cross-serial dependencies in Dutch. Linguistic Inquiry 13 (1982) 613-635
7. Carlucci L., Case J., Jain S., and Stephan F. Results on memory-limited U-shaped learning. Information and Computation 205 (2007) 1551-1573
8. Case J., Jain S., Lange S., and Zeugmann T. Incremental concept learning for bounded data mining. Information and Computation 152 (1999) 74-110
9. Case J., and Lynes C. Inductive inference and language identification. Ninth International Colloquium on Automata, Languages and Programming. ICALP 1982. LNCS vol. 140 (1982), Springer 107-115
10. Case J., and Moelius S.E. Parallelism increases iterative learning power. Theoretical Computer Science 410 (2009) 1863-1875
11. Chomsky N. Three models for the description of language. IRE Transactions on Information Theory 3 (1956) 113-124
12. Culy C. The complexity of the vocabulary of Bambara. Linguistics and Philosophy 8 (1985) 345-351
13. Fernau H., and Holzer M. External contextual and conditional languages. Recent Topics in Mathematical and Computational Linguistics, Papers in Honor of Solomon Marcus on the Occasion of his 75th Birthday (2000), Editura Academiei Româe, Bucuresti 104-120
14. Freivalds R., Kinber E., and Smith C. On the intrinsic complexity of learning. Information and Computation 123 (1995) 64-71
15. Freivalds R., and Smith C. On the role of procrastination for machine learning. Information and Computation 107 (1993) 237-271
16. Fulk M. Prudence and other conditions on formal language learning. Information and Computation 85 (1990) 1-11
17. Mark Gold E. Language identification in the limit. Information and Control 10 (1967) 447-474
18. Jain S., Osherson D., Royer J., and Sharma A. Systems that Learn: An Introduction to Learning Theory. second ed. (1999), MIT Press, Cambridge, Massachusetts
19. Joshi A.K. Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions?. Natural Language Parsing (1985), Cambridge University Press 206-250
20. Joshi A.K., and Schabes Y. Tree-adjoining grammars. Handbook of Formal Languages vol. 3 (1997), Springer 69-123
21. Kudlek M., Martín-Vide C., Mateescu A., and Mitrana V. Contexts and the concept of mild context-sensitivity. Linguistics and Philosophy 26 (2003) 703-725
22. Lange S., and Wiehagen R. Polynomial time inference of arbitrary pattern languages. New Generation Computing 8 (1991) 361-370
23. Lange S., and Zeugmann T. Language learning in dependence on the space of hypotheses. Proceedings of the Sixth Annual Conference on Computational Learning Theory. COLT 1993 (1993), ACM Press 127-136
24. Lange S., and Zeugmann T. Incremental learning from positive data. Journal of Computer and System Sciences 53 (1996) 88-103
25. Manaster-Ramer A. Some uses and abuses of mathematics in linguistics. Issues in Mathematical Linguistics (1999), John Benjamins, Amsterdam 73-130
26. Marcus S. Contextual grammars. Revue Roumaine des Mathématiques Pures et Appliquées 14 (1969) 1525-1534
27. Marcus S., Paun G., and Martín-Vide C. Contextual grammars as generative models of natural languages. Computational Linguistics 24 2 (1998) 245-274
28. Oates T., Armstrong T., Becerra-Bonache L., and Atamas M. Inferring grammars for mildly context-sensitive languages in polynomial-time. Grammatical Inference: Algorithms and Applications, Eighth International Colloquium. ICGI 2006. LNAI vol. 4201 (2006), Springer 137-147
29. Odifreddi P. Classical Recursion Theory (1989), North-Holland, Amsterdam
30. Osherson D.N., Stob M., and Weinstein S. Systems That Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists (1986), Bradford - The MIT Press, Cambridge, Massachusetts
31. Osherson D.N., and Weinstein S. Criteria of language learning. Information and Control 52 (1982) 123-138
32. Parikh R.J. On context-free languages. Journal of the ACM 13 (1966) 570-581
33. Paun G. Marcus Contextual Grammar (1997), Kluwer Academic Publishers, Netherlands
34. Pitt L. Inductive inference, DFAs, and computational complexity. Analogical and Inductive Inference, Second International Workshop. AII 1989. LNAI vol. 397 (1989), Springer 18-44
35. Roach K. Formal properties of head grammars. In: Manaster-Ramer A. (Ed). Mathematics of Language (1987), John Benjamins, Amsterdam 293-348
36. Rogers H. Theory of Recursive Functions and Effective Computability (1967), McGraw-Hill, New York
37. Shieber S.M. Evidence against the context-freeness of natural language. Linguistics and Philosophy 8 (1985) 333-343
38. Shinohara T. Rich classes inferable from positive data: Length-bounded elementary formal systems. Information and Computation 108 (1994) 175-186
39. Steedman M. Dependency and coordination in the grammar of Dutch and English. Language 61 (1985) 523-568
40. Wexler K., and Culicover P.W. Formal Principles of Language Acquisition (1980), The MIT Press, Cambridge, Massachusetts
41. Wiehagen R. Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Elektronische Informationsverarbeitung und Kybernetik 12 (1976) 93-99
42. Yoshinaka R. Learning efficiency of very simple grammars from positive data. Theoretical Computer Science 410 (2009) 1807-1825