<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="magri-2018-efficient">
    <titleInfo>
        <title>Efficient Computation of Implicational Universals in Constraint-Based Phonology Through the Hyperplane Separation Theorem</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Giorgio</namePart>
        <namePart type="family">Magri</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2018-10</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Fifteenth Workshop on Computational Research in Phonetics, Phonology, and Morphology</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Sandra</namePart>
            <namePart type="family">Kuebler</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Garrett</namePart>
            <namePart type="family">Nicolai</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Brussels, Belgium</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>This paper focuses on the most basic implicational universals in phonological theory, called T-orders after Anttila and Andrus (2006). It develops necessary and sufficient constraint characterizations of T-orders within Harmonic Grammar and Optimality Theory. These conditions rest on the rich convex geometry underlying these frameworks. They are phonologically intuitive and have significant algorithmic implications.</abstract>
    <identifier type="citekey">magri-2018-efficient</identifier>
    <identifier type="doi">10.18653/v1/W18-5801</identifier>
    <location>
        <url>https://aclanthology.org/W18-5801</url>
    </location>
    <part>
        <date>2018-10</date>
        <extent unit="page">
            <start>1</start>
            <end>10</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Efficient Computation of Implicational Universals in Constraint-Based Phonology Through the Hyperplane Separation Theorem
%A Magri, Giorgio
%Y Kuebler, Sandra
%Y Nicolai, Garrett
%S Proceedings of the Fifteenth Workshop on Computational Research in Phonetics, Phonology, and Morphology
%D 2018
%8 October
%I Association for Computational Linguistics
%C Brussels, Belgium
%F magri-2018-efficient
%X This paper focuses on the most basic implicational universals in phonological theory, called T-orders after Anttila and Andrus (2006). It develops necessary and sufficient constraint characterizations of T-orders within Harmonic Grammar and Optimality Theory. These conditions rest on the rich convex geometry underlying these frameworks. They are phonologically intuitive and have significant algorithmic implications.
%R 10.18653/v1/W18-5801
%U https://aclanthology.org/W18-5801
%U https://doi.org/10.18653/v1/W18-5801
%P 1-10

Markdown (Informal)

[Efficient Computation of Implicational Universals in Constraint-Based Phonology Through the Hyperplane Separation Theorem](https://aclanthology.org/W18-5801) (Magri, EMNLP 2018)

• Efficient Computation of Implicational Universals in Constraint-Based Phonology Through the Hyperplane Separation Theorem (Magri, EMNLP 2018)

ACL

• Giorgio Magri. 2018. Efficient Computation of Implicational Universals in Constraint-Based Phonology Through the Hyperplane Separation Theorem. In Proceedings of the Fifteenth Workshop on Computational Research in Phonetics, Phonology, and Morphology, pages 1–10, Brussels, Belgium. Association for Computational Linguistics.