CAJ | 학술논문

范畴语法的最早形式是 AB-演算，目前已发展成为一系列相互联系的形式系统，它们把句法分析和语义分析视为基于类型的推理。范畴语法的两个最完善的分支是基于逻辑传统的范畴类型逻辑和基于组合传统的组合范畴语法，二者联系紧密，差异也明显，前者主要关心不同逻辑算子对语言的适用性和逻辑系统的证明论性质，认为生成能力不具有主要的理论意义，在计算应用中没有价值；后者更多集中在获得低的自动机理论能力和良好计算性质的语言表达系统。
범주어법적최조형식시 AB-연산，목전이발전성위일계렬상호련계적형식계통，타문파구법분석화어의분석시위기우류형적추리。범주어법적량개최완선적분지시기우라집전통적범주류형라집화기우조합전통적조합범주어법，이자련계긴밀，차이야명현，전자주요관심불동라집산자대어언적괄용성화라집계통적증명론성질，인위생성능력불구유주요적이론의의，재계산응용중몰유개치；후자경다집중재획득저적자동궤이론능력화량호계산성질적어언표체계통。
Categorial Grammar originated in the AB-calculus,and now encompasses a range of relat-ed formalisms that treat both syntactic and semantic analysis as type-based inference.The two com-plete extensions of the AB-calculus are the Categorial Type Logics based on the logical tradition and the Combinatory Categorial Grammar based on the combinatory tradition.They are closely related to each other but obvious differences still remain.The former is largely concerned with the linguistic ap-plicability of different logical operators and proof-theoretical properties of the proposed logical sys-tems.For CTL researchers,issues of generative capacity are not considered to be of prime theoretical importance,and CTL has little use in computational applications.The latter focuses more on obtai-ning linguistically expressive systems with low automata-theoretic power and attractive computational properties.