The mathematics of inheritance systems
The mathematics of inheritance systems
Proceedings of the Seventh Conference (AISB89) on Artificial Intelligence and Simulation of Behaviour
Reasoning with Incomplete Information
Reasoning with Incomplete Information
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
A tool for the automatic creation, extension and updating of lexical knowledge bases
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Structure-sharing in lexical representation
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Natural language generation from plans
Computational Linguistics
Inheritance and constraint-based grammar formalisms
Computational Linguistics - Special issue on inheritance: I
Feature structures and nonmonotonicity
Computational Linguistics - Special issue on inheritance: I
Inheritance in natural language processing
Computational Linguistics - Special issue on inheritance: I
Making DATR work for speech: lexicon compilation in SUNDIAL
Computational Linguistics - Special issue on inheritance: II
Inheritance and complementation: a case study of easy adjectives and related nouns
Computational Linguistics - Special issue on inheritance: II
Computational Linguistics
DATR: a language for lexical knowledge representation
Computational Linguistics
A Default Logic Based Framework for Context-Dependent Reasoning with Lexical Knowledge
Journal of Intelligent Information Systems
Spanish Inflectional Morphology in DATR
Journal of Logic, Language and Information
Bulgarian Noun - Definite Article in DATR
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Default representation in constraint-based frameworks
Computational Linguistics
Lexical rules in constraint-based grammars
Computational Linguistics
An inheritance-based lexicon for message understanding systems
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
Natural Language Engineering
Review of "English word grammar" by Richard Hudson. Basil Blackwell 1990.
Computational Linguistics
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Coping with derivation in a morphological component
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Prosodic Inheritance and morphological generalisations
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
DATR as a lexical component for PATR
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Encoding Lexicalized Tree Adjoining Grammars with a nonmonotonic inheritance hierarchy
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Defaults in unification grammar
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Using classification to generate text
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A high-level morphological description language exploiting inflectional paradigms
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
An evaluation semantics for DATR theories
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Enjoy the paper: lexical semantics via lexicology
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Sussex University: description of the Sussex system used for MUC-5
MUC5 '93 Proceedings of the 5th conference on Message understanding
Generating Hebrew verb morphology by default inheritance hierarchies
SEMITIC '02 Proceedings of the ACL-02 workshop on Computational approaches to semitic languages
A computational approach to Yorùbá morphology
AfLaT '09 Proceedings of the First Workshop on Language Technologies for African Languages
Using classification as a programming language
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Representing lexical knowledge for Bulgarian inflectional morphology in DATR
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
The geometry of language: a space semantic network of Bulgarian nominal inflectional morphology
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Hi-index | 0.00 |
DATR is a declarative language for representing a restricted class of inheritance networks, permitting both multiple and default inheritance. The principal intended area of application is the representation of lexical entries for natural language processing, and we use examples from this domain throughout. In this paper we present the syntax and inference mechanisms for the language. The goal of the DATR enterprise is the design of a simple language that (i) has the necessary expressive power to encode the lexical entries presupposed by contemporary work in the unification grammar tradition, (ii) can express all the evident generalizations about such entries, (iii) has an explicit theory of inference, (iv) is computationally tractable, and (v) has an explicit declarative semantics. The present paper is primarily concerned with (iii), though the examples used may hint at our strategy in respect of (i) and (ii).