<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="janicki-2019-finite">
    <titleInfo>
        <title>Finite State Transducer Calculus for Whole Word Morphology</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Maciej</namePart>
        <namePart type="family">Janicki</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2019-09</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Heiko</namePart>
            <namePart type="family">Vogler</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Andreas</namePart>
            <namePart type="family">Maletti</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Dresden, Germany</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>The research on machine learning of morphology often involves formulating morphological descriptions directly on surface forms of words. As the established two-level morphology paradigm requires the knowledge of the underlying structure, it is not widely used in such settings. In this paper, we propose a formalism describing structural relationships between words based on theories of morphology that reject the notions of internal word structure and morpheme. The formalism covers a wide variety of morphological phenomena (including non-concatenative ones like stem vowel alternation) without the need of workarounds and extensions. Furthermore, we show that morphological rules formulated in such way can be easily translated to FSTs, which enables us to derive performant approaches to morphological analysis, generation and automatic rule discovery.</abstract>
    <identifier type="citekey">janicki-2019-finite</identifier>
    <identifier type="doi">10.18653/v1/W19-3107</identifier>
    <location>
        <url>https://aclanthology.org/W19-3107</url>
    </location>
    <part>
        <date>2019-09</date>
        <extent unit="page">
            <start>37</start>
            <end>45</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Finite State Transducer Calculus for Whole Word Morphology
%A Janicki, Maciej
%Y Vogler, Heiko
%Y Maletti, Andreas
%S Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing
%D 2019
%8 September
%I Association for Computational Linguistics
%C Dresden, Germany
%F janicki-2019-finite
%X The research on machine learning of morphology often involves formulating morphological descriptions directly on surface forms of words. As the established two-level morphology paradigm requires the knowledge of the underlying structure, it is not widely used in such settings. In this paper, we propose a formalism describing structural relationships between words based on theories of morphology that reject the notions of internal word structure and morpheme. The formalism covers a wide variety of morphological phenomena (including non-concatenative ones like stem vowel alternation) without the need of workarounds and extensions. Furthermore, we show that morphological rules formulated in such way can be easily translated to FSTs, which enables us to derive performant approaches to morphological analysis, generation and automatic rule discovery.
%R 10.18653/v1/W19-3107
%U https://aclanthology.org/W19-3107
%U https://doi.org/10.18653/v1/W19-3107
%P 37-45

Markdown (Informal)

[Finite State Transducer Calculus for Whole Word Morphology](https://aclanthology.org/W19-3107) (Janicki, FSMNLP 2019)

• Finite State Transducer Calculus for Whole Word Morphology (Janicki, FSMNLP 2019)

ACL

• Maciej Janicki. 2019. Finite State Transducer Calculus for Whole Word Morphology. In Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, pages 37–45, Dresden, Germany. Association for Computational Linguistics.