2003 · 70 citations · 15 references
ComputingBioinformaticsComputational BiologyNatural Language ProcessingGenerative ModelingHidden Markov ModelsLanguage ModelingNatural Language GenerationText GenerationHidden Markov Model TrainingHidden Semi-markov ModelsMarkov Chain Text GenerationSequence Generation
In this paper, we present a method based on Hidden Markov Models (HMMs) to generate statistical stemmers. Using a list of words as training set, the method estimates the HMM parameters which are used to calculate the most probable stem for an arbitrary word. Stemming is performed by computing the most probable path, through the HMM states, corresponding to the input word. Linguistic knowledge or a training set of manually stemmed words are not required. We describe the method and the results of the experiments carried out using standard test collections for five different languages.
15
An algorithm for suffix stripping
Martin Porter · Program electronic library and information systems · 1980 · 8.1K citations
An Introduction to the Theory of Statistics
Development of a Stemming Algorithm
Julie B. Lovins · Mech. Transl. Comput. Linguistics · 1968 · 1.1K citations