tailieunhanh - Báo cáo khoa học: "Slacker semantics: why superficiality, dependency and avoidance of commitment"

This paper discusses computational compositional semantics from the perspective of grammar engineering, in the light of experience with the use of Minimal Recursion Semantics in DELPH - IN grammars. The relationship between argument indexation and semantic role labelling is explored and a semantic dependency notation (DMRS) is introduced. approach prevents us from over-committing on the basis of the information available from the syntax. One reflection of this are the formal techniques for scope underspecification which have been developed in computational linguistics. . | Slacker semantics why superficiality dependency and avoidance of commitment can be the right way to go Ann Copestake Computer Laboratory University of Cambridge 15 JJ Thomson Avenue Cambridge UK aac@ Abstract This paper discusses computational compositional semantics from the perspective of grammar engineering in the light of experience with the use of Minimal Recursion Semantics in DELPH-IN grammars. The relationship between argument indexation and semantic role labelling is explored and a semantic dependency notation DMRS is introduced. 1 Introduction The aim of this paper is to discuss work on compositional semantics from the perspective of grammar engineering which I will take here as the development of explicitly linguistically-motivated computational grammars. The paper was written to accompany an invited talk it is intended to provide background and further details for those parts of the talk which are not covered in previous publications. It consists of an brief introduction to our approach to computational compositional semantics followed by details of two contrasting topics which illustrate the grammar engineering perspective. The first of these is argument indexing and its relationship to semantic role labelling the second is semantic dependency structure. Standard linguistic approaches to compositional semantics require adaptation for use in broadcoverage computational processing. Although some of the adaptations are relatively trivial others have involved considerable experimentation by various groups of computational linguists. Perhaps the most important principle is that semantic representations should be a good match for syntax in the sense of capturing all and only the information available from syntax and productive morphology while nevertheless abstracting over semantically-irrelevant idiosyncratic detail. Compared to much of the linguistics literature our analyses are relatively superficial but this is essentially because the .