Search results

Jump to navigation Jump to search
  • ...man'' and the pair behaves as a [[chain]] with regard to the [[visibility condition]].
    703 bytes (107 words) - 18:04, 19 April 2008
  • ...s important theoretical consequences have been drawn. It follows form this condition that cyclic rules cannot operate on underived lexical items.
    2 KB (216 words) - 08:50, 10 August 2014
  • ...bject Constraint falls under the [[Subject condition]] of Huang's (1982) [[Condition on Extraction Domain]].
    1 KB (200 words) - 18:56, 28 October 2014
  • ...ence, ''each other'' must be [[bound]] within this IP in compliance with [[condition A]] of the [[binding theory]], and may not be coindexed with ''the girls'',
    1 KB (156 words) - 18:21, 17 February 2009
  • The second part of the constraint can now be subsumed under the [[Adjunct Condition]], given that [[extraposition]] is an adjunction operation.
    1 KB (185 words) - 22:40, 13 February 2009
  • '''Truth table''' is the device by which the [[truth condition]]s of a complex [[propositional formula]] can be represented. By means of t
    607 bytes (81 words) - 08:04, 30 August 2014
  • ...rty of being left upward monotone if and only if in a domain of entities E condition (i) holds.
    997 bytes (161 words) - 20:09, 16 February 2009
  • ...tractability (Island conditions) are often designated as the [[Wh-island]] Condition, the [[Complex NP Constraint]] (CNPC), and the [[Coordinate Structure Const
    899 bytes (112 words) - 22:13, 15 February 2009
  • ...-marking is invoked to explain the [[Subject Condition]] and the [[Adjunct Condition]]. EXAMPLE: : only in (ii)a is ''who'' moved out of an L-marked phrase (=/=
    2 KB (252 words) - 07:15, 16 August 2014
  • [[P. Mecner]], The Recoverability Condition in Polish and German. Societas Linguistica Europaea 33rd Annual Meeting, Po Englisch [[recoverability]] (condition) <br>
    2 KB (217 words) - 20:04, 25 July 2014
  • '''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
  • ...S-structure is putatively defined by conditions such as the [[subjacency]] condition.
    610 bytes (78 words) - 15:56, 5 October 2014
  • ...logical languages are both seen as sets of sentences of which the [[truth condition]]s have to be specified relative to a [[model]], an abstract representation
    910 bytes (127 words) - 10:21, 17 February 2009
  • [[island condition]]
    1 KB (171 words) - 17:03, 6 February 2008
  • The notion of connectedness has been resolved under the [[Path Containment Condition]].
    1 KB (158 words) - 20:00, 9 May 2008
  • ...miner D is left downward monotone if and only if in a domain of entities E condition (i) holds.
    1 KB (167 words) - 20:08, 16 February 2009
  • ...ametricality can be assigned by rule and is subject to the [[Peripherality Condition]]<nowiki>: extrametrical elements are always peripheral (found at one edge ...le of the noun ''párent'' is lost in the derived word by the Peripherality Condition and the stress rules reapply. Schematized in the grid:
    2 KB (266 words) - 18:55, 22 June 2019
  • ...lantic Treaty Organization'', ''First Order Principle'' and ''Free Element Condition'', respectively. Some [[Dutch]] examples are: ''TROS'', ''KNAV'' and ''DAF'
    1 KB (140 words) - 17:23, 12 February 2009
  • ...sh ''a/an'' allomorphs (''a book'' vs. ''an apple'') is handled by a Shape Condition.
    759 bytes (104 words) - 19:11, 28 October 2014
  • ...nals are marked as [+pronominal, -anaphoric], and are subject to Binding [[condition B]]. ..., his, him'' in (i)-(iii) are pronominals. With respect to binding theory, condition B states that pronominals may either be [[free]] (as in (i) and (ii)b), or
    2 KB (328 words) - 19:11, 27 September 2014

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