Simultaneous-distributive coordination and context-freeness
Computational Linguistics
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The relationship between Tree Adjoining Grammars and Head Grammars
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Copying in natural languages, context-freeness, and Queue Grammars
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Chinese number-names, tree adjoining languages, and mild context-sensitivity
Computational Linguistics
Cross-serial dependencies are not hard to process
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Realization of natural language interfaces using lazy functional programming
ACM Computing Surveys (CSUR)
An Efficient Parser for a Class of Contextual Languages
Fundamenta Informaticae
| Hi-index | 0.00 |
A model is presented to characterize the class of languages obtained by adding reduplication to context-free languages. The model is a pushdown automaton augmented with the ability to check reduplication by using the stack in a new way. The class of languages generated is shown to lie strictly between the context-free languages and the indexed languages. The model appears capable of accommodating the sort of reduplications that have been observed to occur in natural languages, but it excludes many of the unnatural constructions that other formal models have permitted.