DATR

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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.

References[edit]

  1. ^ Vincent Ooi (B. Y.) (1998). Computer Corpus Lexicography. Edinburgh University Press. pp. 97–100. ISBN 978-0-7486-0815-7. Retrieved 20 February 2013. 
  2. ^ Evans, Roger; Gerald Gazdar (1996). "DATR: A language for lexical knowledge representation". Computational Linguistics 22 (2): 167–216. Retrieved 2014-03-17. 
  3. ^ Keller, Bill (1996). "An evaluation semantics for DATR theories". Proceedings of the 16th conference on Computational linguistics-Volume 2. Association for Computational Linguistics. Retrieved 2014-03-17. 

External links[edit]