Abstract
Most investigators supposed from the time that the Chomsky Hierarchy was first established that natural languages, considered as string sets, would fall somewhere between the context free and the context sensitive languages and, further, that they would lie in some sense “close” to the context free class. On the one hand, the context sensitive languages seemed much too inclusive, containing as they do species such as {anbn!} (n! is n factorial, i.e., 1 x 2 x 3 x ... x n ) and {an : n is prime}, which seem unlikely candidates for any sort of linguistic model. On the other hand, a large part of natural language syntax seems to be handled quite nicely by a cfg, and the aspects which seem to cause languages to fall outside the cfl class (as string sets) could be considered rather isolated and infrequent. After all, it took nearly thirty years to find one completely convincing example of a natural language which was not context free.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Kluwer Academic Publishers
About this chapter
Cite this chapter
Partee, B.H., Ter Meulen, A., Wall, R.E. (1993). Languages Between Context Free and Context Sensitive. In: Mathematical Methods in Linguistics. Studies in Linguistics and Philosophy, vol 30. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-2213-6_21
Download citation
DOI: https://doi.org/10.1007/978-94-009-2213-6_21
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-277-2245-4
Online ISBN: 978-94-009-2213-6
eBook Packages: Springer Book Archive