On Learnability of Restricted Classes of Categorial Grammars

Studia Logica 85 (2):153-169 (2007)
  Copy   BIBTEX

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.

Categories

Keywords

Reprint years

DOI

10.1007/s11225-007-9036-y

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Identification in the limit of categorial grammars.Makoto Kanazawa - 1996 - Journal of Logic, Language and Information 5 (2):115-155.
A faithful representation of non-associative Lambek grammars in abstract categorial grammars.Christian Retoré & Sylvain Salvati - 2010 - Journal of Logic Language and Information 19 (2):185-200.
Categorial grammars determined from linguistic data by unification.Wojciech BuszKowski & Gerald Penn - 1990 - Studia Logica 49 (4):431 - 454.
Discontinous Constituents in Generalized Categorial Grammar.Emmon W. Bach - unknown
Highly constrained unification grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
On Commutative and Nonassociative Syntactic Calculi and Categorial Grammars.Maciej Kandulski - 1995 - Mathematical Logic Quarterly 41 (2):217-235.
On the expressive power of abstract categorial grammars: Representing context-free formalisms. [REVIEW]Philippe de Groote & Sylvain Pogodalla - 2004 - Journal of Logic, Language and Information 13 (4):421-438.
A direct proof of the equivalence of free categorial grammars and simple phrase structure grammars.Wojciech Zielonka - 1978 - Studia Logica 37 (1):41 - 57.
Strong generative capacity of classical categorial grammars.Wojciech Buszkowski - 1986 - Bulletin of the Section of Logic 15 (2):60-63.
JM Cohen's claim on categorial grammars remains unproved.Wojciech Zielonka - 1985 - Bulletin of the Section of Logic 14 (4):130-133.
Lambek grammars as combinatory categorial grammars.G. Jäger - 2001 - Logic Journal of the IGPL 9 (6):781-792.
Gaifman's theorem on categorial grammars revisited.Wojciech Buszkowski - 1988 - Studia Logica 47 (1):23 - 33.
On the equivalence of Ajdukiewicz-Lambek calculus and simple phrase structure grammars.Wojciech Zielonka - 1976 - Bulletin of the Section of Logic 5 (2):1-4.
The equivalence of Nonassociative Lambek Categorial Grammars and Context‐Free Grammars.Maciej Kandulski - 1988 - Mathematical Logic Quarterly 34 (1):41-52.
The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars.Wojcßch Buszkowski - 1985 - Mathematical Logic Quarterly 31 (24):369-384.

Analytics

Added to PP
2009-01-28

Downloads
22 (#688,104)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Foundations of Logic Programming.J. W. Lloyd - 1987 - Journal of Symbolic Logic 52 (1):288-289.
Identification in the limit of categorial grammars.Makoto Kanazawa - 1996 - Journal of Logic, Language and Information 5 (2):115-155.
Learning categorial grammar by unification with negative constraints.Jacek Marciniec - 1994 - Journal of Applied Non-Classical Logics 4 (2):181-200.

Add more references