FROM COMPOSITIONAL TO SYSTEMATIC SEMANTICS

被引:33
作者
ZADROZNY, W
机构
[1] IBM Research, T. J. Watson Research Center, Yorktown Heights, 10598, NY
关键词
D O I
10.1007/BF00985572
中图分类号
H0 [语言学];
学科分类号
030303 ; 0501 ; 050102 ;
摘要
We prove a theorem stating that any semantics can be encoded as a compositional semanties, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when compositional semantics is required to be "systematic" (that is, the meaning function cannot be arbitrary, but must belong to some class), it is possible to distinguish between compositional and noncompositional semantics. As a result, we believe that the paper clarifies the concept of compositionality and opens the possibility of making systematic formal comparisons of different systems of grammar. © 1994 Kluwer Academic Publishers.
引用
收藏
页码:329 / 342
页数:14
相关论文
共 16 条
  • [1] ACZEL P, 1987, LECTURES NON-WELL-FO
  • [2] BARWISE J, 1987, LIAR
  • [3] Barwise Jon., 1975, PERSPECTIVES MATH LO
  • [4] Bloomfield Leonard, 1933, LANGUAGE
  • [5] REGULARITY AND IDIOMATICITY IN GRAMMATICAL CONSTRUCTIONS - THE CASE OF LET ALONE
    FILLMORE, CJ
    KAY, P
    OCONNOR, MC
    [J]. LANGUAGE, 1988, 64 (03) : 501 - 538
  • [6] GUNTER CA, 1993, SEMANTICS PROGRAMMIN
  • [7] HIRST G, 1987, SEMANTIC INTERPRETAT
  • [8] JURAFSKY D, 1992, ON-LINE COMPUTATIONA
  • [9] Keenan EL, 1985, BOOLEAN SEMANTICS NA
  • [10] MANASTERRAMER A, 1990, MATH METHODS LINGUIS