The problem of inferring a grammar for a set of symbol strings is considered and a number of new decidability results obtained. Several notions of grammatical complexity and their properties are studied. The question of learning the least complex grammar for a set of strings is investigated leading to a variety of positive and negative results. This work is part of a continuing effort to study the problems of representation and generalization through the grammatical inference question. Appendices A and B and Section 2a.0 are primarily the work of Reder, Sections 2b and 3d of Horning, Section 4 and Appendix C of Gips, and the remainder the responsibility of Feldman.
Cited By
Nix R Editing by example Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (186-195)- Langley P A model of early syntactic development Proceedings of the 20th annual meeting on Association for Computational Linguistics, (145-151)
- Moorer J (1972). Music and computer composition, Communications of the ACM, 15:2, (104-113), Online publication date: 1-Feb-1972.
Recommendations
Grammatical inference for syntax-based statistical machine translation
ICGI'06: Proceedings of the 8th international conference on Grammatical Inference: algorithms and applicationsIn this article we present a syntax-based translation system, called TABL (Translation using Alignment-Based Learning). It translates natural language sentences by mapping grammar rules (which are induced by the Alignment-Based Learning grammatical ...
Grammatical Inference: Introduction and Survey-Part II
Special memorial issue for Professor King-Sun FuInference of high-dimensional grammars is discussed. Specifically, techniques for inferring tree grammars are briefly presented. The problem of inferring a stochastic grammar to model the behavior of an information source is also introduced and ...