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...

In computational modeling of natural language phenomena, there are at least three modes of research. The currently dominant statistical paradigm typically prioritizes instance coverage: Data-driven methods seek to use as much information observed in data as possible in order to generalize linguistic analyses to unseen instances. A second approach prioritizes detailed description of grammatical ...

Approaches to NL syntax conform in varying degrees to the older relational/dependency model, (essentially that assumed in traditional grammar), which treats a sentence as a group of words united by various relations, and the newer constituent model. Some modern approaches have nonetheless involved shifts away from essentially constituent-based models of the sort associated with Bloomfield and C...

Abstract This article argues that phonological features have no substantive properties, instead, segments are assigned by learning strategies set to the task of devising a computational system for phonology is consistent with requirements UG. I address two problems such substance-free model. The first Card-Grammar problem, which has been suggested argue universal features, on premise that, othe...

In computational modeling of natural language phenomena, there are at least three modes of research. The currently dominant statistical paradigm typically prioritizes instance coverage: Data-driven methods seek to use as much information observed in data as possible in order to generalize linguistic analyses to unseen instances. A second approach prioritizes detailed description of grammatical ...

A reversible grammar is usually understood as a computational or linguistic system that can be used both for analysis ~nd generation of the language it defines. For example, a directive pars_gen (Sent,For~n) would assign, depending upon the binding status Of its arguments, the representation in (Toronto,chased (Fido,John )) to the sentence Fido chased John in To~onto, or it would produce one of...

The paper analyses the application of DATR language for lexical knowledge presentation for interpreting Bulgarian inflectional morphology. It discuss the semantic network of the feature of definiteness in Bulgarian language and compares the lexical knowledge representation for the different part-of-speech with respect to the defined grammar rules, the sound alternations, the related formal pres...