KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Standard

KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion. / Aguirrezabal Zabaleta, Manex; Wedekind, Jürgen.

Proceedings of the 17th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology. Association for Computational Linguistics, 2020. p. 111-116.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Harvard

Aguirrezabal Zabaleta, M & Wedekind, J 2020, KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion. in Proceedings of the 17th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology. Association for Computational Linguistics, pp. 111-116. https://doi.org/10.18653/v1/2020.sigmorphon-1.11

APA

Aguirrezabal Zabaleta, M., & Wedekind, J. (2020). KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion. In Proceedings of the 17th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology (pp. 111-116). Association for Computational Linguistics. https://doi.org/10.18653/v1/2020.sigmorphon-1.11

Vancouver

Aguirrezabal Zabaleta M, Wedekind J. KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion. In Proceedings of the 17th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology. Association for Computational Linguistics. 2020. p. 111-116 https://doi.org/10.18653/v1/2020.sigmorphon-1.11

Author

Aguirrezabal Zabaleta, Manex ; Wedekind, Jürgen. / KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion. Proceedings of the 17th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology. Association for Computational Linguistics, 2020. pp. 111-116

Bibtex

@inproceedings{fd4fd8b867e341b8ad80de44f7b580fe,
title = "KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion",
abstract = "We present a model for the unsupervised discovery of morphological paradigms. The goal of this model is to induce morphological paradigms from the bible (raw text) and a list of lemmas. We have created a model that splits each lemma in a stem and a suffix, and then we try to create a plausible suffix list by considering lemma pairs. Our model was not able to outperform the official baseline, and there is still room for improvement, but we believe that the ideas presented here are worth considering.",
author = "{Aguirrezabal Zabaleta}, Manex and J{\"u}rgen Wedekind",
year = "2020",
month = jul,
doi = "10.18653/v1/2020.sigmorphon-1.11",
language = "English",
pages = "111--116",
booktitle = "Proceedings of the 17th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology",
publisher = "Association for Computational Linguistics",

}

RIS

TY - GEN

T1 - KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion

AU - Aguirrezabal Zabaleta, Manex

AU - Wedekind, Jürgen

PY - 2020/7

Y1 - 2020/7

N2 - We present a model for the unsupervised discovery of morphological paradigms. The goal of this model is to induce morphological paradigms from the bible (raw text) and a list of lemmas. We have created a model that splits each lemma in a stem and a suffix, and then we try to create a plausible suffix list by considering lemma pairs. Our model was not able to outperform the official baseline, and there is still room for improvement, but we believe that the ideas presented here are worth considering.

AB - We present a model for the unsupervised discovery of morphological paradigms. The goal of this model is to induce morphological paradigms from the bible (raw text) and a list of lemmas. We have created a model that splits each lemma in a stem and a suffix, and then we try to create a plausible suffix list by considering lemma pairs. Our model was not able to outperform the official baseline, and there is still room for improvement, but we believe that the ideas presented here are worth considering.

U2 - 10.18653/v1/2020.sigmorphon-1.11

DO - 10.18653/v1/2020.sigmorphon-1.11

M3 - Article in proceedings

SP - 111

EP - 116

BT - Proceedings of the 17th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology

PB - Association for Computational Linguistics

ER -

ID: 246783503