Reverse Queries in DATR
| dc.creator | Langer, Hagen | |
| dc.date | 1994-11-17 | |
| dc.date.accessioned | 2026-07-07T09:09:40Z | |
| dc.date.available | 2026-07-07T09:09:40Z | |
| dc.description | 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. | |
| dc.description | PostScript, 7 pages | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9411024 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9411024 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151115 | |
| dc.subject | Computation and Language | |
| dc.title | Reverse Queries in DATR | |
| dc.type | text |