Abstract
This paper describes a system for unsupervised morpheme analysis and the results it obtained at Morpho Challenge 2007. The system takes a plain list of words as input and returns a list of labelled morphemic segments for each word. Morphemic segments are obtained by an unsupervised learning process which can directly be applied to different natural languages. Results obtained at competition 1 (evaluation of the morpheme analyses) are better in English, Finnish and German than in Turkish. For information retrieval (competition 2), the best results are obtained when indexing is performed using Okapi (BM25) weighting for all morphemes minus those belonging to an automatic stop list made of the most common morphemes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kurimo, M., Creutz, M., Varjokallio, M.: Morpho Challenge Evaluation using a Linguistic Gold Standard. In: Peters, C., et al. (eds.) CLEF 2007. LNCS, vol. 5152, pp. 864–873. Springer, Heidelberg (2008)
Kurimo, M., Creutz, M., Turunen, V.: Morpho Challenge Evaluation by IR Experiments. In: Proceedings of the CLEF 2007 Workshop. LNCS. Springer, Heidelberg (2008)
Bernhard, D.: Unsupervised Morphological Segmentation Based on Segment Predictability and Word Segments Alignment. In: Kurimo, M., Creutz, M., Lagus, K. (eds.) Proceedings of the Pascal Challenges Workshop on the Unsupervised Segmentation of Words into Morphemes, Venice, Italy, pp. 19–23 (April 2006)
Déjean, H.: Morphemes as Necessary Concept for Structures Discovery from Untagged Corpora. In: Powers, D. (ed.) Proceedings of the CoNLL98 Workshop on Paradigms and Grounding in Language Learning, pp. 295–298 (1998)
Hafer, M.A., Weiss, S.F.: Word segmentation by letter successor varieties. Information Storage and Retrieval 10, 371–385 (1974)
Harris, Z.: From phoneme to morpheme. Language 31(2), 190–222 (1955)
Creutz, M., Lagus, K.: Induction of a Simple Morphology for Highly-Inflecting Languages. In: Proceedings of the 7th Meeting of the ACL Special Interest Group in Computational Phonology (SIGPHON), Barcelona, pp. 43–51 (2004)
Creutz, M., Lagus, K.: Inducing the Morphological Lexicon of a Natural Language from Unannotated Text. In: Proceedings of the International and Interdisciplinary Conference on Adaptive Knowledge Representation and Reasoning (AKRR 2005), Espoo, Finland, pp. 106–113 (2005)
Demberg, V.: A Language-Independent Unsupervised Model for Morphological Segmentation. In: Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, Prague, Czech Republic, pp. 920–927. Association for Computational Linguistics (2007)
Bordag, S.: Two-step Approach to Unsupervised Morpheme Segmentation. In: Proceedings of the Pascal Challenges Workshop on the Unsupervised Segmentation of Words into Morphemes, Venice, Italy, pp. 25–29 (2006)
Freitag, D.: Morphology Induction from Term Clusters. In: Proceedings of the Ninth Conference on Computational Natural Language Learning (CoNLL 2005), Ann Arbor, Michigan, pp. 128–135. Association for Computational Linguistics (2005)
Schone, P., Jurafsky, D.: Knowledge-Free Induction of Morphology Using Latent Semantic Analysis. In: Proceedings of the Fourth Conference on Computational Natural Language Learning and of the Second Learning Language in Logic Workshop, Lisbon, Portugal (September 2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernhard, D. (2008). Simple Morpheme Labelling in Unsupervised Morpheme Analysis. In: Peters, C., et al. Advances in Multilingual and Multimodal Information Retrieval. CLEF 2007. Lecture Notes in Computer Science, vol 5152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85760-0_112
Download citation
DOI: https://doi.org/10.1007/978-3-540-85760-0_112
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85759-4
Online ISBN: 978-3-540-85760-0
eBook Packages: Computer ScienceComputer Science (R0)