Reverse Queries in DATR
<|reference_start|>Reverse Queries in DATR: 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.<|reference_end|>
@article{langer1994reverse,
    title={Reverse Queries in DATR},
    author={Hagen Langer (University of Osnabrueck, Germany)},
    journal={arXiv preprint arXiv:cmp-lg/9411024},
    year={1994},
    number={Proceedings of COLING-94, Vol. 2, pp. 1089-1095},
    archivePrefix={arXiv},
    eprint={cmp-lg/9411024},
    primaryClass={cmp-lg cs.CL}
}