Identification in the Limit of Substitutable Context-Free Languages
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.
KeywordsTransitive Closure Regular Language Reduction System Congruence Class Nonterminal Symbol
Unable to display preview. Download preview PDF.
- 4.Chomsky, N.: Systems of syntactic analysis. Journal of Symbolic Logic 18(3) (1953)Google Scholar
- 7.Harris, Z.: Distributional structure. Word 10(2-3), 146–162 (1954)Google Scholar
- 8.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)Google Scholar
- 9.Mäkinen, E.: On inferring zero-reversible languages. Technical Report A-1998-7, University of Tampere (1998)Google Scholar
- 12.Starkie, B.: Identifying Languages in the Limit using Alignment Based Learning. PhD thesis, University of Newcastle, Australia (2004)Google Scholar