<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="chen-abdul-mageed-2021-machine">
    <titleInfo>
        <title>Machine Translation of Low-Resource Indo-European Languages</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Wei-Rui</namePart>
        <namePart type="family">Chen</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Muhammad</namePart>
        <namePart type="family">Abdul-Mageed</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2021-nov</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Sixth Conference on Machine Translation</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Online</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>In this work, we investigate methods for the challenging task of translating between low- resource language pairs that exhibit some level of similarity. In particular, we consider the utility of transfer learning for translating between several Indo-European low-resource languages from the Germanic and Romance language families. In particular, we build two main classes of transfer-based systems to study how relatedness can benefit the translation performance. The primary system fine-tunes a model pre-trained on a related language pair and the contrastive system fine-tunes one pre-trained on an unrelated language pair. Our experiments show that although relatedness is not necessary for transfer learning to work, it does benefit model performance.</abstract>
    <identifier type="citekey">chen-abdul-mageed-2021-machine</identifier>
    <location>
        <url>https://aclanthology.org/2021.wmt-1.41</url>
    </location>
    <part>
        <date>2021-nov</date>
        <extent unit="page">
            <start>347</start>
            <end>353</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Machine Translation of Low-Resource Indo-European Languages
%A Chen, Wei-Rui
%A Abdul-Mageed, Muhammad
%S Proceedings of the Sixth Conference on Machine Translation
%D 2021
%8 nov
%I Association for Computational Linguistics
%C Online
%F chen-abdul-mageed-2021-machine
%X In this work, we investigate methods for the challenging task of translating between low- resource language pairs that exhibit some level of similarity. In particular, we consider the utility of transfer learning for translating between several Indo-European low-resource languages from the Germanic and Romance language families. In particular, we build two main classes of transfer-based systems to study how relatedness can benefit the translation performance. The primary system fine-tunes a model pre-trained on a related language pair and the contrastive system fine-tunes one pre-trained on an unrelated language pair. Our experiments show that although relatedness is not necessary for transfer learning to work, it does benefit model performance.
%U https://aclanthology.org/2021.wmt-1.41
%P 347-353

Markdown (Informal)

[Machine Translation of Low-Resource Indo-European Languages](https://aclanthology.org/2021.wmt-1.41) (Chen & Abdul-Mageed, WMT 2021)

• Machine Translation of Low-Resource Indo-European Languages (Chen & Abdul-Mageed, WMT 2021)

ACL

• Wei-Rui Chen and Muhammad Abdul-Mageed. 2021. Machine Translation of Low-Resource Indo-European Languages. In Proceedings of the Sixth Conference on Machine Translation, pages 347–353, Online. Association for Computational Linguistics.