Inference of Reversible Languages
Journal of the ACM (JACM)
On the acquisition of lexical entries: the perceptual origin of thematic relations
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Using a logic grammar to learn a lexicon
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Learning auxiliary fronting with grammatical inference
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
| Hi-index | 0.00 |
In this paper we apply some recent work of Angluin (1982) to the induction of the English auxiliary verb system. In general, the induction of finite automata is computationally intractable. However, Angluin shows that restricted finite automata, the k-reversible automata, can be learned by efficient (polynomial time) algoriths. can be learned by efficient (polynomial time) algorithms. We present an explicit computer model demonstrating that the English auxiliary verb system can in fact be learned as a l-reversible automaton, and hence in a computationally feasible amount of time. The entire system can be acquired by looking at only half the possible auxiliary verb sequences, and the pattern of generalization seems compatible with what is known about human acquisition of auxiliaries. We conclude that certain linguistic subsystems may well be learnable by inductive inference methods of this kind, and suggest an extension to context-free languages.