Inference in DATR
Roger Evans,Gerald Gazdar +1 more
- 10 Apr 1989
- pp 66-71
110
TL;DR: This paper presents the syntax and inference mechanisms for the DATR language, a declarative language for representing a restricted class of inheritance networks, permitting both multiple and default inheritance.
read more
Abstract: 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)
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Head-driven phrase structure grammar
Ivan A. Sag,Carl Jesse Pollard +1 more
- 01 Jan 1994
TL;DR: This book presents the most complete exposition of the theory of head-driven phrase structure grammar, introduced in the authors' "Information-Based Syntax and Semantics," and demonstrates the applicability of the HPSG approach to a wide range of empirical problems.
Verb semantics and lexical selection
Zhibiao Wu,Martha Palmer +1 more
- 27 Jun 1994
Abstract: This paper will focus on the semantic representation of verbs in computer systems and its impact on lexical selection problems in machine translation (MT). Two groups of English and Chinese verbs are examined to show that lexical selection must be based on interpretation of the sentences as well as selection restrictions placed on the verb arguments. A novel representation scheme is suggested, and is compared to representations with selection restrictions used in transfer-based MT. We see our approach as closely aligned with knowledge-based MT approaches (KBMT), and as a separate component that could be incorporated into existing systems. Examples and experimental results will show that, using this scheme, inexact matches can achieve correct lexical selection.
The Generative Lexicon
TL;DR: In this paper, I will discuss four major topics relating to current research in lexical semantics: methodology, descriptive coverage, adequacy of the representation, and the computational usefulness of representations.
3.2K
•Posted Content
Verb Semantics and Lexical Selection
Zhibiao Wu,Martha Palmer +1 more
TL;DR: This paper will focus on the semantic representation of verbs in computer systems and its impact on lexical selection problems in machine translation (MT), and sees the approach as closely aligned with knowledge-based MT approaches (KBMT), and as a separate component that could be incorporated into existing systems.
2.7K
Indirect Speech Acts
Nicholas Asher,Alex Lascarides +1 more
TL;DR: It is shown how a formal semantictheory of discourse interpretation can be used to define speech acts and to avoid murky issues concerning the metaphysics of action.
References
Semantical considerations on nonmonotonic logic
TL;DR: This paper gives a reconstruction of nonmonotonic logic as a model of an Ideally rational agent's reasoning about his own beliefs, and defines an Intuitively based semantics for which it can show autoeplstemlc logic to be both sound and complete.
1.1K
•Proceedings Article
Semantical considerations on nonmonotonic logic
Robert C. Moore
- 01 Oct 1987
TL;DR: In this paper, the authors give a reconstruction of non-monotonic logic as a model of an Ideally rational agent's reasoning about his own beliefs, and define an Intuitively based semantics for which they can show autoeplstemlc logic to be both sound and complete.
•Book
The mathematics of inheritance systems
David S. Touretzky
- 01 Jan 1984
TL;DR: A formal mathematical theory of inheritance is presented and it is shown how the defects in existing systems can be corrected, and how a correct implementation on a parallel marker propagation machine (PMPM) may be achieved through conditioning.
651
•Book
Reasoning With Incomplete Information
David W. Etherington
- 01 Jan 1988
TL;DR: An imaging optical system comprises at least one Fresnel face, which is such that the entire system images aplanatically.
225
•Proceedings Article
Possible-world semantics for autoepistemic logic
Robert C. Moore
- 01 Oct 1987
TL;DR: In this paper, an alternative, possible-world semantics for auto-epistemic logic is presented, which enables us to construct finite models for auto epistemic theories, as well as to demonstrate the existence of sound and complete theories based on given sets of premises.
Related Papers (5)
Gerald Gazdar,Ewan Klein,Geoffrey K. Pullum,Ivan A. Sag +3 more
- 01 Jan 1985
Carl Pollard,Ivan A. Sag +1 more
- 01 Jan 1987