Reverse queries in DATR

Authors:
Hagen Langer
Affiliations:
University of Osnabrück, Germany
Venue:
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Year:
1994

Citing 4
Cited 3

The semantics of DATR

Proceedings of the Seventh Conference (AISB89) on Artificial Intelligence and Simulation of Behaviour
Making DATR work for speech: lexicon compilation in SUNDIAL

Computational Linguistics - Special issue on inheritance: II
Morphonology in the lexicon

EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Inference in DATR

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics

DATR: a language for lexical knowledge representation

Computational Linguistics
DATR theories and DATR models

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Encoding Lexicalized Tree Adjoining Grammars with a nonmonotonic inheritance hierarchy

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

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 non-trivial subset of DATR.