<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="voeten-van-zaanen-2018-influence">
    <titleInfo>
        <title>The Influence of Context on the Learning of Metrical Stress Systems Using Finite-State Machines</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Cesko</namePart>
        <namePart type="family">Voeten</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Menno</namePart>
        <namePart type="family">van Zaanen</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2018-06</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <genre authority="bibutilsgt">journal article</genre>
    <relatedItem type="host">
        <titleInfo>
            <title>Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <issuance>continuing</issuance>
            <publisher>MIT Press</publisher>
            <place>
                <placeTerm type="text">Cambridge, MA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">periodical</genre>
        <genre authority="bibutilsgt">academic journal</genre>
    </relatedItem>
    <abstract>Languages vary in the way stress is assigned to syllables within words. This article investigates the learnability of stress systems in a wide range of languages. The stress systems can be described using finite-state automata with symbols indicating levels of stress (primary, secondary, or no stress). Finite-state automata have been the focus of research in the area of grammatical inference for some time now. It has been shown that finite-state machines are learnable from examples using state-merging. One such approach, which aims to learn k-testable languages, has been applied to stress systems with some success. The family of k-testable languages has been shown to be efficiently learnable (in polynomial time). Here, we extend this approach to k, l-local languages by taking not only left context, but also right context, into account. We consider empirical results testing the performance of our learner using various amounts of context (corresponding to varying definitions of phonological locality). Our results show that our approach of learning stress patterns using state-merging is more reliant on left context than on right context. Additionally, some stress systems fail to be learned by our learner using either the left-context k-testable or the left-and-right-context k, l-local learning system. A more complex merging strategy, and hence grammar representation, is required for these stress systems.</abstract>
    <identifier type="citekey">voeten-van-zaanen-2018-influence</identifier>
    <identifier type="doi">10.1162/COLI_a_00317</identifier>
    <location>
        <url>https://aclanthology.org/J18-2004</url>
    </location>
    <part>
        <date>2018-06</date>
        <detail type="volume"><number>44</number></detail>
        <detail type="issue"><number>2</number></detail>
        <extent unit="page">
            <start>329</start>
            <end>348</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T The Influence of Context on the Learning of Metrical Stress Systems Using Finite-State Machines
%A Voeten, Cesko
%A van Zaanen, Menno
%J Computational Linguistics
%D 2018
%8 June
%V 44
%N 2
%I MIT Press
%C Cambridge, MA
%F voeten-van-zaanen-2018-influence
%X Languages vary in the way stress is assigned to syllables within words. This article investigates the learnability of stress systems in a wide range of languages. The stress systems can be described using finite-state automata with symbols indicating levels of stress (primary, secondary, or no stress). Finite-state automata have been the focus of research in the area of grammatical inference for some time now. It has been shown that finite-state machines are learnable from examples using state-merging. One such approach, which aims to learn k-testable languages, has been applied to stress systems with some success. The family of k-testable languages has been shown to be efficiently learnable (in polynomial time). Here, we extend this approach to k, l-local languages by taking not only left context, but also right context, into account. We consider empirical results testing the performance of our learner using various amounts of context (corresponding to varying definitions of phonological locality). Our results show that our approach of learning stress patterns using state-merging is more reliant on left context than on right context. Additionally, some stress systems fail to be learned by our learner using either the left-context k-testable or the left-and-right-context k, l-local learning system. A more complex merging strategy, and hence grammar representation, is required for these stress systems.
%R 10.1162/COLI_a_00317
%U https://aclanthology.org/J18-2004
%U https://doi.org/10.1162/COLI_a_00317
%P 329-348

Markdown (Informal)

[The Influence of Context on the Learning of Metrical Stress Systems Using Finite-State Machines](https://aclanthology.org/J18-2004) (Voeten & van Zaanen, CL 2018)

• The Influence of Context on the Learning of Metrical Stress Systems Using Finite-State Machines (Voeten & van Zaanen, CL 2018)

ACL

• Cesko Voeten and Menno van Zaanen. 2018. The Influence of Context on the Learning of Metrical Stress Systems Using Finite-State Machines. Computational Linguistics, 44(2):329–348.