A Polynomial Algorithm for the Inference of Context Free Languages

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

Contributor : Amaury Habrard <>
Submitted on : Friday, December 19, 2008 - 6:39:38 PM
Last modification on : Friday, March 9, 2018 - 11:26:11 AM
Long-term archiving on : Thursday, October 11, 2012 - 2:11:15 PM


Files produced by the author(s)


  • HAL Id : hal-00348673, version 1



Alexander Clark, Rémi Eyraud, Amaury Habrard. A Polynomial Algorithm for the Inference of Context Free Languages. 9th International Colloquium on Grammatical Inference - ICGI 2008, Sep 2008, St Malo, France. p.29-42. ⟨hal-00348673⟩



Record views


Files downloads