Polynomial learnability and locality of formal grammars

Authors:
Naoki Abe
Affiliations:
University of Pennsylvania, Philadelphia, PA
Venue:
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Year:
1988

Citing 5
Cited 2

A theory of the learnable

Communications of the ACM
Inference of Reversible Languages

Journal of the ACM (JACM)
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

Towards High Speed Grammar Induction on Large Text Corpora

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Feasible learnability of formal grammars and the theory of natural language acquisition

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We apply a complexity theoretic notion of feasible learnability called "polynomial learnability" to the evaluation of grammatical formalisms for linguistic description. We show that a novel, nontrivial constraint on the degree of "locality" of grammars allows not only context free languages but also a rich class of mildy context sensitive languages to be polynomially learnable. We discuss possible implications of this result to the theory of natural language acquisition.