In this paper we explain how to derive learnability of some classes of categorial languages as a consequence of the a property that have unifiable infinite sets of types, namely unification compactness. At first we present an alternate (with respect to [6]) proof of learnability of rigid languages, that introduces our method. Then we prove learnability of the class of semi-rigid languages, which lies in between (learnable) class of rigid languages and (not learnable) class of optimal (as defined by Kanazawa in [6]) languages.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In this paper we focus on the properties of infinite sets of types that have finite substitutional images. Since the number of such images may be infinite, we provide the way of its reduction. Having this done, we apply the new methods in the field of learnability of classical categorial grammars.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.