Abstract
The left-to-right and right-to-left iterative languages are previously unnoticed subclasses of the regular languages of infinite size that are identifiable in the limit from positive data. Essentially, these language classes are the ones obtained by merging final states in a prefix tree and initial states in a suffix tree of the observed sample, respectively. Strikingly, these classes are also transparently related to the zero-reversible languages because some algorithms that learn them differ minimally from the ZR algorithm given in Angluin (1982). Second, they are part of the answer to the challenge provided by Muggleton (1990), who proposed mapping the space of language classes obtainable by a general state-merging algorithm IM1. Third, these classes are relevant to a hypothesis of how children can acquire sound patterns of their language—in particular, the hypothesis that all phonotactic patterns found in natural language are neighborhood-distinct (Heinz 2007).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
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.
References
Gold, E.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Marcus, G.: Negative evidence in language acquisition. Cognition 46, 53–85 (1993)
Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21, 46–62 (1980)
Angluin, D.: Inductive inference of formal languages from positive data. Information Control 45, 117–135 (1980)
Angluin, D.: Inference of reversible languages. Journal for the Association of Computing Machinery 29(3), 741–765 (1982)
Garcia, P., Vidal, E., Oncina, J.: Learning locally testable languages in the strict sense. In: Proceedings of the Workshop on Algorithmic Learning Theory, pp. 325–338 (1990)
Muggleton, S.: Inductive Acquisition of Expert Knowledge. Addison-Wesley, Reading (1990)
Kanazawa, M.: Identification in the limit of categorical grammars. Journal of Logic, Language, and Information 5, 115–155 (1996)
Denis, F., Lemay, A., Terlutte, A.: Some classes of regular languages identifiable in the limit from positive data. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 63–76. Springer, Heidelberg (2002)
Fernau, H.: Identification of function distinguishable languages. Theoretical Computer Science 290, 1679–1711 (2003)
Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science 298(1), 179–206 (2003)
Oates, T., Armstrong, T., Bonache, L.B.: 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)
Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research 8, 1725–1745 (2007)
Greenberg, J.: Some universals of grammar with particular reference to the order of meaningful elements. In: Universals of Language, pp. 73–113. MIT Press, Cambridge (1963)
Mairal, R., Gil, J. (eds.): Linguistic Universals. Cambridge University Press, Cambridge (2006)
Stabler, E.P.: Computational models of language universals: Expressiveness, learnability and consequences. In: Cornell Symposium on Language Universals (2007)
Shieber, S.: Evidence against the context-freeness of natural language. Linguistics and Philosophy 8, 333–343 (1985)
Kobele, G.: Generating Copies: An Investigation into Structural Identity in Language and Grammar. PhD thesis, University of California, Los Angeles (2006)
Johnson, C.D.: Formal Aspects of Phonological Description. Mouton, The Hague (1972)
Kaplan, R., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)
Heinz, J.: The Inductive Learning of Phonotactic Patterns. PhD thesis, University of California, Los Angeles (2007)
Pullum, G., Rogers, J.: Aural pattern recognition experiments and the subregular hierarchy. In: Kracht, M. (ed.) Proceedings of 10th Mathematics of Language Conference, pp. 1–7. University of California, Los Angeles (2007)
Jusczyk, P., Cutler, A., Redanz, N.: Infants’ preference for the predominant stress patterns of english words. Child Development 64, 675–687 (1993)
Jusczyk, P., Luce, P., Charles-Luce, J.: Infants’ sensitivity to phonotactic patterns in the native language. Journal of Memory and Language 33, 630–645 (1994)
Mattys, S., Jusczyk, P.: Phonotactic cues for segmentation of fluent speech by infants. Cognition 78, 91–121 (2001)
McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)
Kracht, M.: The Mathematics of Language. Mouton de Gruyter, Berlin (2003)
Hansson, G.: Theoretical and typological issues in consonant harmony. PhD thesis, University of California, Berkeley (2001)
Hayes, B.: Metrical Stress Theory. Chicago University Press (1995)
Heinz, J.: Learning quantity insensitive stress systems via local inference. In: Proceedings of the Eighth Meeting of the ACL Special Interest Group in Computational Phonology at HLT-NAACL, New York City, USA, pp. 21–30 (2006)
Heinz, J.: On the role of locality in learning stress patterns. Phonology (to appear)
Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems That Learn: An Introduction to Learning Theory, 2nd edn. The MIT Press, Cambridge (1999)
Case, J., Moelius, S.: Parallelism increases iterative learning power. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 49–63. Springer, Heidelberg (2007)
Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)
de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27, 125–138 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heinz, J. (2008). Learning Left-to-Right and Right-to-Left Iterative Languages. In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-88009-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88008-0
Online ISBN: 978-3-540-88009-7
eBook Packages: Computer ScienceComputer Science (R0)