Abstract
This chapter concerns experiments with Situation Schemata as a linguistic representation language, in the first instance for Machine Translation purposes but not exclusively so. The work reported is primarily concerned with the adaptation of the Situation Schemata language presented by Fenstad et al. [56] (but see also Fenstad et al. in this volume) to an implementation within grammars having interestingly broad linguistic coverage. We shall also consider the computational tools required for such an implementation and our underlying motivation. The chapter is therefore not solely concerned with the form of the representation language and its relation to any eventual interpretation language, but also with practical and methodological issues associated with the implementation of current theories in Computational Linguistics. A key theme is the interplay between linguistic information, representation and appropriate mechanisms for abstraction.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have