HAL : hal-00348673, version 1

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

9th International Colloquium on Grammatical Inference - ICGI 2008, St Malo : France (2008)

A Polynomial Algorithm for the Inference of Context Free Languages

Alexander Clark (  Auteur correspondant ) 1, Rémi Eyraud 2, Amaury Habrard 2

(2008)

We present a polynomial algorithm for the inductive inference of a large class of context free languages, that includes all regular languages. The algorithm uses a representation which we call Binary Feature Grammars based on a set of features, capable of representing richly structured context free languages as well as some context sensitive languages. More precisely, we focus on a particular case of this representation where the features correspond to contexts appearing in the language. Using the paradigm of positive data and a membership oracle, we can establish that all context free languages that satisfy two constraints on the context distributions can be identified in the limit by this approach. The polynomial time algorithm we propose is based on a generalisation of distributional learning and uses the lattice of context occurrences. The formalism and the algorithm seem well suited to natural language and in particular to the modelling of first language acquisition.

1 :	Department of Computer Science
	Royal Holloway, University of London
2 :	Laboratoire d'informatique Fondamentale de Marseille (LIF)
	CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I

Domaine

:

Informatique/Apprentissage

hal-00348673, version 1

http://hal.archives-ouvertes.fr/hal-00348673

oai:hal.archives-ouvertes.fr:hal-00348673

Contributeur : Amaury Habrard <>

Soumis le : Vendredi 19 Décembre 2008, 18:39:38

Dernière modification le : Samedi 20 Décembre 2008, 09:01:15