Binding theoryとは
WebBinding theory seeks to explain how different kinds of nominal expressions such as … WebOct 29, 2015 · 英語学のBinding Theoryについての質問です。 以下の用例はKuno(1973)で議論された例文である。各種のデータについて、カバーできる事象とできない事象に分け、できない事象については自分なりの解決策を提示せよ。 a. ジョンがメアリーを自分の家で …
Binding theoryとは
Did you know?
http://robtruswell.com/assets/pdfs/Binding_chapter.pdf Webbinding theory says is that they must be bound in the minimal domain whose SUBJECT …
Web“约束理论”(binding theory)，是乔姆斯基以英语代词为语料来研究自然语言代词的句法行 … Web計数indexは、束縛理論(Binding Theory)やコントロール理論(Control Theory) で用いられ …
Webcambridgetextbooksinlinguistics generaleditors: s.r.anderson,j.bresnan,b.comrie, … Webthis theory has subsequently been challenged, but the LGB binding theory remains a landmark. We summarize it in a slightly modified form in Section 2. Following this, Sections 3 and 4 discuss the scope of the binding theory, distinguishing referential dependencies like that of himself from “accidental” coreference. Next, Section 5 dis-
WebUsing binding theory, explain why each of the following sentences is ungrammatical. In …
Webtwo binding conditions in (1): (1) a. An anaphor is bound in its governing category. b. A pronominal is free in its governing category. The conjunction of (la) and (lb) has the consequence that po- sitions in which disjointness of reference is required are exactly positions where anaphor binding is possible, and conversely. crtd in cardiologyWebIn Chomsky's binding theory, (69) is ruled out by both Principles A and C. But in Hellan's version of the binding theory, (69) satisfies the co-argument condition in (39a), the equivalent of Principle A, because Mary and herself are syntactic co-arguments (treat locally head-licenses Mary). It is therefore only with reference to an anti-binding ... build-nummer androidWebダブルバインド（英: Double bind ）とは、ある人が、メッセージとメタメッセージが矛 … buildnummer archicadWebCondition A: An anaphor must be bound in its binding domain. Condition B: A pronoun must be free (=cannot be bound) in its binding domain. Condition C: An R-expression must be free (=cannot be bound). We will assume for the purpose of this class that the binding domain for all referential expressions is the closest TP. crt diagram in computer graphicsWebBinding Conditions for Anaphors (cont.) • An anaphor must have a c-commanding … build nummer exchangeWebという。さらに、(6)での束縛は項束縛(A-binding)、すなわち、X とY が項(argument) の … crtdll.dll downloadWeb1980 年代に集中的に研究された「統率・束縛理論 Government and Binding Theory」に … crtdll.dll not found