<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="sumalvico-2017-unsupervised">
    <titleInfo>
        <title>Unsupervised Learning of Morphology with Graph Sampling</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Maciej</namePart>
        <namePart type="family">Sumalvico</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2017-sep</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the International Conference Recent Advances in Natural Language Processing, RANLP 2017</title>
        </titleInfo>
        <originInfo>
            <publisher>INCOMA Ltd.</publisher>
            <place>
                <placeTerm type="text">Varna, Bulgaria</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We introduce a language-independent, graph-based probabilistic model of morphology, which uses transformation rules operating on whole words instead of the traditional morphological segmentation. The morphological analysis of a set of words is expressed through a graph having words as vertices and structural relationships between words as edges. We define a probability distribution over such graphs and develop a sampler based on the Metropolis-Hastings algorithm. The sampling is applied in order to determine the strength of morphological relationships between words, filter out accidental similarities and reduce the set of rules necessary to explain the data. The model is evaluated on the task of finding pairs of morphologically similar words, as well as generating new words. The results are compared to a state-of-the-art segmentation-based approach.</abstract>
    <identifier type="citekey">sumalvico-2017-unsupervised</identifier>
    <identifier type="doi">10.26615/978-954-452-049-6_093</identifier>
    <part>
        <date>2017-sep</date>
        <extent unit="page">
            <start>723</start>
            <end>732</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Unsupervised Learning of Morphology with Graph Sampling
%A Sumalvico, Maciej
%S Proceedings of the International Conference Recent Advances in Natural Language Processing, RANLP 2017
%D 2017
%8 sep
%I INCOMA Ltd.
%C Varna, Bulgaria
%F sumalvico-2017-unsupervised
%X We introduce a language-independent, graph-based probabilistic model of morphology, which uses transformation rules operating on whole words instead of the traditional morphological segmentation. The morphological analysis of a set of words is expressed through a graph having words as vertices and structural relationships between words as edges. We define a probability distribution over such graphs and develop a sampler based on the Metropolis-Hastings algorithm. The sampling is applied in order to determine the strength of morphological relationships between words, filter out accidental similarities and reduce the set of rules necessary to explain the data. The model is evaluated on the task of finding pairs of morphologically similar words, as well as generating new words. The results are compared to a state-of-the-art segmentation-based approach.
%R 10.26615/978-954-452-049-6_093
%U https://doi.org/10.26615/978-954-452-049-6_093
%P 723-732

Markdown (Informal)

[Unsupervised Learning of Morphology with Graph Sampling](https://doi.org/10.26615/978-954-452-049-6_093) (Sumalvico, RANLP 2017)

• Unsupervised Learning of Morphology with Graph Sampling (Sumalvico, RANLP 2017)

ACL

• Maciej Sumalvico. 2017. Unsupervised Learning of Morphology with Graph Sampling. In Proceedings of the International Conference Recent Advances in Natural Language Processing, RANLP 2017, pages 723–732, Varna, Bulgaria. INCOMA Ltd..