<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="list-2019-automatic">
    <titleInfo>
        <title>Automatic Inference of Sound Correspondence Patterns across Multiple Languages</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Johann-Mattis</namePart>
        <namePart type="family">List</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2019-03</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>Sound correspondence patterns play a crucial role for linguistic reconstruction. Linguists use them to prove language relationship, to reconstruct proto-forms, and for classical phylogenetic reconstruction based on shared innovations. Cognate words that fail to conform with expected patterns can further point to various kinds of exceptions in sound change, such as analogy or assimilation of frequent words. Here I present an automatic method for the inference of sound correspondence patterns across multiple languages based on a network approach. The core idea is to represent all columns in aligned cognate sets as nodes in a network with edges representing the degree of compatibility between the nodes. The task of inferring all compatible correspondence sets can then be handled as the well-known minimum clique cover problem in graph theory, which essentially seeks to split the graph into the smallest number of cliques in which each node is represented by exactly one clique. The resulting partitions represent all correspondence patterns that can be inferred for a given data set. By excluding those patterns that occur in only a few cognate sets, the core of regularly recurring sound correspondences can be inferred. Based on this idea, the article presents a method for automatic correspondence pattern recognition, which is implemented as part of a Python library which supplements the article. To illustrate the usefulness of the method, I present how the inferred patterns can be used to predict words that have not been observed before.</abstract>
    <identifier type="citekey">list-2019-automatic</identifier>
    <identifier type="doi">10.1162/coli_a_00344</identifier>
    <location>
        <url>https://aclanthology.org/J19-1004</url>
    </location>
    <part>
        <date>2019-03</date>
        <detail type="volume"><number>45</number></detail>
        <detail type="issue"><number>1</number></detail>
        <extent unit="page">
            <start>137</start>
            <end>161</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Automatic Inference of Sound Correspondence Patterns across Multiple Languages
%A List, Johann-Mattis
%J Computational Linguistics
%D 2019
%8 March
%V 45
%N 1
%I MIT Press
%C Cambridge, MA
%F list-2019-automatic
%X Sound correspondence patterns play a crucial role for linguistic reconstruction. Linguists use them to prove language relationship, to reconstruct proto-forms, and for classical phylogenetic reconstruction based on shared innovations. Cognate words that fail to conform with expected patterns can further point to various kinds of exceptions in sound change, such as analogy or assimilation of frequent words. Here I present an automatic method for the inference of sound correspondence patterns across multiple languages based on a network approach. The core idea is to represent all columns in aligned cognate sets as nodes in a network with edges representing the degree of compatibility between the nodes. The task of inferring all compatible correspondence sets can then be handled as the well-known minimum clique cover problem in graph theory, which essentially seeks to split the graph into the smallest number of cliques in which each node is represented by exactly one clique. The resulting partitions represent all correspondence patterns that can be inferred for a given data set. By excluding those patterns that occur in only a few cognate sets, the core of regularly recurring sound correspondences can be inferred. Based on this idea, the article presents a method for automatic correspondence pattern recognition, which is implemented as part of a Python library which supplements the article. To illustrate the usefulness of the method, I present how the inferred patterns can be used to predict words that have not been observed before.
%R 10.1162/coli_a_00344
%U https://aclanthology.org/J19-1004
%U https://doi.org/10.1162/coli_a_00344
%P 137-161

Markdown (Informal)

[Automatic Inference of Sound Correspondence Patterns across Multiple Languages](https://aclanthology.org/J19-1004) (List, CL 2019)

• Automatic Inference of Sound Correspondence Patterns across Multiple Languages (List, CL 2019)

ACL

• Johann-Mattis List. 2019. Automatic Inference of Sound Correspondence Patterns across Multiple Languages. Computational Linguistics, 45(1):137–161.