Is Adjunction Compositional?
- First Online:
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.
KeywordsCompositionality Adjunction TAG
Unable to display preview. Download preview PDF.
- Frank A., van Genabith J. (2001). LL-based semantics for LTAG – and what it teaches us about LFG and LTAG. In: Butt M., King T.H. (eds) Proceedings of the LFG’01 Conference. University of Hong Kong. CSLI Online PublicationsGoogle Scholar
- Gardent, C., & Kallmeyer, L. (2003). Semantic construction in feature-based TAG. In Proceedings of the 10th Meeting of the European Chapter of the Association for Computational Linguistics, Budapest.Google Scholar
- Gardent, C., & Parmentier, Y. (2005). Large scale semantic construction for tree adjoining grammar. In Proceedings of Logical Aspects in Computational Linguistics. Springer.Google Scholar
- Kracht, M. (2003). The mathematics of language. Number 63 in Studies in Generative Grammar. Mouton de Gruyter, Berlin.Google Scholar
- Kracht, M. (2007). Lectures on interpreted languages and compositionality. Manuscript, UCLA.Google Scholar