KIELIKONE Machine Translation Workstation

Harri Jäppinen, L. Kulikov, A. Ylä-Rotiala


Abstract
All human languages are open and complex communication systems. No machine translation system will ever be able to automatically translate all possible sentences from one language to another in high quality. One way to combat complexity and openness of language translation is to decompose the task into well-defined sequential subtasks and solve each using declarative, modular rules. This paper describes such an MT system. A language-independent MT Machine has been designed for the transformation of linguistic trees in a general fashion. A full MT system is composed of a sequence of instances of that machine. Finnish-English implementation is discussed.
Anthology ID:
1991.mtsummit-papers.17
Volume:
Proceedings of Machine Translation Summit III: Papers
Month:
July 1-4
Year:
1991
Address:
Washington DC, USA
Venue:
MTSummit
SIG:
Publisher:
Note:
Pages:
107–111
Language:
URL:
https://aclanthology.org/1991.mtsummit-papers.17
DOI:
Bibkey:
Cite (ACL):
Harri Jäppinen, L. Kulikov, and A. Ylä-Rotiala. 1991. KIELIKONE Machine Translation Workstation. In Proceedings of Machine Translation Summit III: Papers, pages 107–111, Washington DC, USA.
Cite (Informal):
KIELIKONE Machine Translation Workstation (Jäppinen et al., MTSummit 1991)
Copy Citation:
PDF:
https://aclanthology.org/1991.mtsummit-papers.17.pdf