Skip to Main content Skip to Navigation

Grammatical Inference as Unification

Jacques Nicolas 1 
1 AIDA - Modeling and Machine Learning for Data Interpretation and Decision Assistance
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We propose to set the grammatical inference problem in a logical framework. The search for admissible solutions in a given class of languages is reduced to the problem of unifying a set of terms. This point of view has been already developed in the particular context of categorial grammars, a type of lexicalized grammar. We present the state of the art in this domain and propose several improvements. The case of regular grammars is studied in a second part. We show that rational unification allows to infer such grammars. We give corresponding Prolog programs in both cases. Indeed, one of the aim of this work is to show that "lean" programs are possible for grammatical inference. This approach has been successful in the field of automated theorem proving and we expect to observe the same benefits in grammatical inference : efficiency and extendibility.
Document type :
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:40:56 AM
Last modification on : Friday, February 4, 2022 - 3:23:15 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:32:19 PM


  • HAL Id : inria-00073042, version 1


Jacques Nicolas. Grammatical Inference as Unification. [Research Report] RR-3632, INRIA. 1999. ⟨inria-00073042⟩



Record views


Files downloads