|
Abstract : |
DATR is a declarative representation language for lexical information and as such, in principle, neutral with respect to particular processing strategies. Previous DATR compiler/interpreter systems support only one access strategy that closely resembles the set of inference rules of the procedural semantics of DATR (Evans & Gazdar 1989a). In this paper we present an alternative access strategy (reverse query strategy) for a nontrivial subset of DATR. 1 The Reverse Query Problem DATR (Evans & Gazdar 1989a) has become one of the most widely used formal languages for the representation of lexical information. DATR applications have been developed for a wide variety of languages (including English, Japanese, Kikuyu, Arabic, Latin, and others) and many different subdomains of lexical representation, including inflectional morphology, underspecification phonology, non-concatenative morphophonology, lexical semantics, and tone systems, |
