<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="jappinen-etal-1991-kielikone">
    <titleInfo>
        <title>KIELIKONE Machine Translation Workstation</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Harri</namePart>
        <namePart type="family">Jäppinen</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">L</namePart>
        <namePart type="family">Kulikov</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">A</namePart>
        <namePart type="family">Ylä-Rotiala</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1991-jul 1-4</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of Machine Translation Summit III: Papers</title>
        </titleInfo>
        <originInfo>
            <place>
                <placeTerm type="text">Washington DC, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <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.</abstract>
    <identifier type="citekey">jappinen-etal-1991-kielikone</identifier>
    <location>
        <url>https://aclanthology.org/1991.mtsummit-papers.17</url>
    </location>
    <part>
        <date>1991-jul 1-4</date>
        <extent unit="page">
            <start>107</start>
            <end>111</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T KIELIKONE Machine Translation Workstation
%A Jäppinen, Harri
%A Kulikov, L.
%A Ylä-Rotiala, A.
%S Proceedings of Machine Translation Summit III: Papers
%D 1991
%8 jul 1 4
%C Washington DC, USA
%F jappinen-etal-1991-kielikone
%X 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.
%U https://aclanthology.org/1991.mtsummit-papers.17
%P 107-111

Markdown (Informal)

[KIELIKONE Machine Translation Workstation](https://aclanthology.org/1991.mtsummit-papers.17) (Jäppinen et al., MTSummit 1991)

• KIELIKONE Machine Translation Workstation (Jäppinen et al., MTSummit 1991)

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.