<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="jardine-heinz-2016-learning">
    <titleInfo>
        <title>Learning Tier-based Strictly 2-Local Languages</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Adam</namePart>
        <namePart type="family">Jardine</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>2016</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <genre>journal article</genre>
    <relatedItem type="host">
        <titleInfo>
            <title>Transactions of the Association for 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>academic journal</genre>
    </relatedItem>
    <abstract>The Tier-based Strictly 2-Local (TSL2) languages are a class of formal languages which have been shown to model long-distance phonotactic generalizations in natural language (Heinz et al., 2011). This paper introduces the Tier-based Strictly 2-Local Inference Algorithm (2TSLIA), the first nonenumerative learner for the TSL2 languages. We prove the 2TSLIA is guaranteed to converge in polynomial time on a data sample whose size is bounded by a constant.</abstract>
    <identifier type="citekey">jardine-heinz-2016-learning</identifier>
    <identifier type="doi">10.1162/tacl_a_00085</identifier>
    <location>
        <url>https://aclanthology.org/Q16-1007</url>
    </location>
    <part>
        <date>2016</date>
        <detail type="volume"><number>4</number></detail>
        <extent unit="page">
            <start>87</start>
            <end>98</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Learning Tier-based Strictly 2-Local Languages
%A Jardine, Adam
%A Heinz, Jeffrey
%J Transactions of the Association for Computational Linguistics
%D 2016
%V 4
%I MIT Press
%C Cambridge, MA
%F jardine-heinz-2016-learning
%X The Tier-based Strictly 2-Local (TSL2) languages are a class of formal languages which have been shown to model long-distance phonotactic generalizations in natural language (Heinz et al., 2011). This paper introduces the Tier-based Strictly 2-Local Inference Algorithm (2TSLIA), the first nonenumerative learner for the TSL2 languages. We prove the 2TSLIA is guaranteed to converge in polynomial time on a data sample whose size is bounded by a constant.
%9 journal article
%R 10.1162/tacl_a_00085
%U https://aclanthology.org/Q16-1007
%U https://doi.org/10.1162/tacl_a_00085
%P 87-98

Markdown (Informal)

[Learning Tier-based Strictly 2-Local Languages](https://aclanthology.org/Q16-1007) (Jardine & Heinz, TACL 2016)

• Learning Tier-based Strictly 2-Local Languages (Jardine & Heinz, TACL 2016)

ACL

• Adam Jardine and Jeffrey Heinz. 2016. Learning Tier-based Strictly 2-Local Languages. Transactions of the Association for Computational Linguistics, 4:87–98.