Conference Proceedings

A fast morphological algorithm with unknown word guessing induced by a dictionary for a web search engine

Proceedings of the International Conference on Machine Learning; Models, Technologies and Applications (2003) 273-280
135Citations
Citations of this article
59Readers
Mendeley users who have this article in their library.

Abstract

This paper describes a simple yet practical algorithm of morphological analysis and synthesis that uses a limited dictionary to obtain rather precise morphology of a wide lexical coverage. It doesn't imply any particular morphological model of the dictionary and is implemented for Russian, Polish and English. The design of the algorithm fits the constrains of modern web search engines.

Cite

CITATION STYLE

APA

Segalovich, I. (2003). A fast morphological algorithm with unknown word guessing induced by a dictionary for a web search engine. In Proceedings of the International Conference on Machine Learning; Models, Technologies and Applications (pp. 273–280).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free