Graduate studies at Western
Minds and Machines 4 (1):39-57 (1994)
|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.|
|Keywords||Anaphora resolution description logics disambiguation machine translation|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
James Franklin & S. W. K. Chan (1998). Symbolic Connectionism in Natural Language Disambiguation. IEEE Transactions on Neural Networks 9:739-755.
James Franklin (2003). The Representation of Context: Ideas From Artiﬁcial Intelligence. Law, Probability and Risk 2:191-199.
Claire Gardent & Bonnie Webber (2001). Towards the Use of Automated Reasoning in Discourse Disambiguation. Journal of Logic, Language and Information 10 (4):487-509.
Samuel W. K. Chan & James Franklin (1998). Symbolic Connectionism in Natural Language Disambiguation. IEEE Transactions on Neural Networks 9:739-755.
Christopher M. Bache (1980). Homophonic Translation and Disambiguation. Journal of Critical Analysis 8 (2):35-43.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #294,406 of 757,559 )
Recent downloads (6 months)0
How can I increase my downloads?