<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="lamont-2021-optimizing">
    <titleInfo>
        <title>Optimizing over subsequences generates context-sensitive languages</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Andrew</namePart>
        <namePart type="family">Lamont</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2021</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <genre authority="bibutilsgt">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 authority="bibutilsgt">academic journal</genre>
    </relatedItem>
    <abstract>Phonological generalizations are finite-state. While Optimality Theory is a popular framework for modeling phonology, it is known to generate non-finite-state mappings and languages. This paper demonstrates that Optimality Theory is capable of generating non-context-free languages, contributing to the characterization of its generative capacity. This is achieved with minimal modification to the theory as it is standardly employed.</abstract>
    <identifier type="citekey">lamont-2021-optimizing</identifier>
    <identifier type="doi">10.1162/tacl_a_00382</identifier>
    <location>
        <url>https://aclanthology.org/2021.tacl-1.32</url>
    </location>
    <part>
        <date>2021</date>
        <detail type="volume"><number>9</number></detail>
        <extent unit="page">
            <start>528</start>
            <end>537</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Optimizing over subsequences generates context-sensitive languages
%A Lamont, Andrew
%J Transactions of the Association for Computational Linguistics
%D 2021
%V 9
%I MIT Press
%C Cambridge, MA
%F lamont-2021-optimizing
%X Phonological generalizations are finite-state. While Optimality Theory is a popular framework for modeling phonology, it is known to generate non-finite-state mappings and languages. This paper demonstrates that Optimality Theory is capable of generating non-context-free languages, contributing to the characterization of its generative capacity. This is achieved with minimal modification to the theory as it is standardly employed.
%R 10.1162/tacl_a_00382
%U https://aclanthology.org/2021.tacl-1.32
%U https://doi.org/10.1162/tacl_a_00382
%P 528-537

Markdown (Informal)

[Optimizing over subsequences generates context-sensitive languages](https://aclanthology.org/2021.tacl-1.32) (Lamont, TACL 2021)

• Optimizing over subsequences generates context-sensitive languages (Lamont, TACL 2021)

ACL

• Andrew Lamont. 2021. Optimizing over subsequences generates context-sensitive languages. Transactions of the Association for Computational Linguistics, 9:528–537.