Communications of the ACM
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Context-free grammars on trees
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Some computational properties of Tree Adjoining Grammars
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Polynomial learnability and locality of formal grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Predicting Protein Secondary Structure Using Stochastic Tree Grammars
Machine Learning - Special issue on learning with probabilistic representations
Constraints on strong generative power
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Effiscient learning of some linear matrix languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
We propose to apply a complexity theoretic notion of feasible learnability called "polynomial learnability" to the evaluation of grammatical formalisms for linguistic description. Polynomial learnability was originally defined by Valiant in the context of boolean concept learning and subsequently generalized by Blumer et al. to infinitary domains. We give a clear, intuitive exposition of this notion of learnability and what characteristics of a collection of languages may or many not help feasible learn ability under this paradigm. In particular, we present a novel, nontrivial constraint on the degree of "locality" of grammars which allows a rich class of mildly context sensitive languages to be feasibly learnable. We discuss possible implications of this observation to the theory of natural language acquisition.