Search results

Jump to navigation Jump to search

Page title matches

  • '''IS A Condition''' is a condition proposed by Allen (1978) to express two salient facts about compounds: (a) ...is a noun as is ''boat'', and a ''houseboat'' is a kind of boat. The Is A Condition is the predecessor of Williams' (1981a) [[Righthand Head Rule]].
    857 bytes (128 words) - 16:11, 15 February 2009
  • '''I-within-i condition''' is a well-formedness condition in the [[GB]]-framework: ...s co-referential with the containing phrase ''his friend''. The i-within-i condition is relevant to the notion of [[accessibility]]. Also see [[governing catego
    574 bytes (82 words) - 16:04, 15 February 2009
  • '''Adjunct Condition''' is a [[Condition on Extraction Domain]] which forbids [[extraction]] out of an [[adjunct]]. This condition accounts for the ungrammaticality of sentences like (i) and (ii), where a '
    783 bytes (111 words) - 15:00, 22 January 2008
  • '''Well-Formedness Condition''' (WFC) is a condition which governs the way the [[CV skeleton]] has to be associated with the [[m *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Well-Formedness+Condition&lemmacode=84 Utrecht Lexicon of Linguistics]
    997 bytes (141 words) - 18:19, 4 September 2014
  • ...heta criterion]]), and thus subsumes the [[Case filter]]. See also [[Chain condition]]. *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Visibility+condition&lemmacode=118 Utrecht Lexicon of Linguistics]
    579 bytes (81 words) - 08:49, 31 August 2014
  • '''Superiority condition''' is a condition on the application of [[transformation]]s, which states that, if a transfor ...y only once in deriving the [[s-structure]] of a sentence, the superiority condition predicts that in structure (i) ''what'' cannot be moved: ''who'' is superio
    2 KB (236 words) - 08:16, 16 August 2014
  • '''Subject Condition''' is a [[Condition on Extraction Domain]], stating the impossibility of extraction from subjec This condition accounts for the ill-formedness of (i) and (ii), where ''who'' and ''what''
    786 bytes (112 words) - 06:59, 16 August 2014
  • The '''Specified Subject Condition''' is a condition introduced in Chomsky (1973) which states that: *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Specified+Subject+Condition&lemmacode=243 Utrecht Lexicon of Linguistics]
    1 KB (196 words) - 07:59, 4 November 2014
  • '''Specificity Condition''' is a condition on [[movement]] which states that movement out of specific [[NP]]s leads to [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Specificity+Condition&lemmacode=242 Utrecht Lexicon of Linguistics]
    1 KB (164 words) - 07:59, 4 November 2014
  • ...e theta-marker and the [[target]] of theta-marking to be [[sister]]s. This condition is proposed in Chomsky (1986b). [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Sisterhood+Condition&lemmacode=231 Utrecht Lexicon of Linguistics]
    475 bytes (62 words) - 07:34, 3 November 2014
  • ...is the precursor of [[condition A]] of the [[binding theory]]. The Opacity Condition states that [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Opacity+Condition&lemmacode=472 Utrecht Lexicon of Linguistics]
    642 bytes (92 words) - 10:43, 18 February 2009
  • '''Leftness condition''' is a [[condition]] proposed in [[Chomsky]] (1976) which states that a [[pronoun]] cannot be [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Leftness+condition&lemmacode=595 Utrecht Lexicon of Linguistics]
    658 bytes (91 words) - 02:59, 6 August 2021
  • ...not contain anything beyond its input. Proposed in Chomsky (1995:225) as a condition met by the computational system of human language, and taken to imply that A language which meets the inclusiveness condition cannot contain traces or indices left after movement.
    574 bytes (81 words) - 16:58, 15 February 2009
  • '''Felicity condition''' is a convention regulating the appropriate use of [[performative]] utter [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Felicity+condition&lemmacode=746 Utrecht Lexicon of Linguistics]
    672 bytes (94 words) - 03:37, 18 May 2009
  • ...n be no ambiguity of [[government]]. The 'absolute' form of the Minimality Condition states that a [[projection]] of an intermediate head serves as a [[barrier] ...rriers for government when 'a projection' is chosen in (i). The Minimality Condition is intended to exclude ambiguity of government, meaning that barriers creat
    2 KB (350 words) - 07:49, 3 November 2007
  • ...most recently attached by a morphological rule. Intuitively, the Adjacency Condition prevents a word formation rule from looking into the entire derivational hi ...be [klim]<sub>V</sub>]<sub>V</sub> baar]<sub>A</sub>''), and the Adjacency Condition makes the ''-baar'' suffixation rule insensitive to the intransitive nature
    2 KB (315 words) - 15:17, 22 January 2008
  • The '''adjunction condition''' is a condition which says that [[head]]s can [[adjoin]] only to [[head]]s and maximal [[pr *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Adjunction+condition&lemmacode=989 Utrecht Lexicon of Linguistics]
    346 bytes (48 words) - 16:57, 20 September 2014
  • '''Atom Condition''' is a condition on word formation rules proposed in Williams (1981) which says that: ...of their [[head]]s. By replacing the [[Adjacency Condition]] with his Atom Condition, Williams is able to account for the fact the affixation rule which attache
    2 KB (284 words) - 14:47, 15 February 2008
  • In generative syntax, a '''binding condition''' is a condition on the [[binding]] possibilities of certain elements. [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Binding+Condition&lemmacode=830 Utrecht Lexicon of Linguistics]
    348 bytes (44 words) - 20:39, 14 March 2008
  • In genrative syntax, a '''chain condition''' is a wellformedness condition on [[chain]]s, which states that every [[chain]] (a<sub>1</sub>,...,a<sub>n ...[chain]]. This condition restates the [[case filter]] (or the [[visibility condition]]) and the [[Theta criterion]] in terms of [[chain]]s.
    858 bytes (119 words) - 15:30, 21 April 2008
  • '''Condition A''' is one of the [[condition]]s of the [[binding theory]]. *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Condition+A&lemmacode=907 Utrecht Lexicon of Linguistics]
    272 bytes (37 words) - 17:26, 20 September 2014
  • Condition B is one of the [[condition]]s of the [[binding theory]]. *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Condition+B&lemmacode=908 Utrecht Lexicon of Linguistics]
    265 bytes (37 words) - 17:28, 20 September 2014
  • Condition C is one of the [[condition]]s of the [[binding theory]]. *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Condition+C&lemmacode=909 Utrecht Lexicon of Linguistics]
    265 bytes (37 words) - 17:28, 20 September 2014
  • ...ested dependencies, such as the [[Subject condition]] and the [[ECP]]. The condition states that if two paths overlap, one must contain the other. The following [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Path+Containment+Condition&lemmacode=386 Utrecht Lexicon of Linguistics]
    1 KB (210 words) - 16:51, 19 February 2009
  • '''Morpheme Structure Condition (MSC)''' is a condition which expresses regularities about the [[phonological structure]] of [[morp [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Morpheme+Structure+Condition+(MSC)&lemmacode=564 Utrecht Lexicon of Linguistics]
    1 KB (218 words) - 19:11, 17 February 2009
  • ...Move''. In the [[Minimalist Program]], the MLC accounts for [[superiority condition]] effects, [[wh-island]]s, and [[super raising]]. In chapter 4 of the Minim [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Minimal+Link+Condition&lemmacode=1527 Utrecht Lexicon of Linguistics]
    589 bytes (81 words) - 18:23, 17 February 2009
  • '''Tensed-S Condition''' (TSC) is one of the conditions on [[transformation]]s proposed by Chomsk ...erred to as PIC (Propositional Island Condition) or NIC (Nominative Island Condition). More recently, the TSC has been subsumed under the [[binding]] conditions
    2 KB (253 words) - 07:34, 17 August 2014
  • In linguistics, '''condition on extraction domain''' is a condition of [[bounding theory]] formulated in Huang (1982) which restricts the class It includes the [[Subject Condition]] and the [[Adjunct Condition]].
    560 bytes (73 words) - 09:19, 11 February 2009
  • '''First Order Projection Condition''' is a condition proposed in Selkirk (1982) which says that [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=First+Order+Projection+Condition&lemmacode=748 Utrecht Lexicon of Linguistics]
    2 KB (281 words) - 20:57, 13 February 2009
  • A syntactic condition that movement must target a c-commanding position. ...t NP can move to HAVE because movement is known to obey the Proper Binding Condition. In (i), V c-commands N, so the nominal root may move to the light verb as
    963 bytes (111 words) - 13:14, 28 July 2021
  • ...involve categories of both W(ord)-structure and S(entence)-structure. This condition rules out a syntactic analysis of inflection, such as (a) the Affix Hopping *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Word+Structure+Autonomy+Condition&lemmacode=99 Utrecht Lexicon of Linguistics]
    1 KB (140 words) - 18:35, 7 September 2014

Page text matches

  • ...is the precursor of [[condition A]] of the [[binding theory]]. The Opacity Condition states that [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Opacity+Condition&lemmacode=472 Utrecht Lexicon of Linguistics]
    642 bytes (92 words) - 10:43, 18 February 2009
  • '''I-within-i condition''' is a well-formedness condition in the [[GB]]-framework: ...s co-referential with the containing phrase ''his friend''. The i-within-i condition is relevant to the notion of [[accessibility]]. Also see [[governing catego
    574 bytes (82 words) - 16:04, 15 February 2009
  • In linguistics, '''condition on extraction domain''' is a condition of [[bounding theory]] formulated in Huang (1982) which restricts the class It includes the [[Subject Condition]] and the [[Adjunct Condition]].
    560 bytes (73 words) - 09:19, 11 February 2009
  • ...not contain anything beyond its input. Proposed in Chomsky (1995:225) as a condition met by the computational system of human language, and taken to imply that A language which meets the inclusiveness condition cannot contain traces or indices left after movement.
    574 bytes (81 words) - 16:58, 15 February 2009
  • ...ested dependencies, such as the [[Subject condition]] and the [[ECP]]. The condition states that if two paths overlap, one must contain the other. The following [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Path+Containment+Condition&lemmacode=386 Utrecht Lexicon of Linguistics]
    1 KB (210 words) - 16:51, 19 February 2009
  • '''Adjunct Condition''' is a [[Condition on Extraction Domain]] which forbids [[extraction]] out of an [[adjunct]]. This condition accounts for the ungrammaticality of sentences like (i) and (ii), where a '
    783 bytes (111 words) - 15:00, 22 January 2008
  • ...e theta-marker and the [[target]] of theta-marking to be [[sister]]s. This condition is proposed in Chomsky (1986b). [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Sisterhood+Condition&lemmacode=231 Utrecht Lexicon of Linguistics]
    475 bytes (62 words) - 07:34, 3 November 2014
  • In genrative syntax, a '''chain condition''' is a wellformedness condition on [[chain]]s, which states that every [[chain]] (a<sub>1</sub>,...,a<sub>n ...[chain]]. This condition restates the [[case filter]] (or the [[visibility condition]]) and the [[Theta criterion]] in terms of [[chain]]s.
    858 bytes (119 words) - 15:30, 21 April 2008
  • '''Condition A''' is one of the [[condition]]s of the [[binding theory]]. *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Condition+A&lemmacode=907 Utrecht Lexicon of Linguistics]
    272 bytes (37 words) - 17:26, 20 September 2014
  • Condition B is one of the [[condition]]s of the [[binding theory]]. *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Condition+B&lemmacode=908 Utrecht Lexicon of Linguistics]
    265 bytes (37 words) - 17:28, 20 September 2014
  • Condition C is one of the [[condition]]s of the [[binding theory]]. *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Condition+C&lemmacode=909 Utrecht Lexicon of Linguistics]
    265 bytes (37 words) - 17:28, 20 September 2014
  • ...most recently attached by a morphological rule. Intuitively, the Adjacency Condition prevents a word formation rule from looking into the entire derivational hi ...be [klim]<sub>V</sub>]<sub>V</sub> baar]<sub>A</sub>''), and the Adjacency Condition makes the ''-baar'' suffixation rule insensitive to the intransitive nature
    2 KB (315 words) - 15:17, 22 January 2008
  • ...heta criterion]]), and thus subsumes the [[Case filter]]. See also [[Chain condition]]. *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Visibility+condition&lemmacode=118 Utrecht Lexicon of Linguistics]
    579 bytes (81 words) - 08:49, 31 August 2014
  • '''Atom Condition''' is a condition on word formation rules proposed in Williams (1981) which says that: ...of their [[head]]s. By replacing the [[Adjacency Condition]] with his Atom Condition, Williams is able to account for the fact the affixation rule which attache
    2 KB (284 words) - 14:47, 15 February 2008
  • '''IS A Condition''' is a condition proposed by Allen (1978) to express two salient facts about compounds: (a) ...is a noun as is ''boat'', and a ''houseboat'' is a kind of boat. The Is A Condition is the predecessor of Williams' (1981a) [[Righthand Head Rule]].
    857 bytes (128 words) - 16:11, 15 February 2009
  • The '''adjunction condition''' is a condition which says that [[head]]s can [[adjoin]] only to [[head]]s and maximal [[pr *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Adjunction+condition&lemmacode=989 Utrecht Lexicon of Linguistics]
    346 bytes (48 words) - 16:57, 20 September 2014
  • In generative syntax, a '''binding condition''' is a condition on the [[binding]] possibilities of certain elements. [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Binding+Condition&lemmacode=830 Utrecht Lexicon of Linguistics]
    348 bytes (44 words) - 20:39, 14 March 2008
  • ...particular type of [[generalized quantifier]] Q (Q =/= 0) which obeys the condition in (i): ...e'' N are examples of ideals; ''not all'' N and ''at most'' N are not. The condition in (i) captures the contrast in (ii).
    766 bytes (131 words) - 16:11, 15 February 2009
  • ...Move''. In the [[Minimalist Program]], the MLC accounts for [[superiority condition]] effects, [[wh-island]]s, and [[super raising]]. In chapter 4 of the Minim [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Minimal+Link+Condition&lemmacode=1527 Utrecht Lexicon of Linguistics]
    589 bytes (81 words) - 18:23, 17 February 2009
  • '''Subject Condition''' is a [[Condition on Extraction Domain]], stating the impossibility of extraction from subjec This condition accounts for the ill-formedness of (i) and (ii), where ''who'' and ''what''
    786 bytes (112 words) - 06:59, 16 August 2014
  • #REDIRECT[[Morpheme Structure Condition]]
    41 bytes (4 words) - 19:11, 17 February 2009
  • ...cy condition subsumes both the [[Complex NP Constraint]] and the [[Subject Condition]]. The main principle of bounding theory is the [[Subjacency condition]], which forbids movement across more than one [[bounding node]].
    2 KB (245 words) - 15:37, 20 April 2008
  • ...''himself'' can be coreferential with ''Bill'' in (apparent) violation of Condition A. The co-referentiality of (ii) is considered one of logophoricity.
    951 bytes (143 words) - 10:17, 17 February 2009
  • ...[[phrase]], or if it is a 'designated element'. Part of the recoverability condition is subsumed under the [[ECP]]. See [[deletion]].
    568 bytes (78 words) - 08:33, 28 September 2014
  • ...with that relation. The name '''crossover''' derives from Ross's Crossover Condition: This condition accounts for the ill-formedness of the following sentence: the [[NP]] ''whi
    1 KB (165 words) - 16:02, 22 May 2008
  • ...not have to obey the [[Tensed-S Condition]] (TSC) and [[Specified Subject Condition]] (SSC) when moving to the next higher COMP. Thus, COMP functions as an esc
    1 KB (191 words) - 17:04, 13 February 2009
  • '''Leftness condition''' is a [[condition]] proposed in [[Chomsky]] (1976) which states that a [[pronoun]] cannot be [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Leftness+condition&lemmacode=595 Utrecht Lexicon of Linguistics]
    658 bytes (91 words) - 02:59, 6 August 2021
  • ...involve categories of both W(ord)-structure and S(entence)-structure. This condition rules out a syntactic analysis of inflection, such as (a) the Affix Hopping *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Word+Structure+Autonomy+Condition&lemmacode=99 Utrecht Lexicon of Linguistics]
    1 KB (140 words) - 18:35, 7 September 2014
  • More recently, the case filter has been reduced to the [[visibility condition]]. [[chain condition]]
    893 bytes (131 words) - 16:46, 9 April 2008
  • ...''a'' and coindexing of ''a'' and ''i'' would not violate the [[i-within-i condition]]. Also: condition on bound variable pronouns proposed in Higginbotham (1980) which accounts f
    646 bytes (82 words) - 17:53, 12 June 2014
  • ...Thus, Siegel's (1978) [[Adjacency Condition]] or Williams' (1981a) [[Atom Condition]] can be reduced to the Bracket Erasure Convention. *Siegel, D. 1978. The Adjacency Condition and the Theory of Morphology. ''NELS VIII'', 189-197.
    2 KB (227 words) - 15:40, 20 April 2008
  • ...n be no ambiguity of [[government]]. The 'absolute' form of the Minimality Condition states that a [[projection]] of an intermediate head serves as a [[barrier] ...rriers for government when 'a projection' is chosen in (i). The Minimality Condition is intended to exclude ambiguity of government, meaning that barriers creat
    2 KB (350 words) - 07:49, 3 November 2007
  • ...e [[head]] of a [[chain]] to the foot of the chain. See [[Path Containment Condition]].
    311 bytes (47 words) - 16:52, 19 February 2009
  • ...[[Theta-position]] without [[Case]]. NP-traces are anaphors, hence obey [[condition A]] of the [[binding theory]].
    330 bytes (44 words) - 19:35, 17 February 2009
  • '''Morpheme Structure Condition (MSC)''' is a condition which expresses regularities about the [[phonological structure]] of [[morp [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Morpheme+Structure+Condition+(MSC)&lemmacode=564 Utrecht Lexicon of Linguistics]
    1 KB (218 words) - 19:11, 17 February 2009
  • '''Well-Formedness Condition''' (WFC) is a condition which governs the way the [[CV skeleton]] has to be associated with the [[m *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Well-Formedness+Condition&lemmacode=84 Utrecht Lexicon of Linguistics]
    997 bytes (141 words) - 18:19, 4 September 2014
  • ...oposes five global economy conditions: [[Last Resort]], the [[Minimal Link Condition]], [[Fewest Steps]], [[Procrastinate]] and [[Greed]]. These conditions comp A global version of the Minimal Link Condition (MLC) would compare the following two derivations:
    2 KB (277 words) - 15:36, 15 February 2009
  • A syntactic condition that movement must target a c-commanding position. ...t NP can move to HAVE because movement is known to obey the Proper Binding Condition. In (i), V c-commands N, so the nominal root may move to the light verb as
    963 bytes (111 words) - 13:14, 28 July 2021
  • '''First Order Projection Condition''' is a condition proposed in Selkirk (1982) which says that [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=First+Order+Projection+Condition&lemmacode=748 Utrecht Lexicon of Linguistics]
    2 KB (281 words) - 20:57, 13 February 2009
  • '''Superiority condition''' is a condition on the application of [[transformation]]s, which states that, if a transfor ...y only once in deriving the [[s-structure]] of a sentence, the superiority condition predicts that in structure (i) ''what'' cannot be moved: ''who'' is superio
    2 KB (236 words) - 08:16, 16 August 2014
  • '''Tensed-S Condition''' (TSC) is one of the conditions on [[transformation]]s proposed by Chomsk ...erred to as PIC (Propositional Island Condition) or NIC (Nominative Island Condition). More recently, the TSC has been subsumed under the [[binding]] conditions
    2 KB (253 words) - 07:34, 17 August 2014
  • The '''Specified Subject Condition''' is a condition introduced in Chomsky (1973) which states that: *[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Specified+Subject+Condition&lemmacode=243 Utrecht Lexicon of Linguistics]
    1 KB (196 words) - 07:59, 4 November 2014
  • '''Specificity Condition''' is a condition on [[movement]] which states that movement out of specific [[NP]]s leads to [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Specificity+Condition&lemmacode=242 Utrecht Lexicon of Linguistics]
    1 KB (164 words) - 07:59, 4 November 2014
  • A verb expressing a meteorological condition, such as ''rain'' or ''snow'', which is a predicate either without an argum
    458 bytes (61 words) - 18:15, 4 September 2014
  • ...theory]]<nowiki>: since </nowiki>''her'' is a [[pronominal]] it must obey condition B which says that ''she'' may not locally [[bind]] ''her''. It is assumed t
    881 bytes (134 words) - 20:47, 12 February 2009
  • '''Right Roof Constraint''' is a condition on [[rightward movement]] first formulated by Ross (1967:185): This condition captures the fact that rightward movement is upward bounded, as the followi
    1 KB (208 words) - 18:24, 28 September 2014
  • This condition accounts for the ungrammaticality of the sentence:
    766 bytes (116 words) - 10:59, 6 May 2008
  • ...y's (1976) [[Leftness condition]], Higginbotham's (1980) [[Accessibility]] Condition, Safir's (1984) PCOB, Reinhart's (1983) S-Structure c-command requirement.
    2 KB (356 words) - 02:48, 6 August 2021
  • '''Licensing''' is a it has been proposed that [[well-formedness condition]]s on [[syntactic structure]] (esp. the principle of [[Full Interpretation]
    823 bytes (122 words) - 20:56, 16 February 2009
  • ...ential expressions. With respect to [[binding theory]], R-expressions obey condition C, which says that they must be [[A-free]]. This explains the illformedness
    1 KB (158 words) - 14:50, 20 February 2009

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)