PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 5

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  categorial grammars
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote From Unification Compactness to Learnability
Marciniec J.
Fundamenta Informaticae
|
2007
|
Vol. 81, nr 4
473-484
EN
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
Content available remote Syntaktyczna i semantyczna analiza wybranych konstrukcji języka polskiego za pomocą gramatyki Montague
Hajnicz E.
Prace Instytutu Podstaw Informatyki Polskiej Akademii Nauk
|
2006
|
Nr 996
1-156
PL
Niniejszy raport zawiera adaptację gramatyki Montague dla języka polskiego. Podstawowe założenia i koncepcje Montague zostały zachowane. Zasadnicza zmiana polega na zastąpieniu transformacyjnej metody obsługi fleksji metodą uzgodnień. Uwzględnione zostały wszystkie podstawowe kategorie gramatyczne: rzeczowniki, czasowniki, przymiotniki i przysłówki (zdaniowe i przyczasownikowe).
EN
The present report contains an adaptation of Montague grammar for Polish. The basic Montague's assumptions and concepts are preserved. The main change consists in replacing an transformational method of treating an inflexion by the coordination method. All basic grammar categories: nouns, verbs, adjectives and adverbs are considered.
3
Content available remote Optimal Unification of Infinite Sets of Types
Marciniec J.
Fundamenta Informaticae
|
2004
|
Vol. 62, nr 3,4
395--407
EN
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.
4
Content available remote Derived Tree Languages of Nonassociative Lambek Categorial Grammars with Product
Kandulski M.
Fundamenta Informaticae
|
2003
|
Vol. 55, nr 3,4
349-362
EN
We introduce the notion of derived tree corresponding with a derivation in the nonassociative Lambek calculus with product, and examine languages of derived trees determined by categorial grammars employing the calculus as a type reduction system. We prove that the class of derived tree languages of nonassociative Lambek grammars with product contains only regular tree languages.
5
Content available remote Optimal Unification and Learning Algorithms for Categorial Grammars
Dziemidowicz B.
Fundamenta Informaticae
|
2002
|
Vol. 49, nr 4
313-324
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.
first rewind previous Strona / 1 next fast forward last
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ć.