检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王晨 WANG Chen
机构地区:[1]南京理工大学外国语学院
出 处:《当代语言学》2023年第4期595-610,共16页Contemporary Linguistics
基 金:江苏省社科基金青年项目“新建构主义句法理论动态和发展前景研究”(20YYC014)的阶段性成果。
摘 要:词库与句法之争贯穿生成语法的发展历史,在为无语类特征的词根定类这一问题上体现得尤为明显。本文认为词根定类的分歧可以归纳为五点:1)词库是否具有生成性;2)词根是否具有原始语类;3)词根定类是否依赖抽象语素;4)定类成分的语音形态是否影响句法推导;5)是否允许无语音形式的定类成分存在。在上述问题上持不同观点的流派,如词汇主义句法派、新建构主义句法派等,提出了词汇-语音式、分布式形态学、句法环境定类等数种词根定类的理论。本文从词根假设的必要性出发,逐一分析上述三类词根定类算法的基础模式、主要依据以及它们各自所面临的问题,以期对相关问题做一个宏观阐述并探讨可能的发展方向。There has been constant tension between lexicon and syntax through the evolutionary history of generative grammar,especially in dealing with roots and the source of their syntactic categories.This paper proposes that the disputes over the categorization process can be summarized into five problems:1)whether the lexicon is generative;2)whether roots have proto-categories before syntactic computation;3)whether the categorization of roots depends on abstrac morphemes;4)whether the morpho⁃phonological form of categorizers plays a role in syntactic derivation;5)whether roots can get categories from categorizers with no phonological forms.The different views towards these problems have developed into the lexicalist approach and the neo⁃constructionist approach to syntax.These different approaches to categorization have proposed various labeling algorithms such as the lexico⁃phonological approach,Distributed Morphology,and contextual categorization,which differ in the hypothesis towards the very nature of roots.This paper begins with the necessity of categorizing a root in syntactic studies and discusses the basic frameworks,major arguments,and significant problems of these algorithms,in order to provide an overview for the current debate over this issue as well as to make a prediction of the future development of generative grammar.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7