Simultaneous-distributive coordination and context-freeness
Computational Linguistics
English and the class of context-free languages
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
On two recent attempts to show that English is not a CFL
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Comments on Pullum's criticisms
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Syntactic and semantic parsability
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
A formal model for context-free languages augmented with reduplication
Computational Linguistics
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Hi-index | 0.00 |
The documentation of (unbounded-length) copying and cross-serial constructions in a few languages in the recent literature is usually taken to mean that natural languages are slightly context-sensitive. However, this ignores those copying constructions which, while productive, cannot be easily shown to apply to infinite sublanguages. To allow such finite copying constructions to be taken into account in formal modeling, it is necessary to recognize that natural languages cannot be realistically represented by formal languages of the usual sort. Rather, they must be modeled as families of formal languages or as formal languages with indefinite vocabularies. Once this is done, we see copying as a truly pervasive and fundamental process in human language. Furthermore, the absence of mirror-image constructions in human languages means that it is not enough to extend Context-free Grammars in the direction of context-sensitivity. Instead, a class of grammars must be found which handles (context-sensitive) copying but not (context-free) mirror images. This suggests that human linguistic processes use queues rather than stacks, making imperative the development of a hierarchy of Queue Grammars as a counterweight to the Chomsky Grammars. A simple class of Context-free Queue Grammars is introduced and discussed.