Minds and Machines 4 (1):39-57 (1994)
AbstractThe resolution of ambiguities is one of the central problems for Machine Translation. In this paper we propose a knowledge-based approach to disambiguation which uses Description Logics (dl) as representation formalism. We present the process of anaphora resolution implemented in the Machine Translation systemfast and show how thedl systemback is used to support disambiguation.The disambiguation strategy uses factors representing syntactic, semantic, and conceptual constraints with different weights to choose the most adequate antecedent candidate. We show how these factors can be declaratively represented as defaults inback. Disambiguation is then achieved by determining the interpretation that yields a qualitatively minimal number of exceptions to the defaults, and can thus be formalized as exception minimization.
Similar books and articles
Symbolic Connectionism in Natural Language Disambiguation.James Franklin & S. W. K. Chan - 1998 - IEEE Transactions on Neural Networks 9:739-755.
Homophonic Translation and Disambiguation.Christopher M. Bache - 1980 - Journal of Critical Analysis 8 (2):35-43.
Towards the Use of Automated Reasoning in Discourse Disambiguation.Claire Gardent & Bonnie Webber - 2001 - Journal of Logic, Language and Information 10 (4):487-509.
The Representation of Context: Ideas From Artiﬁcial Intelligence.James Franklin - 2003 - Law, Probability and Risk 2:191-199.
Added to PP
Historical graph of downloads
Citations of this work
No citations found.
References found in this work
Generalized Phrase Structure Grammar.Gerald Gazdar, Ewan Klein, Geoffrey Pullum & Ivan Sag - 1989 - Philosophical Review 98 (4):556-566.
Semantic Networks.M. Ross Quillian - 1968 - In Marvin L. Minsky (ed.), Semantic Information Processing. MIT Press.