접속의 최소주의 문법

Abstract

In natural languages, there are two types of coordination―structured vs. unstructured coordination. These two coordination constructions are formed by the set-forming operation FORMSET(FS). FS applies to a work space WS, forming the set Y = {X1, …, Xn}, Xi ∈ WS by minimal search, and is so-called ‘the third factor’ compatible, which means that FS comes free. The distinction between structured and unstructured coordination stems from the modes of application of FS. Assuming WS = {α, β, γ}, if FS applies only once forming {α, β, γ}, then the unstructured coordination construction appears but if FS applies twice forming {{α, β}, γ} or {α, {β, γ}}, then the structured coordination construction appears. With the structure building operation, there must be a labeling algorithm LA. Regarding LA, the subcate- gorization feature is counted as a agreement feature. Finally, FS plus language- specific conditions yields merge.