Detecting Inflection Patterns in Natural Language by Minimization of Morphological Model
One of the most important steps in text processing and information retrieval is stemming – reducing of words to stems expressing their base meaning, e.g., bake, baked, bakes, baking → bak-. We suggest an unsupervised method of recognition such inflection patterns automatically, with no a priori information on the given language, basing exclusively on a list of words extracted from a large text. For a given word list V we construct two sets of strings: stems S and endings E, such that each word from V is a concatenation of a stem from S and ending from E. To select an optimal model, we minimize the total number of elements in S and E. Though such a simplistic model does not reflect many phenomena of real natural language morphology, it shows surprisingly promising results on different European languages. In addition to practical value, we believe that this can also shed light on the nature of human language.
KeywordsLetter String European Language Good Approximate Solution Porter Stemmer Inflective Language
- 1.Alexandrov, M., Blanco, X., Gelbukh, A., Makagonov, P.: Knowledge-poor Approach to Constructing Word Frequency Lists, with Examples from Romance Languages. Procesamiento de Lenguaje Natural 33 (2004)Google Scholar
- 3.Goldsmith, J.: Unsupervised Learning of the Morphology of a Natural Language. Computational Linguistics 27(2) (2001)Google Scholar
- 4.Porter, M.F.: An algorithm for suffix stripping. Program 14(3), 130–137 (1980)Google Scholar