Datr models

Lip until now, no automated system for these insertion tasks existed. INSYST (INserter SYSTem), we describe here, can efficiently insert lexical items under the appropriate nodes in hierarchies. It currently handles hierarchies specified in the DATR formalism (Evans and Gazdar 1989, 1990). The system uses a classification algorithm that maximizes the number of inherited features for each entry.

1p buncha_1 08-05-2013 44 1   Download

The paper shows how the verbal lexicon can be formalised in a way that captures and exploits generalisations about the alternation behaviour of verb classes. An alternation is a pattern in which a number of words share the same relationship between • a pair of senses. The alternations captured are ones where the different senses specify different relationships between syntactic complements and semantic arguments, as between bake in "John is baking the cake" and "The cake is baking". The formal language used is DATR. ...

9p buncha_1 08-05-2013 45 2   Download

In this paper we present a means of defining morphonological phenomena in an inheritance based lexicon. We make use of the theory behind the formal language MOLUSC, in which morphological alternations were defined as mappings between sequences of tree-structured syllables. We discuss how the alternations can be defined in the inheritance-based lexical representation language DATR, and how the phonological aspects can be built upon to bring it closer to an integrated lexicon with representations which can be used by both the morphology and phonology of a language. ...

10p buncha_1 08-05-2013 52 2   Download

One advantage of this bundled information is its reusability, which allows redundancy to be reduced. The representation of lexical information should enable us to express a further kind of generalization, namely the relations between regularity, subregularity, and irregularity. Furthermore, the representation has to be computationaUy tractable and -- possibly with the addition of"syntactic sugar" -- more or less readable for human users.

6p buncha_1 08-05-2013 35 1   Download

Prosodic Inheritance (PI) morphology provides uniform treatment of both concatenative and non-concatenative morphological and phonological generalisations using default inheritance. Models of an extensive range of German Umlaut and Arabic intercalation facts, implemented in DATR, show that the PI approach also covers 'hard cases' more homogeneously and more extensively than previous computational treatments.

6p buncha_1 08-05-2013 32 2   Download

DATR is a declarative language for representing a restricted class of inheritance networks, permitting both multiple and default inheritance. The principal intended area of application is the representation of lexical entries for natural language processing, and we use examples from this domain throughout. In this paper we present the syntax and inference mechanisms for the language.

6p buncha_1 08-05-2013 36 1   Download

We present a notation for the declarative statement of morphological relationships and lexieal rules, based on the traditional notion of Word and Paradigm (cf Hockett 1954). The phenomenon of blocking arises from a generalized version of Kiparsky's (1973) Elsewhere Condition, stated in terms of ordering by subsumption over paradigms. Orthographic constraints on morphemic alternation are described by means of string equations (Siekmann 1975).

8p buncha_1 08-05-2013 42 1   Download

Evans and Gazdar (Evans and Gazdar, 1989a; Evans and Gazdar, 1989b) introduced DATR as a simple, non-monotonic language for representing natural language lexicons. Although a number of implementations of DATR exist, the full language has until now lacked an explicit, declarative semantics. This paper rectifies the situation by providing a mathematical semantics for DATR. We present a view of DATR as a language for defining certain kinds of partial functions by cases. The formal model provides a transparent treatment of DATR's notion of global context....

8p bunmoc_1 20-04-2013 29 2   Download