Varieties of crossing dependencies: structure dependence and mild context sensitivity

被引:29
作者
Stabler, EP [1 ]
机构
[1] Univ Calif Los Angeles, Dept Linguist, Los Angeles, CA 90095 USA
关键词
sensitivity; goal; language;
D O I
10.1016/j.cogsci.2004.05.002
中图分类号
B84 [心理学];
学科分类号
04 ; 0402 ;
摘要
Four different kinds of grammars that can define crossing dependencies in human language are compared here: (i) context sensitive rewrite grammars with rules that depend on context, (ii) matching grammars with constraints that filter the generative structure of the language, (iii) copying grammars which can copy structures of unbounded size, and (iv) generating grammars in which crossing dependencies are generated from a finite lexical basis. Context sensitive rewrite grammars are syntactically, semantically and computationally unattractive. Generating grammars have a collection of nice properties that ensure they define only "mildly context sensitive" languages, and Joshi has proposed that human languages have those properties too. But for certain distinctive kinds of crossing dependencies in human languages, copying or matching analyses predominate. Some results relevant to the viability of mildly context sensitive analyses and some open questions are reviewed. (C) 2004 Cognitive Science Society, Inc. All rights reserved.
引用
收藏
页码:699 / 720
页数:22
相关论文
共 87 条
[1]  
ABEILLE A, 2000, TREE ADJOINING GRAMM, P1
[2]  
[Anonymous], 1997, HDB FORMAL LANGUAGES, DOI DOI 10.1007/978-3-642-59136-5_4
[3]  
[Anonymous], 1987, MATH LANGUAGE
[4]  
[Anonymous], P EUR C ASS COMP LIN
[5]  
[Anonymous], LECT NOTES ARTIFICIA
[6]  
[Anonymous], 1949, Human behaviour and the principle of least-effort
[7]  
Baker Mark C, 2001, HDB LINGUISTICS, P265
[8]  
Barton G.E., 1987, Computational Complexity and Natural Language
[9]  
BRESNAN J, 1982, LINGUIST INQ, V13, P613
[10]  
CHOMSKY N, 1956, IRE T INFORM THEOR, V2, P113