Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: learning grammars

Sortuj według:

Ogranicz wyniki do:

Rough Sets and Learning by Unification

Buszkowski W.

Fundamenta Informaticae

2007

Vol. 75, nr 1-4

107-121

We apply basic notions of the theory of rough sets, due to Pawlak], to explicate certain properties of unification-based learning algorithms for categorial grammars, introduced in and further developed in e.g]. The outcomes of these algorithms can be used to compute both the lower and the upper approximation of the searched language with respect to the given, finite sample. We show that these methods are also appropriate for other kinds of formal grammars, e.g. context-free grammars and context-sensitive grammars.