Term-rewriting as a basis for a uniform architecture in machine translation
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Incremental speech translation
Incremental speech translation
| Hi-index | 0.00 |
In this paper we want to present the model of multi-level transfer that has been developed in the machine-translation project KIT-FAST as well as its partial realization in the sense of an MT system with sentence- semantic transfer. We introduce our general ideas about what an MT model should look like and we present the central (and at present only) level of transfer, namely the sentence-semantic representation language FAS (Functor-Argument-Structure). We are showing the transition from FAS expressions to FAS terms which is necessary because the transfer process in KIT-FAST is based on termrewrite systems, and we discuss the problem of termination, which is important for any term-rewrite system, and for a transfer component of an MT system in particular. The termination can be guaranteed by defining and order on the FAS terms. Finally we give a definition of the transfer process as it is implemented in our project and discuss how it is posssible to formulate transfer rules for interesting translation problems on the basis of FAS, given the constraints of the termination criterion. Moreover there are some indications as to the further development of the transfer component of KIT-FAST.