<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="janicki-2019-semi">
    <titleInfo>
        <title>Semi-Supervised Induction of POS-Tag Lexicons with Tree Models</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Maciej</namePart>
        <namePart type="family">Janicki</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2019-09</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the International Conference on Recent Advances in Natural Language Processing (RANLP 2019)</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Ruslan</namePart>
            <namePart type="family">Mitkov</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Galia</namePart>
            <namePart type="family">Angelova</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>INCOMA Ltd.</publisher>
            <place>
                <placeTerm type="text">Varna, Bulgaria</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We approach the problem of POS tagging of morphologically rich languages in a setting where only a small amount of labeled training data is available. We show that a bigram HMM tagger benefits from re-training on a larger untagged text using Baum-Welch estimation. Most importantly, this estimation can be significantly improved by pre-guessing tags for OOV words based on morphological criteria. We consider two models for this task: a character-based recurrent neural network, which guesses the tag from the string form of the word, and a recently proposed graph-based model of morphological transformations. In the latter, the unknown POS tags can be modeled as latent variables in a way very similar to Hidden Markov Tree models and an analogue of the Forward-Backward algorithm can be formulated, which enables us to compute expected values over unknown taggings. We evaluate both the quality of the induced tag lexicon and its impact on the HMM’s tagging accuracy. In both tasks, the graph-based morphology model performs significantly better than the RNN predictor. This confirms the intuition that morphologically related words provide useful information about an unknown word’s POS tag.</abstract>
    <identifier type="citekey">janicki-2019-semi</identifier>
    <identifier type="doi">10.26615/978-954-452-056-4_060</identifier>
    <location>
        <url>https://aclanthology.org/R19-1060</url>
    </location>
    <part>
        <date>2019-09</date>
        <extent unit="page">
            <start>507</start>
            <end>515</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Semi-Supervised Induction of POS-Tag Lexicons with Tree Models
%A Janicki, Maciej
%Y Mitkov, Ruslan
%Y Angelova, Galia
%S Proceedings of the International Conference on Recent Advances in Natural Language Processing (RANLP 2019)
%D 2019
%8 September
%I INCOMA Ltd.
%C Varna, Bulgaria
%F janicki-2019-semi
%X We approach the problem of POS tagging of morphologically rich languages in a setting where only a small amount of labeled training data is available. We show that a bigram HMM tagger benefits from re-training on a larger untagged text using Baum-Welch estimation. Most importantly, this estimation can be significantly improved by pre-guessing tags for OOV words based on morphological criteria. We consider two models for this task: a character-based recurrent neural network, which guesses the tag from the string form of the word, and a recently proposed graph-based model of morphological transformations. In the latter, the unknown POS tags can be modeled as latent variables in a way very similar to Hidden Markov Tree models and an analogue of the Forward-Backward algorithm can be formulated, which enables us to compute expected values over unknown taggings. We evaluate both the quality of the induced tag lexicon and its impact on the HMM’s tagging accuracy. In both tasks, the graph-based morphology model performs significantly better than the RNN predictor. This confirms the intuition that morphologically related words provide useful information about an unknown word’s POS tag.
%R 10.26615/978-954-452-056-4_060
%U https://aclanthology.org/R19-1060
%U https://doi.org/10.26615/978-954-452-056-4_060
%P 507-515

Markdown (Informal)

[Semi-Supervised Induction of POS-Tag Lexicons with Tree Models](https://aclanthology.org/R19-1060) (Janicki, RANLP 2019)

• Semi-Supervised Induction of POS-Tag Lexicons with Tree Models (Janicki, RANLP 2019)

ACL

• Maciej Janicki. 2019. Semi-Supervised Induction of POS-Tag Lexicons with Tree Models. In Proceedings of the International Conference on Recent Advances in Natural Language Processing (RANLP 2019), pages 507–515, Varna, Bulgaria. INCOMA Ltd..