i+1,?<=1<=?  

作　　者：艾瑞喜 

机构地区：[1]广东外语外贸大学英文学院

出　　处：《现代外语》1998年第2期85+84+86-92,共9页Modern Foreign Languages

摘　　要：本文的目的在于尝试性地量化“ｉ＋１”中的“１”，这样一来，就使得Ｋｒａｓｈｅｎ的置入假说中的一个争论已久的悬案得到一个可能的解决。为达此目的，本文分三部分阐述：第一部分概要描述和分析Ｋｒａｓｈｅｎ的“ｉ＋１”假说。指出他是倾向于Ｃｈｏｍｓｋｙ一派的。第二部分，引进信息论，使得“ｉ＋１”中的“１”的量化得以生成。文章的第三部分对全文做总结，并指出这种“１”he aim of this paper is to tentatively quantify '1' in 'i+1', so that one of them can now be possibly measured. To achieve that, the paper is divided into four parts:Part 1 is the introduction which states the main reason for writing this article.Part 2 deals with a brief description and analysis of 'i+1'. We base most of our concepts about 'i+1' on Krashen′s proposal (1985), which states that humans acquire language by receiving comprehensible input. We move from 'i', our current level, to 'i+1', the next level along the natural order, by understanding input containing 'i+1'. We propose that this idea is in support of Chomsky′s way of thinking about LAD/UG. Based on this, we further propose that this LAD/UG contains an LP, standing for Language Processor, which is responsible for our language calculation. The traditional criticism of Krashen′s input hypothesis, e.g. since none of 'i'and '1' in 'i+1' can be measured, the whole proposal is nonoperational, will also be reviewed. On the basis of the review, we further argue that at least '1' can now be possibly measured. Because the whole idea here is based on the belief that language processing can be treated more or less like a common knowledge, or information processing, the introduction of information theory in this paper is thus necessary. Therefore, part 2 spends a lot of space to discuss the information theory that is relevant to the argument.Part 3 proposes that our Language Processor(LP) works similarly to our general cognitive apparatus, such as KP, standing for Knowledge Processor. The input of information, be it linguistic or nonlinguistic, will first be stored in our STM, standing for Short Term Memory, before reaching either of LP and KP. Although both LP and KP have potentially greater power to process any input information, they are all suppressed by the limited storage capacity of our STM, which, according to Miller(1976), can store at most 7 units of information. In that case, the maximal information that we can handle in our S

关 键 词：置入假说 可理解的语言输入 知识处理器 语言处理器 临时存储器 

分 类 号：TP333[自动化与计算机技术—计算机系统结构] H0[自动化与计算机技术—计算机科学与技术]