PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Identification in the limit of substitutable context-free languages
Alexander Clark and Rémi Eyraud
In: ALT 05, 8 - 11 october, Singapore.

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.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Additional Information:This work was made during a one month visit at the RHUL. PASCAL network financially helped this stay.
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:1115
Deposited By:Rémi Eyraud
Deposited On:06 October 2005