Technical Reports (CIS)
Document Type
Technical Report
Date of this Version
July 1988
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 mildly context sensitive languages to be polynomially learnable. We discuss possible implications of this result to the theory of natural language acquisition.
Recommended Citation
Naoki Abe, "Polynomial Learnability and Locality of Formal Grammars", . July 1988.
Date Posted: 18 September 2007
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-88-51.