David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Linguistics and Philosophy 20 (6):607-636 (1997)
This paper classifies a family of grammar formalisms that extendcontext-free grammar by talking about tuples of terminal strings, ratherthan independently combining single terminal words into larger singlephrases. These include a number of well-known formalisms, such as headgrammar and linear context-free rewriting systems, but also a new formalism,(simple) literal movement grammar, which strictly extends the previouslyknown formalisms, while preserving polynomial time recognizability.The descriptive capacity of simple literal movement grammars isillustrated both formally through a weak generative capacity argument and ina more practical sense by the description of conjunctive cross-serialrelative clauses in Dutch. After sketching a complexity result and drawing anumber of conclusions from the illustrations, it is then suggested that thenotion of mild context-sensitivity currently in use, that depends on therather loosely defined concept of constant growth, needs a modification toapply sensibly to the illustrated facts; an attempt at such a revision isproposed.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
Edward P. Stabler (2004). Varieties of Crossing Dependencies: Structure Dependence and Mild Context Sensitivity. Cognitive Science 28 (5):699-720.
Similar books and articles
David E. Johnson & Lawrence S. Moss (1994). Grammar Formalisms Viewed as Evolving Algebras. Linguistics and Philosophy 17 (6):537 - 560.
Anselm K. Min (2008). D. Z. Phillips on the Grammar of "God". International Journal for Philosophy of Religion 63 (1/3):131 - 146.
Yael Sygal & Shuly Wintner (2009). Associative Grammar Combination Operators for Tree-Based Grammars. Journal of Logic, Language and Information 18 (3):293-316.
Stephan Kepser & Jim Rogers (2011). The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars. Journal of Logic, Language and Information 20 (3):361-384.
Maria Bulińska (2009). On the Complexity of Nonassociative Lambek Calculus with Unit. Studia Logica 93 (1):1 - 14.
Makoto Kanazawa (2010). Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars. Journal of Logic, Language and Information 19 (2):137-161.
M. Kudlek, C. Martín-Vide, A. Mateescu & V. Mitrana (2003). Contexts and the Concept of Mild Context-Sensitivity. Linguistics and Philosophy 26 (6):703 - 725.
Philippe de Groote & Sylvain Pogodalla (2004). On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms. [REVIEW] Journal of Logic, Language and Information 13 (4):421-438.
Lawrence S. Moss & David E. Johnson (1995). Dynamic Interpretations of Constraint-Based Grammar Formalisms. Journal of Logic, Language and Information 4 (1):61-79.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #306,509 of 1,089,094 )
Recent downloads (6 months)0
How can I increase my downloads?