Knowledge-based disambiguation for machine translation

Minds and Machines 4 (1):39-57 (1994)
  Copy   BIBTEX

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 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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,429

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
78 (#153,705)

6 months
1 (#417,143)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Semantics And Cognition.Ray S. Jackendoff - 1983 - Cambridge: MIT Press.
Semantics and Cognition.R. Jackendoff - 1985 - Linguistics and Philosophy 8 (4):505-519.
Semantic Networks.M. Ross Quillian - 1968 - In Marvin L. Minsky (ed.), Semantic Information Processing. MIT Press.

View all 9 references / Add more references