The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
COLING '69 Proceedings of the 1969 conference on Computational linguistics
Hi-index | 0.00 |
In this paper, a recently proposed level-oriented model for machine analysis and synthesis of natural languages is investigated. Claims concerning the preservation of context-free (CF) languages in such a system are examined and shown to be unjustified. Furthermore, it is shown that even a revised version of the model (incorporating some recent discoveries) will not be CF-preserving. Finally, some theoretical implications of these findings are explored: in particular, claims of greater naturalness and the question of recursivity.