<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="dolatian-heinz-2018-modeling">
    <titleInfo>
        <title>Modeling Reduplication with 2-way Finite-State Transducers</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Hossep</namePart>
        <namePart type="family">Dolatian</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Jeffrey</namePart>
        <namePart type="family">Heinz</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2018-10</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Fifteenth Workshop on Computational Research in Phonetics, Phonology, and Morphology</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Sandra</namePart>
            <namePart type="family">Kuebler</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Garrett</namePart>
            <namePart type="family">Nicolai</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Brussels, Belgium</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>This article describes a novel approach to the computational modeling of reduplication. Reduplication is a well-studied linguistic phenomenon. However, it is often treated as a stumbling block within finite-state treatments of morphology. Most finite-state implementations of computational morphology cannot adequately capture the productivity of unbounded copying in reduplication, nor can they adequately capture bounded copying. We show that an understudied type of finite-state machines, two-way finite-state transducers (2-way FSTs), captures virtually all reduplicative processes, including total reduplication. 2-way FSTs can model reduplicative typology in a way which is convenient, easy to design and debug in practice, and linguistically-motivated. By virtue of being finite-state, 2-way FSTs are likewise incorporable into existing finite-state systems and programs. A small but representative typology of reduplicative processes is described in this article, alongside their corresponding 2-way FST models.</abstract>
    <identifier type="citekey">dolatian-heinz-2018-modeling</identifier>
    <identifier type="doi">10.18653/v1/W18-5807</identifier>
    <location>
        <url>https://aclanthology.org/W18-5807/</url>
    </location>
    <part>
        <date>2018-10</date>
        <extent unit="page">
            <start>66</start>
            <end>77</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Modeling Reduplication with 2-way Finite-State Transducers
%A Dolatian, Hossep
%A Heinz, Jeffrey
%Y Kuebler, Sandra
%Y Nicolai, Garrett
%S Proceedings of the Fifteenth Workshop on Computational Research in Phonetics, Phonology, and Morphology
%D 2018
%8 October
%I Association for Computational Linguistics
%C Brussels, Belgium
%F dolatian-heinz-2018-modeling
%X This article describes a novel approach to the computational modeling of reduplication. Reduplication is a well-studied linguistic phenomenon. However, it is often treated as a stumbling block within finite-state treatments of morphology. Most finite-state implementations of computational morphology cannot adequately capture the productivity of unbounded copying in reduplication, nor can they adequately capture bounded copying. We show that an understudied type of finite-state machines, two-way finite-state transducers (2-way FSTs), captures virtually all reduplicative processes, including total reduplication. 2-way FSTs can model reduplicative typology in a way which is convenient, easy to design and debug in practice, and linguistically-motivated. By virtue of being finite-state, 2-way FSTs are likewise incorporable into existing finite-state systems and programs. A small but representative typology of reduplicative processes is described in this article, alongside their corresponding 2-way FST models.
%R 10.18653/v1/W18-5807
%U https://aclanthology.org/W18-5807/
%U https://doi.org/10.18653/v1/W18-5807
%P 66-77

Markdown (Informal)

[Modeling Reduplication with 2-way Finite-State Transducers](https://aclanthology.org/W18-5807/) (Dolatian & Heinz, EMNLP 2018)

• Modeling Reduplication with 2-way Finite-State Transducers (Dolatian & Heinz, EMNLP 2018)

ACL

• Hossep Dolatian and Jeffrey Heinz. 2018. Modeling Reduplication with 2-way Finite-State Transducers. In Proceedings of the Fifteenth Workshop on Computational Research in Phonetics, Phonology, and Morphology, pages 66–77, Brussels, Belgium. Association for Computational Linguistics.