[ ILPnet2 | Library | Newsletter | CSCW | Education | End-User Club | Events | Nodes | Systems | Applications | Members only ]
Learning Rigid Lamberk Grammars and Minimalist Grammars from Structured
Sentences
Roberto Bonato
and Christian Retoré.
In Lubos Popelínský
and Miloslav Nepil, editors,
Proceedings of the 3d Workshop on Learning Language in Logic, pages
23--34, Strasbourg, France, September 2001.
Abstract
We present an extension of Buszkowski's learning algorithm for categorial
grammars to rigid Lambek grammars and then for minimalist categorial
grammars. The Kanazawa proof of the convergence in the Gold sense is
simplified and extended to these new algorithms. We thus show that this
technique based on principal type algorithm and type unification is quite
general and applies to learning issues for different type logical grammars,
which are larger, linguistically more accurate and closer to semantics.
BibTeX entry.
Other publications
ILPnet2 librarian,
ilpnet2-lib@cs.bris.ac.uk. Last modified on Wednesday 9 April 2003 at 18:31. © 2003 ILPnet2