Optimal Unification and Learning Algorithms for Categorial Grammars

Article type: Research Article

Authors: Dziemidowicz, Barbara

Affiliations: Department of Mathematics and Computer Science, University of Warmia and Mazury, Olsztyn, Poland

Abstract: In this paper continuing [1], we present a more general approach to restricted optimal unification, introduced and applied to learning algorithms for categorial grammars in [2] and further developed in [7,8,4,5]. We introduce a procedure of finding minimal unifiers with respect to some preordering relation between substitutions and solve a general problem of finding all minimal (in several senses) categorial grammars compatible with a given language sample.

Keywords:

Journal: Fundamenta Informaticae, vol. 49, no. 4, pp. 313-324, 2002