ebooksgratis.com

See also ebooksgratis.com: no banners, no cookies, totally FREE.

CLASSICISTRANIERI HOME PAGE - YOUTUBE CHANNEL
Privacy Policy Cookie Policy Terms and Conditions
Merge (linguistics) - Wikipedia, the free encyclopedia

Merge (linguistics)

From Wikipedia, the free encyclopedia

Merge (usually capitalized) is one of the basic operations in the Minimalist Program, a leading approach to generative syntax, when two (adjacent) syntactic objects make up a new syntactic unit. Essentially, it is a manifestation of recursion, which many scholars claim to be a fundamental characteristic of language and mind in general, or, as Noam Chomsky (1999) puts it, Merge is "an indispensable operation of a recursive system ... which takes two syntactic objects A and B and forms the new object G={A,B}" (p. 2).

In the Minimalist Program Merge is triggered by feature checking, e.g. the verb "eat" selects the noun "cheesecake" because the verb has an uninterpretable N-feature [uN] ("u" stands for "uninterpretable") which must be checked (or deleted), due to Full Interpretation. By saying that this verb has a nominal uninterpretable feature we rule out such ungrammatical constructions as *eat beautiful (the verb selects an adjective). Schematically it can be illustrated as:

  
          V
  ________|_________
 |                 |
eat [V, uN]   cheesecake [N]

Chomsky (2001) distinguishes between external and internal Merge: if A and B are separate objects then we deal with external Merge; if either of them is part of the other it is internal Merge.

In other approaches to generative syntax, such as Head-driven phrase structure grammar and Lexical functional grammar, there is no precise analogue to Merge. However, in these theories, feature structures are used to account for many of the same facts.

[edit] References

  • Adger, D. (2003). Core syntax: A Minimalist approach. Oxford: Oxford University Press. ISBN 0199243700. 
  • Chomsky, N. (1999). Derivation by phase. Cambridge, MA: MIT. 
  • Chomsky, N. (2001). Beyond explanatory adequacy. Cambridge, MA: MIT. 
Languages


aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - bcl - be - be_x_old - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - co - cr - crh - cs - csb - cu - cv - cy - da - de - diq - dsb - dv - dz - ee - el - eml - en - eo - es - et - eu - ext - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gan - gd - gl - glk - gn - got - gu - gv - ha - hak - haw - he - hi - hif - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kaa - kab - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mdf - mg - mh - mi - mk - ml - mn - mo - mr - mt - mus - my - myv - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - quality - rm - rmy - rn - ro - roa_rup - roa_tara - ru - rw - sa - sah - sc - scn - sco - sd - se - sg - sh - si - simple - sk - sl - sm - sn - so - sr - srn - ss - st - stq - su - sv - sw - szl - ta - te - tet - tg - th - ti - tk - tl - tlh - tn - to - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu -