DATR: Difference between revisions
imported>Heythereimaguy Reverted 1 edit by 49.237.12.42 (talk): Unexplained ref deletion |
imported>InternetArchiveBot Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0.9.5 |
||
| (One intermediate revision by one other user not shown) | |||
| Line 11: | Line 11: | ||
==External links== | ==External links== | ||
*[http://www.datr.org.uk/ DATR at the University of Sussex] | *[http://www.datr.org.uk/ DATR at the University of Sussex] {{Webarchive|url=https://web.archive.org/web/20160304085525/http://www.datr.org.uk/ |date=2016-03-04 }} | ||
*[https://web.archive.org/web/20110719101756/http://www.spectrum.uni-bielefeld.de/DATR/index.html DATR repository and RFC compliant ZDATR implementation at Universität Bielefeld] | *[https://web.archive.org/web/20110719101756/http://www.spectrum.uni-bielefeld.de/DATR/index.html DATR repository and RFC compliant ZDATR implementation at Universität Bielefeld] | ||
| Line 18: | Line 18: | ||
{{ | {{NLP-stub}} | ||
Latest revision as of 02:24, 18 July 2025
Template:More citations needed
DATR is a language for lexical knowledge representation.[1] The lexical knowledge is encoded in a network of nodes. Each node has a set of attributes encoded with it. A node can represent a word or a word form.
DATR was developed in the late 1980s by Roger Evans, Gerald Gazdar and Bill Keller,[2][3] and used extensively in the 1990s; the standard specification is contained in the Evans and Gazdar RFC, available on the Sussex website (below). DATR has been implemented in a variety of programming languages, and several implementations are available on the internet, including an RFC compliant implementation at the Bielefeld website (below).
DATR is still used for encoding inheritance networks in various linguistic and non-linguistic domains and is under discussion as a standard notation for the representation of lexical information.