From compositional to systematic semantics
| dc.creator | Zadrozny, Wlodek | |
| dc.date | 1995-03-24 | |
| dc.date.accessioned | 2026-07-07T09:09:44Z | |
| dc.date.available | 2026-07-07T09:09:44Z | |
| dc.description | We prove a theorem stating that any semantics can be encoded as a compositional semantics, 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 non-compositional semantics. As a result, we believe that the paper clarifies the concept of compositionality and opens a possibility of making systematic formal comparisons of different systems of grammars. | |
| dc.description | 11 pp. Latex.; | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9503024 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9503024 | |
| dc.identifier | Linguistics and Philosophy(17):329-342, 1994 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151140 | |
| dc.subject | Computation and Language | |
| dc.title | From compositional to systematic semantics | |
| dc.type | text |