No abstract

No abstract

The 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 system FAST and show how the DL system BACK 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 in BACK. 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.

No abstract

No abstract