<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="siewert-2026-efficient">
    <titleInfo>
        <title>Efficient universal generation in a fragment of Optimality Theory</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Paul</namePart>
        <namePart type="family">Siewert</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2026-07</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Society for Computation in Linguistics 2026</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Rob</namePart>
            <namePart type="family">Voigt</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Alex</namePart>
            <namePart type="family">Warstadt</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Naomi</namePart>
            <namePart type="family">Feldman</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Tal</namePart>
            <namePart type="family">Linzen</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">San Diego, CA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
        <identifier type="isbn">979-8-89176-412-5</identifier>
    </relatedItem>
    <abstract>Various work in computational phonology has studied the computational properties of Optimality Theory. Some algorithms exist for the universal generation problem, including those of Ellison and Tesar, but their domain of applicability is poorly understood. I propose and study a concrete ‘minimal’ fragment of finite-state Optimality Theory.I show that the universal generation problem for it is efficiently solvable by improving Ellison’s Algorithm, demonstrate that it has been implicitly used in the literature, and discuss its limitations.The minimal fragment is a natural and foundational step towards a computationally tractable general formalism for phonological analysis.</abstract>
    <identifier type="citekey">siewert-2026-efficient</identifier>
    <location>
        <url>https://aclanthology.org/2026.scil-main.27/</url>
    </location>
    <part>
        <date>2026-07</date>
        <extent unit="page">
            <start>294</start>
            <end>303</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Efficient universal generation in a fragment of Optimality Theory
%A Siewert, Paul
%Y Voigt, Rob
%Y Warstadt, Alex
%Y Feldman, Naomi
%Y Linzen, Tal
%S Proceedings of the Society for Computation in Linguistics 2026
%D 2026
%8 July
%I Association for Computational Linguistics
%C San Diego, CA
%@ 979-8-89176-412-5
%F siewert-2026-efficient
%X Various work in computational phonology has studied the computational properties of Optimality Theory. Some algorithms exist for the universal generation problem, including those of Ellison and Tesar, but their domain of applicability is poorly understood. I propose and study a concrete ‘minimal’ fragment of finite-state Optimality Theory.I show that the universal generation problem for it is efficiently solvable by improving Ellison’s Algorithm, demonstrate that it has been implicitly used in the literature, and discuss its limitations.The minimal fragment is a natural and foundational step towards a computationally tractable general formalism for phonological analysis.
%U https://aclanthology.org/2026.scil-main.27/
%P 294-303

Markdown (Informal)

[Efficient universal generation in a fragment of Optimality Theory](https://aclanthology.org/2026.scil-main.27/) (Siewert, SCiL 2026)

• Efficient universal generation in a fragment of Optimality Theory (Siewert, SCiL 2026)

ACL

• Paul Siewert. 2026. Efficient universal generation in a fragment of Optimality Theory. In Proceedings of the Society for Computation in Linguistics 2026, pages 294–303, San Diego, CA. Association for Computational Linguistics.