On the Learnability of Classes of Minimal Grammars With Respect to Some Linear Preordering Relations

Studies in Logic, Grammar and Rhetoric 42 (1):37-48 (2015)
  Copy   BIBTEX

Abstract

In this paper we prove the learnability of the classes of minimal grammars with respect to some linear preorderings on the set of categorial grammars. We give some examples of the linear preordering relations on the set of categorial grammars satisfying necessary conditions.

Categories

Add categories

Keywords

Reprint years

DOI

10.1515/slgr-2015-0029

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,873

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

On Learnability of Restricted Classes of Categorial Grammars.Barbara Dziemidowicz-Gryz - 2007 - Studia Logica 85 (2):153-169.
Learnability of Pregroup Grammars.Denis Béchet, Annie Foret & Isabelle Tellier - 2007 - Studia Logica 87 (2-3):225-252.
A borel reducibility theory for classes of countable structures.Harvey Friedman & Lee Stanley - 1989 - Journal of Symbolic Logic 54 (3):894-914.
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.
Highly constrained unification grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
The Undecidability of the Ambiguity Problem for Minimal Linear Grammars.Sheila A. Greibach - 1967 - Journal of Symbolic Logic 32 (1):114-115.
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars.Stephan Kepser & Jim Rogers - 2011 - Journal of Logic, Language and Information 20 (3):361-384.
Equality of proofs for linear equality.Kosta Došen & Zoran Petrić - 2008 - Archive for Mathematical Logic 47 (6):549-565.
Linear Processing with Pregroups.Anne Preller - 2007 - Studia Logica 87 (2-3):171-197.
Learning correction grammars.Lorenzo Carlucci, John Case & Sanjay Jain - 2009 - Journal of Symbolic Logic 74 (2):489-516.
Multiple Grammars and the Logic of Learnability in Second Language Acquisition.Tom W. Roeper - 2016 - Frontiers in Psychology 7.
Sequentially indexed grammars.Jan van Eijck - unknown
Comparing theories by their positive and negative contents.Isabella C. Burger & Johannes Heidema - 1994 - British Journal for the Philosophy of Science 45 (2):605-630.
Perceptual constraints and the learnability of simple grammars.Ansgar D. Endress, Ghislaine Dehaene-Lambertz & Jacques Mehler - 2007 - Cognition 105 (3):577-614.
Groups definable in linear o-minimal structures: the non-compact case.Pantelis E. Eleftheriou - 2010 - Journal of Symbolic Logic 75 (1):208-220.

Analytics

Added to PP
2018-03-10

Downloads
8 (#1,339,625)

6 months
4 (#854,689)

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

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