DATR Theories and DATR Models
| dc.creator | Keller, Bill | |
| dc.date | 1995-05-02 | |
| dc.date.accessioned | 2026-07-07T09:09:48Z | |
| dc.date.available | 2026-07-07T09:09:48Z | |
| dc.description | Evans and Gazdar 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. It is shown that DATR's default mechanism can be accounted for by interpreting value descriptors as families of values indexed by paths. | |
| dc.description | 8 pages, LATEX, uses aclap.sty, Procs. ACL95 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9505004 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9505004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151165 | |
| dc.subject | Computation and Language | |
| dc.title | DATR Theories and DATR Models | |
| dc.type | text |