A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Term-rewriting as a basis for a uniform architecture in machine translation
1992
Proceedings of the 14th conference on Computational linguistics -
unpublished
In machine translation (MT) different levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be related to each other. This paper describes a declarative formalism on the basis of term-rewriting which maps one representation onto an equivalent adjacent one. The different levels (e.g. represented by derivational trees, feature structures or expressions of a knowledge representation language) can be represented as
doi:10.3115/992133.992189
fatcat:7pelu4v2qjesfgafzy4lbv2axy