Grammatical Inference as Unification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

Grammatical Inference as Unification


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3632.pdf (267.81 Ko) Télécharger le fichier

Dates and versions

inria-00073042 , version 1 (24-05-2006)


  • HAL Id : inria-00073042 , version 1


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


Gmail Facebook Twitter LinkedIn More