Abstract
This paper formalisms the idea of substitutability introduced by Zellig Harris in the 1950s and makes it the basis for a learning algorithm from positive data only for a subclass of context-free grammars. We show that there is a polynomial characteristic set, and thus prove polynomial identification in the limit of this class. We discuss the relationship of this class of languages to other common classes discussed in grammatical inference. We also discuss modifications to the algorithm that produces a reduction system rather than a context-free grammar, that will be much more compact. We discuss the relationship to Angluin’s notion of reversibility for regular languages.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adriaans, P., Trautwein, M., Vervoort, M.: Towards high speed grammar induction on large text corpora. In: Jeffery, K., Hlaváč, V., Wiedermann, J. (eds.) SOFSEM 2000. LNCS, vol. 1963, pp. 173–186. Springer, Heidelberg (2000)
Angluin, D.: Inference of reversible languages. Communications of the ACM 29, 741–765 (1982)
Book, R., Otto, F.: String rewriting systems. Springer, Heidelberg (1993)
Chomsky, N.: Systems of syntactic analysis. Journal of Symbolic Logic 18(3) (1953)
de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27(2), 125–138 (1997)
Gold, E.M.: Language indentification in the limit. Information and Control 10(5), 447–474 (1967)
Harris, Z.: Distributional structure. Word 10(2-3), 146–162 (1954)
Laxminarayana, J.A., Nagaraja, G.: Inference of a subclass of context free grammars using positive samples. In: Proceedings of the Workshop on Learning Context-Free Grammars at ECML/PKDD 2003 (2003)
Mäkinen, E.: On inferring zero-reversible languages. Technical Report A-1998-7, University of Tampere (1998)
Ron, D., Singer, Y., Tishby, N.: On the learnability and usage of acyclic probabilistic finite automata. Journal of Computer and System Sciences (JCSS) 56(2), 133–152 (1998)
Senizergues, G.: The equivalence and inclusion problems for NTS languages. J. Comput. Syst. Sci. 31(3), 303–331 (1985)
Starkie, B.: Identifying Languages in the Limit using Alignment Based Learning. PhD thesis, University of Newcastle, Australia (2004)
Yokomori, T.: On polynomial-time learnability in the limit of strictly deterministic automata. Machine Learning 19(2), 153–179 (1995)
Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science 298(1), 179–206 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clark, A., Eyraud, R. (2005). Identification in the Limit of Substitutable Context-Free Languages. In: Jain, S., Simon, H.U., Tomita, E. (eds) Algorithmic Learning Theory. ALT 2005. Lecture Notes in Computer Science(), vol 3734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564089_23
Download citation
DOI: https://doi.org/10.1007/11564089_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29242-5
Online ISBN: 978-3-540-31696-1
eBook Packages: Computer ScienceComputer Science (R0)