Studia Logica

, Volume 85, Issue 2, pp 153–169

On Learnability of Restricted Classes of Categorial Grammars

Article

DOI: 10.1007/s11225-007-9036-y

Cite this article as:
Dziemidowicz-Gryz, B. Stud Logica (2007) 85: 153. doi:10.1007/s11225-007-9036-y
  • 38 Views

Abstract

In this paper we present learning algorithms for classes of categorial grammars restricted by negative constraints. We modify learning functions of Kanazawa [10] and apply them to these classes of grammars. We also prove the learnability of intersection of the class of minimal grammars with the class of k-valued grammars.

Keywords

categorial grammarunificationlearning functionlearning algorithm

Copyright information

© Springer Science+Business Media, Inc. 2007

Authors and Affiliations

  1. 1.Faculty of Mathematics and Computer ScienceUniversity of Warmia and MazuryOlsztynPoland