The aim of this paper is to show how large-scale (computational) grammars of natural language benefit from an organization of semantics which is based on Minimal Recursion Semantics (MRS; Copestake et al. (1999)). This we are doing by providing an account of valence alternations in German based on MRS, showing how such an account makes a computational grammar more efficient and less complicated for the grammar writer.