Abstract
We describe minimal recursion semantics (MRS), a framework for computational semantics which simplifies the design of algorithms. We have integrated an implementation of MRS with an HPSG grammar for both parsing and generation that enables a simple formulation of the grammatical constraints on lexical and phrasal semantics. We discuss why, in general, a semantic representation with minimal structure is desirable and illustrate how a descriptively adequate representation with a nonrecursive structure may be achieved.
Users
Please
log in to take part in the discussion (add own reviews or comments).