Article

ParaMor and Morpho challenge 2008

Authors:

Christian Monson,

Jaime Carbonell,

Lori LevinAuthors Info & Claims

CLEF'08: Proceedings of the 9th Cross-language evaluation forum conference on Evaluating systems for multilingual and multimodal information access

Pages 967 - 974

Published: 17 September 2008 Publication History

Abstract

We summarize the strong performance of ParaMor, an unsupervised morphology induction system, at Morpho Challenge 2008. When ParaMor's morphological analyses, which specialize at identifying inflectional morphology, are added to the analyses from the general-purpose unsupervised morphology induction system, Morfessor, the combined system identifies the morphemes of all five Morpho Challenge languages at recall scores higher than those of any other system which competed in the Challenge. These strong recall scores lead to F₁ values for morpheme identification as high as or higher than those of any competing system for all the competition languages but English.

References

[1]

Bernhard, D.: Simple Morpheme Labeling in Unsupervised Morpheme Analysis. In: Peters, C., Jijkoun, V., Mandl, T., Müller, H., Oard, D.W., Peñas, A., Petras, V., Santos, D. (eds.) CLEF 2007. LNCS, vol. 5152, pp. 873-880. Springer, Heidelberg (2008).

Digital Library

[2]

Bernhard, D.: Apprentissage non supervisé de familles morphologiques par classification ascendante hiérarchique. In: Actes de la 14e conférence sur le Traitement Automatique des Langues Naturelles, TALN (2007).

[3]

Brent, M.R., Murthy, S.K., Lundberg, A.: Discovering Morphemic Suffixes: A Case Study in MDL Induction. In: The Fifth International Workshop on Artificial Intelligence and Statistics (1995).

[4]

Comrie, B., Dryer, M.S., Gil, D., Haspelmath, M.: Introduction. In: Haspelmath, M., Dryer, M.S., Gil, D., Comrie, B. (eds.) The World Atlas of Language Structures. Oxford University Press, Oxford (2005).

[5]

Creutz, M.: Induction of the Morphology of Natural Language: Unsupervised Morpheme Segmentation with Application to Automatic Speech Recognition. Ph.D. Thesis. Computer and Information Science, Report D13. Helsinki: University of Technology, Es-poo, Finland (2006).

[6]

Goldsmith, J.: An Algorithm for the Unsupervised Learning of Morphology. Natural Language Engineering 12.4, 335-351 (2006).

Digital Library

[7]

Hammarström, H.: Unsupervised Learning of Morphology: Survey, Model, Algorithm and Experiments. Thesis for the Degree of Licentiate of Engineering. Chalmers, Göteborg University (2007).

[8]

Harris, Z.: From Phoneme to Morpheme. Language 31.2, 190-222 (1955).

[9]

Harris, Z.: Papers in Structural and Transformational Linguists. D. Reidel, Dordrecht (1970).

[10]

Kurimo, M., Turunen, V., Varjokallio, M.: Unsupervised Morpheme Analysis - Morpho Challenge (2008), http://www.cis.hut.fi/morphochallenge-2008/ (accessed on: August 11, 2008).

[11]

Monson, C.: ParaMor: From Paradigm Structure to Natural Language Morphology Induction. Ph.D. Thesis. Language Technologies Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania (2009).

Digital Library

[12]

Schone, P., Jurafsky, D.: Knowledge-Free Induction of Inflectional Morphologies. In: North American Chapter of the Association for Computational Linguistics, NAACL (2001).

Digital Library

[13]

Sharma, U., Kalita, J., Das, R.: Unsupervised Learning of Morphology for Building Lexicon for a Highly Inflectional Language. In: The Sixth Workshop of the ACL Special Interest Group in Computational Phonology, SIGPHON (2002).

Digital Library

[14]

Snover, M.G.: An Unsupervised Knowledge Free Algorithm for the Learning of Morphology in Natural Languages. M.S. Thesis. Computer Science, Sever Institute of Technology, Washington University, Saint Louis, Missouri (2002).

[15]

Stump, G.T.: Inflection. In: Spencer, A., Zwicky, A.M. (eds.) The Handbook of Morphology, Blackwell Publishers Inc., Malden (2001).

[16]

Wicentowski, R.: Modeling and Learning Multilingual Inflectional Morphology in a Minimally Supervised Framework. Ph.D. Thesis. Johns Hopkins University, Baltimore, Maryland (2002).

Digital Library

[17]

Zeman, D.: Using Unsupervised Paradigm Acquisition for Prefixes. In: Working Notes for the CLEF 2008 Workshop (2008).

Digital Library

Cited By

Vasudevan NBhattacharyya P(2012)Optimal stem identification in presence of suffix listProceedings of the 13th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I10.1007/978-3-642-28604-9_8(92-103)Online publication date: 11-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28604-9_8
Clifton ASarkar ALin D(2011)Combining morpheme-based machine translation with post-processing morpheme predictionProceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 110.5555/2002472.2002477(32-42)Online publication date: 19-Jun-2011
https://dl.acm.org/doi/10.5555/2002472.2002477
Spiegler SMonson CJoshi AHuang CJurafsky D(2010)EMMAProceedings of the 23rd International Conference on Computational Linguistics10.5555/1873781.1873897(1029-1037)Online publication date: 23-Aug-2010
https://dl.acm.org/doi/10.5555/1873781.1873897
Show More Cited By

Index Terms

ParaMor and Morpho challenge 2008
1. Computing methodologies
  1. Artificial intelligence
    1. Natural language processing
2. Hardware
  1. Power and energy
    1. Power estimation and optimization
      1. Platform power issues

Index terms have been assigned to the content through auto-classification.

Recommendations

Overview of Morpho challenge 2008
CLEF'08: Proceedings of the 9th Cross-language evaluation forum conference on Evaluating systems for multilingual and multimodal information access

This paper gives an overview of Morpho Challenge 2008 competition and results. The goal of the challenge was to evaluate unsupervised algorithms that provide morpheme analyses for words in different languages. For morphologically complex languages, such ...
Paramor: from paradigm structure to natural language morphology induction
ParaMor: minimally supervised induction of <u>para</u>digm structure and <u>mor</u>phological analysis
SigMorPhon '07: Proceedings of Ninth Meeting of the ACL Special Interest Group in Computational Morphology and Phonology

Paradigms provide an inherent organizational structure to natural language morphology. ParaMor, our minimally supervised morphology induction algorithm, retrusses the word forms of raw text corpora back onto their paradigmatic skeletons; performing on ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CLEF'08: Proceedings of the 9th Cross-language evaluation forum conference on Evaluating systems for multilingual and multimodal information access

September 2008

1002 pages

ISBN:3642044468

Editors:
Carol Peters
ISTI, CNR, Pisa, Italy
,
Thomas Deselaers
RWTH Aachen University, Germany
,
Nicola Ferro
University of Padua, Italy
,
Julio Gonzalo
LSI, UNED, Madrid, Spain
,
Anselmo Peñas
LSI, UNED, Madrid, Spain
,
Gareth J. F. Jones
Dublin City University, Ireland
,
Mikko Kurimo
Helsinki University of Technology, Finland
,
Thomas Mandl
University of Hildesheim, Germany
,
Vivien Petras
Homboldt University Berlin, Germany

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 17 September 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Vasudevan NBhattacharyya P(2012)Optimal stem identification in presence of suffix listProceedings of the 13th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I10.1007/978-3-642-28604-9_8(92-103)Online publication date: 11-Mar-2012
https://dl.acm.org/doi/10.1007/978-3-642-28604-9_8
Clifton ASarkar ALin D(2011)Combining morpheme-based machine translation with post-processing morpheme predictionProceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 110.5555/2002472.2002477(32-42)Online publication date: 19-Jun-2011
https://dl.acm.org/doi/10.5555/2002472.2002477
Spiegler SMonson CJoshi AHuang CJurafsky D(2010)EMMAProceedings of the 23rd International Conference on Computational Linguistics10.5555/1873781.1873897(1029-1037)Online publication date: 23-Aug-2010
https://dl.acm.org/doi/10.5555/1873781.1873897
Tepper MXia F(2010)Inducing Morphemes Using Light KnowledgeACM Transactions on Asian Language Information Processing10.1145/1731035.17310389:1(1-38)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1145/1731035.1731038
Kurimo MTurunen VVarjokallio M(2008)Overview of Morpho challenge 2008Proceedings of the 9th Cross-language evaluation forum conference on Evaluating systems for multilingual and multimodal information access10.5555/1813809.1813957(951-966)Online publication date: 17-Sep-2008
https://dl.acm.org/doi/10.5555/1813809.1813957

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents