<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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.</p></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.

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

Studies in Logic, Grammar and Rhetoric

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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...

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

Publicado en línea: 26 nov 2015

Páginas: 37 - 48

DOI: https://doi.org/10.1515/slgr-2015-0029

Palabras clave
categorial grammar, unification, learning function, learning algorithm.

© Studies in Logic, Grammar and Rhetoric

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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

Publicado en línea: 26 nov 2015

Páginas: 37 - 48

DOI: https://doi.org/10.1515/slgr-2015-0029

Palabras clavecategorial grammar, unification, learning function, learning algorithm.

© Studies in Logic, Grammar and Rhetoric

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Palabras clave
categorial grammar, unification, learning function, learning algorithm.