Search results

Jump to navigation Jump to search

Page title matches

  • ...minimal residue of A. The residue of A is its domain minus its complement domain. ...to X), the checking domain of X consists of UP, ZP, WP and H. The checking domain of H is UP, ZP and WP.
    942 bytes (134 words) - 13:52, 7 October 2007
  • In generative syntax, a '''binding domain''' is a domain in which an [[anaphor]] or [[pronoun]] must or must not be bound. [[local domain]]
    482 bytes (65 words) - 20:38, 14 March 2008
  • #REDIRECT [[Binding domain]]
    28 bytes (3 words) - 20:38, 14 March 2008
  • ...notion in [[checking theory]]. The complement domain is the subset of a [[domain]] reflexively [[dominate]]d by a [[complement]]. In the example, YP is the complement domain of X (and H).
    656 bytes (84 words) - 20:16, 5 May 2008
  • In phonology and morphology, a '''cyclic domain''' is a term used for a morphologically complex string, consisting of a [[b ...''-ity'' (formally represented as ''[[opaque] ity]'') constitute a cyclic domain to which the cyclic stress rules and the cyclic rules of Trisyllabic Shorte
    1 KB (145 words) - 18:06, 22 May 2008
  • '''Domain''' is in [[checking theory]] the domain of a [[head]] A is the set of [[node]]s contained in [[Max(A)]] that are di ...P<sub>2</sub>, X', X<sub>1</sub> and X<sub>2</sub> are not included in the domain of X, since each of these nodes contain X, and X is not distinct from X.
    1 KB (160 words) - 21:04, 12 February 2009
  • '''Governing domain''' is a [[domain]] in which all elements are [[govern]]ed by the same [[governor]]. [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Governing+domain&lemmacode=731 Utrecht Lexicon of Linguistics]
    272 bytes (38 words) - 15:41, 15 February 2009
  • ...[[checking theory]]. The internal domain of A is the minimal [[complement domain]] of A. ...lement domain of X (and H) is YP and everything YP dominates. The internal domain of X (and H) is just YP.
    814 bytes (106 words) - 17:19, 15 February 2009
  • ...ecking theory]]. The minimal domain of X is the smallest subset K of the [[domain]](X) S, such that for any element A of S, some element B of K reflexively d In (i), the minimal domain of X is {UP, ZP, WP, YP, H}. The minimal domain of H is {UP, ZP, WP, YP}.
    876 bytes (123 words) - 18:29, 17 February 2009
  • In linguistics, '''condition on extraction domain''' is a condition of [[bounding theory]] formulated in Huang (1982) which r [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Condition+on+Extraction+Domain&lemmacode=910 Utrecht Lexicon of Linguistics]
    560 bytes (73 words) - 09:19, 11 February 2009

Page text matches

  • '''Domain''' is in [[checking theory]] the domain of a [[head]] A is the set of [[node]]s contained in [[Max(A)]] that are di ...P<sub>2</sub>, X', X<sub>1</sub> and X<sub>2</sub> are not included in the domain of X, since each of these nodes contain X, and X is not distinct from X.
    1 KB (160 words) - 21:04, 12 February 2009
  • ...minimal residue of A. The residue of A is its domain minus its complement domain. ...to X), the checking domain of X consists of UP, ZP, WP and H. The checking domain of H is UP, ZP and WP.
    942 bytes (134 words) - 13:52, 7 October 2007
  • ...notion in [[checking theory]]. The complement domain is the subset of a [[domain]] reflexively [[dominate]]d by a [[complement]]. In the example, YP is the complement domain of X (and H).
    656 bytes (84 words) - 20:16, 5 May 2008
  • ...[[checking theory]]. The internal domain of A is the minimal [[complement domain]] of A. ...lement domain of X (and H) is YP and everything YP dominates. The internal domain of X (and H) is just YP.
    814 bytes (106 words) - 17:19, 15 February 2009
  • ...ecking theory]]. The minimal domain of X is the smallest subset K of the [[domain]](X) S, such that for any element A of S, some element B of K reflexively d In (i), the minimal domain of X is {UP, ZP, WP, YP, H}. The minimal domain of H is {UP, ZP, WP, YP}.
    876 bytes (123 words) - 18:29, 17 February 2009
  • '''Governing domain''' is a [[domain]] in which all elements are [[govern]]ed by the same [[governor]]. [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Governing+domain&lemmacode=731 Utrecht Lexicon of Linguistics]
    272 bytes (38 words) - 15:41, 15 February 2009
  • In generative syntax, a '''binding domain''' is a domain in which an [[anaphor]] or [[pronoun]] must or must not be bound. [[local domain]]
    482 bytes (65 words) - 20:38, 14 March 2008
  • ...a grey dog", whereby the pitch accent is placed on "dog". In (2) the focus domain is narrowed to "dog", as this is the only important word in the word group.
    1 KB (187 words) - 21:04, 13 February 2009
  • ...of a certain domain. The amount of lengthening depends on the depth of the domain boundary: e.g. the amount of final lengthening is much greater for sentence * Cambier-Langeveld, T. 1997. ''The domain of final lengthening in the production of Dutch.,'' In: J. Coerts &amp; H.
    704 bytes (100 words) - 20:57, 13 February 2009
  • ...ain]] of a head with an L-feature. Those L-related positions in a checking domain which are adjoined positions are called 'broadly L-related'; L-related spec
    753 bytes (105 words) - 17:35, 15 February 2009
  • In phonology and morphology, a '''cyclic domain''' is a term used for a morphologically complex string, consisting of a [[b ...''-ity'' (formally represented as ''[[opaque] ity]'') constitute a cyclic domain to which the cyclic stress rules and the cyclic rules of Trisyllabic Shorte
    1 KB (145 words) - 18:06, 22 May 2008
  • A An [[anaphor]] is [[bound]] in its [[binding domain]]. B A [[pronominal]] is [[free]] in its [[binding domain]].
    916 bytes (112 words) - 04:05, 19 March 2008
  • ...ntax, '''clitic climbing''' is a movement of a [[clitic]] out of its local domain. ...iticized on the [[infinitive]]. In (ii) the [[clitic]] is moved out of the domain of the infinitive and cliticized on the matrix verb ''vuole''.
    1 KB (160 words) - 15:13, 28 April 2008
  • ...ry]], the '''residue''' of A is the [[domain]] of A minus its [[complement domain]].
    785 bytes (98 words) - 17:44, 28 September 2014
  • ...s memorized and stored by speakers, and as such their study belongs to the domain of psychology and not linguistics.
    469 bytes (71 words) - 20:59, 16 February 2009
  • ...lement which must be [[A-bound]] by an [[antecedent]] within its [[binding domain]]. ...n person features with ''I'' in (b), and ''John'' is outside the [[binding domain]] in (c).
    1,006 bytes (149 words) - 18:35, 8 January 2011
  • ...enerative syntax, a '''complete functional complex''' (CFC) is the minimal domain (e.g. maximal [[projection]]) in which all [[grammatical function]]s compat
    516 bytes (73 words) - 10:51, 6 May 2008
  • ...he [[binding theory]]. The anomaly is that the noun may define a [[binding domain]].
    567 bytes (81 words) - 21:01, 19 February 2009
  • ...Thus, V'<sub>1</sub> in (iii) is the c-command domain of V. The c-command domain of an element must be a constituent, given that it consists of all the mate *Reinhart, T. 1976. The syntactic domain of anaphora. Diss, MIT.
    4 KB (577 words) - 17:28, 21 June 2014
  • In linguistics, '''condition on extraction domain''' is a condition of [[bounding theory]] formulated in Huang (1982) which r [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Condition+on+Extraction+Domain&lemmacode=910 Utrecht Lexicon of Linguistics]
    560 bytes (73 words) - 09:19, 11 February 2009

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