Abstract | ||
---|---|---|
Evans and Gazdar (Evans and Gazdar, 1989a; Evans and Gazdar, 1989b) 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 kins 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. |
Year | DOI | Venue |
---|---|---|
1995 | 10.3115/981658.981666 | ACL |
Keywords | Field | DocType |
natural language lexicon,partial function,global context,full language,datr theory,datr model,default mechanism,mathematical semantics,non-monotonic language,formal model,declarative semantics,certain kin,indexation,natural language | Programming language,Computer science,Denotational semantics,DATR,Natural language,Natural language processing,Artificial intelligence,Partial function,Semantics | Conference |
Volume | Citations | PageRank |
cmp-lg/950 | 4 | 0.54 |
References | Authors | |
12 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bill Keller | 1 | 87 | 6.26 |