Optimal Unification and Learning Algorithms for Categorial Grammars

• Autorzy: Dziemidowicz B.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

unification; categorial grammars

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2002
• Tom: Vol. 49, nr 4
• Strony: 313--324
• Opis fizyczny: bibliogr. 8 poz.

Twórcy

autor

Dziemidowicz B.

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