Finite models of infinite language a connectionist approach to recursion
➤ Gửi thông báo lỗi ⚠️ Báo cáo tài liệu vi phạmNội dung chi tiết: Finite models of infinite language a connectionist approach to recursion
Finite models of infinite language a connectionist approach to recursion
Finite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursionversity of WarwickRunning head: Finite models of languageAddress for correspondence: Morten H. Christiansen Department of Psychology Southern Illinois University Carbondale, IL 62901-6502 Phone: (618) 453-3547 Fax: (618) 453-3563 Email: morten@siu.edu1 IntroductionIll linguistics and psycholinguisti Finite models of infinite language a connectionist approach to recursioncs, it is standard to assume that natural language involves rare but important recursive constructions. This assumption originates with Chomsky’s (195Finite models of infinite language a connectionist approach to recursion
7, 1959, 1965) arguments that the grammars for natural languages exhibit potentially unlimited recursion. Chomsky assumed that, if the grammar allows Finite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursionarbitrarily many levels of recursion, generating, for example, (2) and(3).-1The mouse that the cat bit ran away.-2The mouse that the cat that the dog chased bit ran away.-3The mouse that the cat that the dog that the man frightened chased bit ran away.But people can only deal easily with relatively Finite models of infinite language a connectionist approach to recursionsimple recursive structures (e.g.. Bach, Brown & Marslen-Wilson. 1986). Sentences like (2) and (3) are extremely difficult to process.Note that the idFinite models of infinite language a connectionist approach to recursion
ea that natural language is recursive requires broadening the notion of which sentences are in the language, to include sentences like (2) ami (3). ToFinite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursionlinguistic competence and human performance. Competence refers to a speaker/hearer’s knowledge of the language, as studied by linguistics. In contrast, psycholinguists study performance i.e., how linguistic knowledge is used in language processing, and how non-linguistic factors interfere with using Finite models of infinite language a connectionist approach to recursion that knowledge. Such “performance factors" are invoked to explain why some sentences, while consistent with linguistic competence, will not be said oFinite models of infinite language a connectionist approach to recursion
r understood.The claim that language allows unbounded recursion has two key implications. First, processing unbounded recursive structures requires unFinite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursion child’s language input contain so few recursive constructions. These implications struck at the heart of the then-dominant approaches to language. Both structural linguistics and behaviorist psychology (e.g., Skinner 1957) lacked the generative mechanisms to explain unbounded recursive structures. Finite models of infinite language a connectionist approach to recursionAnd the problem of learning recursion undermined both the learning mechanisms described by the behaviorists, and the corpus-based methodology of strucFinite models of infinite language a connectionist approach to recursion
tural linguistics. More importantly, for current cognitive science, both problems appear to apply to connectionisI models of language. Connectionist nFinite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursionand connectionist models learn by a kind of associative learn ing algorithm, more elaborate than, but similar in spirit to. that postulated by behaviorism. Furthermore, connectionist models attempt to learn the structure of the language from finite corpora, echoing the corpus-based methodology of st Finite models of infinite language a connectionist approach to recursionructural linguistics. Thus, it seems that Chomsky’s arguments from the 1950s and 1900s may rule out. or at least, limit the scope of. current connectiFinite models of infinite language a connectionist approach to recursion
onist models of language processing.One defense of finite state models of language processing, to which the connectionist might turn, is that connecliFinite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursiontence (e.g.. Christiansen, 1992), as the above examples illustrate. Perhaps, then, finite state models can model actual human language processing successfully.'This defense elicits a more sophisticated form of the original argument: that what is important about generative grammar is nol that it allo Finite models of infinite language a connectionist approach to recursionws arbitrarily complex strings, but that it gives simple rules capturing ỉtỊỊUỈariiies in language. All adequate model of language processing must somFinite models of infinite language a connectionist approach to recursion
ehow embody grammatical knowledge that can capture these regularities. In symbolic computational linguistics, this is done by representing grammaticalFinite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursion, in practice they are bounded by the finiteness of the underlying hardware. Thus, a symbolic model of language processing, such as CC-READER (Just & Carpenter. 1992), embodies the competence-performance distinction in this way. Its grammatical competence consists of a set of recursive production ru Finite models of infinite language a connectionist approach to recursionles which are applied to produce state changes in a working memory. Limitations on the working memory’s capacity explain performance limitations withoFinite models of infinite language a connectionist approach to recursion
ut making changes to the competence part of the model. Thus a finite processor, CC-READER, captures underlying recursive structures. Unless connectionFinite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursionefore, the unbounded recursive structure of natural language is not axiomatic. Nor need the suggestion that a speaker/hearer’s knowledge of the language captures such infinite recursive structure be taken for granted. Rather, the view that “unspeakable” sentences which accord with recursive rules fo Finite models of infinite language a connectionist approach to recursionrm a part of the knowledge of language is an assumption of the standard view of language pioneered by Chomsky and now dominant in linguistics and muchFinite models of infinite language a connectionist approach to recursion
of psycholinguistics. The challenge for a connectionist model is to account for those aspects of human comprehension/production performance that suggFinite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursionecursion, or that arbitrarily complex recursive structures really are sentences of the language, then they may present a viable, and radical, alternative to the standard ’generative’ view of language and language processing.Therefore, in assessing the connectionist simulations that we report below, Finite models of infinite language a connectionist approach to recursionwhich focuses on natural language recursion, we need not require that conncctionist systems be able to handle recursion in full generality. Instead, tFinite models of infinite language a connectionist approach to recursion
he benchmark for performance of connectionist systems will beset by human abilities to handle recursive structures. Specifically, the challenge for coFinite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursiondled. This requires (a) handling recursion at a comparable level to human performance, and (b) learning from exposure and generalizing to novel recursive constructions. Meeting this challenge involves providing a new account of people’s limited ability to handle natural language recursion, without a Finite models of infinite language a connectionist approach to recursionssuming an internally represented grammar which allows unbounded recursion i.e., without invoking the competence/performance distinction.1Here, we conFinite models of infinite language a connectionist approach to recursion
sider natural language recursion in a highly simplified form. We train con-nectionist networks on small artificial languages that exhibit the differenFinite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursion associative and finite state models of language processing. Considering recursion in a pure form permits US to address the in-principle viability of connectionist networks in handling recursion, just as simple artificial languages have been used to assess the feasibility of symbolic parameter-setti Finite models of infinite language a connectionist approach to recursionng approaches to language acquisition (Gibson &L Wexler, 1994: Niyogi & Berwick, 1996).The structure of this chapter is as follows. We begin by distinFinite models of infinite language a connectionist approach to recursion
guishing varieties of recursion in natural language. We then summarize past connectionist research on natural language recursion. Next, we introduce tFinite models of infinite language: A conncctionist approach to recursionMorten H. ChristiansenSouthern Illinois University, CarbondaleNick ChaterUniv Finite models of infinite language a connectionist approach to recursione languages. These results suggest that the networks handle recursion to a degree comparable with humans. We close with conclusions for the prospects of connectionist models of language processing.2 Varieties of RecursionChomsky (1957) introduced the notion of a recursive generative grammar. Early g Finite models of infinite language a connectionist approach to recursionenerative grammars were assumed to consisted of phrase structure rules and transformational rules (which we shall not consider below). Phrase structurFinite models of infinite language a connectionist approach to recursion
e rules have the form A —* BC, meaning4https://khothuvien.cori!that the symbol A can be replaced by the concatenation of B and c. A phrase structure rGọi ngay
Chat zalo
Facebook