Paper: Formal Syntax And Semantics Of Case Stacking Languages

ACL ID C00-1037
Title Formal Syntax And Semantics Of Case Stacking Languages
Venue International Conference on Computational Linguistics
Session Main Conference
Year 2000
Authors

In this l)aper the t)henomenom of case stack- ing is investigated from a formM t)oint of view. We will define a formal language with ide~dized case marking behaviour and prove that stacked cases have the ability to encode structural in- tbrmation on the word thereby allowing tbr un- restricted word order. Furthermore, the case stacks help to comimte this structure with a low complexity bound. As a second part we propose a compositional semantics for languages with stacked cases and show how this proposal may work for our tbrmal language as well as tbr an example from Warlpiri.