Research on Language and Computation

, Volume 6, Issue 1, pp 53–77

Is Adjunction Compositional?

Article

DOI: 10.1007/s11168-008-9045-7

Cite this article as:
Kracht, M. Res on Lang and Comput (2008) 6: 53. doi:10.1007/s11168-008-9045-7

Abstract

This paper shows that there is no compositional TAG for boolean expressions. This indicates that adjunction cannot carry the weight of constructing the semantics compositionally, in contrast to approaches based on discontinuity instead (like Linear Context Free Rewrite Systems). Although the proof is based on the assumption that the semantic functions are partial it seems highly unlikely that allowing partial semantic functions will help.

Keywords

CompositionalityAdjunctionTAG

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  1. 1.Department of LinguisticsUCLALos AngelesUSA