ii
IntroductionThe ComAComA workshop is an interdisciplinary platform for researchers working on compound processing in different languages, to present recent and ongoing work.The workshop has several related aims. Firstly, it brings together researchers from different backgrounds (e.g., computational linguistics, linguistics, neurolinguistics, psycholinguistics, language technology) to discuss and evaluate compound processing each from their own point of view. Secondly, based on the interaction between the participants, the workshop provides an overview of existing and desired resources for future research in this area. Finally, we expect that the interdisciplinary approach of the workshop will result in better methodologies to evaluate compound processing systems from different perspectives.Given the high productivity of compounding in a wide range of languages, compound processing is an interesting subject in linguistics, computational linguistics, and other applied disciplines. For example, for many language technology applications, compound processing remains a challenge (both morphologically and semantically), since novel compounds are created and interpreted on the fly. In order to deal with this productivity, systems that can analyse new compound forms and their meanings need to be developed. From an interdisciplinary perspective, we also need to better understand the process of compounding (as a cognitive process), in order to model its complexity.iii
AbstractGerman particle verbs are a type of multi word expression which is often compositional with respect to a base verb. If they are compositional they tend to express the same types of semantic arguments, but they do not necessarily express them in the same syntactic subcategorization frame: some arguments may be expressed by differing syntactic subcategorization slots and other arguments may be only implicit in either the base or the particle verb. In this paper we present a method which predicts syntactic slot correspondences between syntactic slots of base and particle verb pairs. We can show that this method can predict subcategorization slot correspondences with a fair degree of success.