Open AccessBook
Learnable classes of categorial grammars
TLDR
This chapter discusses the basic theory of rigid grammars, a theorem of finite elasticity, and the learnability theorem, which describes the structure of grammar according to k-valued and least-valued values.Abstract:
1. Introduction 2. Learnability theorem 3. A theorem of finite elasticity 4. Classical categorial grammar 5. Basic theory of rigid grammars 6. Learning from structures I: rigid, k-valued, and least-valued grammar 7. Learning from structures II: Subclasses of the optimal grammars 8. Learning from strings 9. Variations 10. Conclusions Appendix.read more
Citations
More filters
Book ChapterDOI
Categorial Type Logics
TL;DR: Categorial type logics developed out of the Syntactic Calculus proposed by Lambek fifty years ago, and complemented in the 1980'ies with a ‘proofs-as-programs’ interpretation associating derivations in a syntactic source calculus with terms of the simply typed linear lambda calculus expressing meaning composition.
Proceedings ArticleDOI
The Door
TL;DR: This work focuses on a door because it links one place to another, and the linking of different places and sharing of places is one of the substantial qualities of network technology.
Journal ArticleDOI
The Subset Principle in syntax : costs of compliance
TL;DR: This paper investigated the relationship between the Subset Principle (SP) and incremental learning in syntax acquisition and found that the two are incompatible, given other standard assumptions, and set out some ideas for ways in which they might be reconciled.
Book ChapterDOI
Towards High Speed Grammar Induction on Large Text Corpora
TL;DR: An efficient and scalable implementation for grammar induction based on the EMILE approach, which learns a subclass of the shallow context-free languages, and some interesting practical results on small and large text collections.
Proceedings ArticleDOI
Angluin's theorem for indexed families of r.e. sets and applications
Dick de Jongh,Makoto Kanazawa +1 more
TL;DR: It is proved that some variants characterizing conservativity and two other similar restrictions paralleling Zeug mann Lange and Kapur s results for indexed families of recursive languages are true.
References
More filters
Book ChapterDOI
Categorial Type Logics
TL;DR: Categorial type logics developed out of the Syntactic Calculus proposed by Lambek fifty years ago, and complemented in the 1980'ies with a ‘proofs-as-programs’ interpretation associating derivations in a syntactic source calculus with terms of the simply typed linear lambda calculus expressing meaning composition.
Proceedings ArticleDOI
The Door
TL;DR: This work focuses on a door because it links one place to another, and the linking of different places and sharing of places is one of the substantial qualities of network technology.
Journal ArticleDOI
The Subset Principle in syntax : costs of compliance
TL;DR: This paper investigated the relationship between the Subset Principle (SP) and incremental learning in syntax acquisition and found that the two are incompatible, given other standard assumptions, and set out some ideas for ways in which they might be reconciled.
Book ChapterDOI
Towards High Speed Grammar Induction on Large Text Corpora
TL;DR: An efficient and scalable implementation for grammar induction based on the EMILE approach, which learns a subclass of the shallow context-free languages, and some interesting practical results on small and large text collections.
Proceedings ArticleDOI
Angluin's theorem for indexed families of r.e. sets and applications
Dick de Jongh,Makoto Kanazawa +1 more
TL;DR: It is proved that some variants characterizing conservativity and two other similar restrictions paralleling Zeug mann Lange and Kapur s results for indexed families of recursive languages are true.
Related Papers (5)
k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings
Denis Bécet,Annie Foret +1 more
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures
Denis Béchet,Annie Foret +1 more