Abstract
It is investigated for which choice of a parameter q, denoting the number of contexts, the class of simple external contextual languages is iteratively learnable. On one hand, the class admits, for all values of q, polynomial time learnability provided an adequate choice of the hypothesis space is given. On the other hand, additional constraints like consistency and conservativeness or the use of a one-one hypothesis space changes the picture — iterative learning limits the long term memory of the learner to the current hypothesis and these constraints further hinder storage of information via padding of this hypothesis. It is shown that if q > 3, then simple external contextual languages are not iteratively learnable using a class preserving one-one hypothesis space, while for q = 1 it is iteratively learnable, even in polynomial time. For the intermediate levels, there is some indication that iterative learnability using a class preserving one-one hypothesis space might depend on the size of the alphabet. It is also investigated for which choice of the parameters, the simple external contextual languages can be learnt by a consistent and conservative iterative learner.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)
Becerra-Bonache, L.: On the Learnability of Mildly Context-Sensitive Languages Using Positive Data and Correction Queries. PhD thesis, Rovira i Virgili University (2006)
Becerra-Bonache, L., Yokomori, T.: Learning mild context-sensitiveness: toward understanding children’s language learning. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol. 3264, pp. 53–64. Springer, Heidelberg (2004)
Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Information and Control 28, 125–155 (1975)
Bresnan, J., Kaplan, R.M., Peters, S., Zaenen, A.: Cross-serial dependencies in Dutch. Linguistic Inquiry 13, 613–635 (1982)
Case, J., Lynes, C.: Inductive inference and language identification. In: Ninth International Colloquium on Automata, Languages and Programming (ICALP 1982). LNCS, vol. 140, pp. 107–115. Springer, Heidelberg (1982)
Case, J., Moelius, S.E.: Parallelism increases iterative learning power. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 41–55. Springer, Heidelberg (2007)
Chomsky, N.: Three models for the description of language. IRE Transactions on Information Theory 3, 113–124 (1956)
Fernau, H., Holzer, M.: External contextual and conditional languages. In: Recent Topics in Mathematical and Computational Linguistics, Papers in Honor of Solomon Marcus on the Occasion of his 75th Birthday, pp. 104–120. Editura Academiei Româe, Bucuresti (2000)
Fulk, M.: Prudence and other conditions on formal language learning. Information and Computation 85, 1–11 (1990)
Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Joshi, A.K.: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? In: Natural Language Parsing, pp. 206–250. Cambridge University Press, Cambridge (1985)
Joshi, A.K., Schabes, Y.: Tree-adjoining grammars. Handbook of Formal Languages, vol. 3, pp. 69–123. Springer, Heidelberg (1997)
Kudlek, M., Martín-Vide, C., Mateescu, A., Mitrana, V.: Contexts and the concept of mild context-sensitivity. Linguistics and Philosophy 26, 703–725 (2003)
Lange, S., Zeugmann, T.: Language learning in dependence on the space of hypotheses. In: Proceedings of the Sixth Annual Conference on Computational Learning Theory, COLT 1993, pp. 127–136. ACM Press, New York (1993)
Lange, S., Wiehagen, R.: Polynomial time inference of arbitrary pattern languages. New Generation Computing 8, 361–370 (1991)
Lange, S., Zeugmann, T.: Incremental learning from positive data. Journal of Computer and System Sciences 53, 88–103 (1996)
Manaster-Ramer, A.: Some uses and abuses of mathematics in linguistics. In: Issues in Mathematical Linguistics, pp. 73–130. John Benjamins, Amsterdam (1999)
Marcus, S.: Contextual grammars. Revue Roumaine des Mathématiques Pures et Appliquées 14, 1525–1534 (1969)
Marcus, S., Paun, G., Martín-Vide, C.: Contextual grammars as generative models of natural languages. Computational Linguistics 24(2), 245–274 (1998)
Parikh, R.J.: On context-free languages. Journal of the ACM 13, 570–581 (1966)
Paun, G.: Marcus Contextual Grammar. Kluwer Academic Publishers, Netherlands (1997)
Oates, T., Armstrong, T., Becerra-Bonache, L., Atamas, M.: Inferring grammars for mildly context-sensitive languages in polynomial-time. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 137–147. Springer, Heidelberg (2006)
Pitt, L.: Inductive inference, DFAs, and computational complexity. In: Jantke, K.P. (ed.) AII 1989. LNCS, vol. 397, pp. 18–44. Springer, Heidelberg (1989)
Osherson, D.N., Stob, M., Weinstein, S.: Systems That Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge (1986)
Roach, K.: Formal properties of head grammars. In: Manaster-Ramer, A. (ed.) Mathematics of Language, pp. 293–348. John Benjamins, Amsterdam (1987)
Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
Shieber, S.M.: Evidence against the context-freeness of natural language. Linguistics and Philosophy 8, 333–343 (1985)
Shinohara, T.: Rich classes inferable from positive data: Length-bounded elementary formal systems. Information and Computation 108, 175–186 (1994)
Steedman, M.: Dependency and coordination in the grammar of Dutch and English. Language 61, 523–568 (1985)
Wexler, K., Culicover, P.W.: Formal Principles of Language Acquisition. MIT Press, Cambridge (1980)
Wiehagen, R.: Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Elektronische Informationsverarbeitung und Kybernetik 12, 93–99 (1976)
Yoshinaka, R.: Learning efficiency of very simple grammars from positive data. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 227–241. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Becerra-Bonache, L., Case, J., Jain, S., Stephan, F. (2008). Iterative Learning of Simple External Contextual Languages. In: Freund, Y., Györfi, L., Turán, G., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 2008. Lecture Notes in Computer Science(), vol 5254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87987-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-87987-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87986-2
Online ISBN: 978-3-540-87987-9
eBook Packages: Computer ScienceComputer Science (R0)